This 6 × 6 square has three Z-tiles (red) and eight V-tiles (blue).
You want to build a 9 × 9 square using these two types of tiles, both of which can be rotated and reflected.
What is the maximum number of Z-tiles you can use?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
This problem can be extended, as this method is specifically for the odd by odd dimension case: what about the even by even dimension case, or when we have a rectangle?
Genius! Btw, I found a similar question in Putnam Paper 2016 Question A4. https://kskedlaya.org/putnam-archive/2016s.pdf
genius, may I ask how do you apply the same method on 6*6? I used 4z+3v=6^2, z+v>=9, it doesn't work.
Log in to reply
i tried, it seems like even * even doesnt work, only odd * odd works.
Log in to reply
If it does not work on even even, how can we prove that it works on odd odd? How can we say for sure that 6 is the solution for 9*9?
Log in to reply
@Yan Zhao – the prove for odd case involve 2 steps : 1. find the upper bound via coloring (z<=6); 2. try to construct with z=6.
remember, just because we found z<=6 is the upper bound, doesnt mean 6 is the maximum (i explicitly stated this in the solution)
for odd, upperbound = maximum = 6 (because we can construct an example).
for even, we found z<=9 is the upper bound, but it is possible that this is not the maximum (which is true in this case)
Log in to reply
@Albert Yiyi – So in the end, we have to prove by constructing an example, but I see your point, it does prove that 6 is the solution for 9*9.
Log in to reply
@Yan Zhao – yes, im trying to find a prove for even case, not much progress though.
@Yan Zhao – u might wanna know the difference between upper bound and maximum.
Excellent solution. It might be an idea to remove the provision of three attempts from the problem, since the number of z tiles has to be a multiple of 3, and there are only four realistic possibilities (3 as in the 6 x 6 shape, 6, 9 and 12). Please note that I gave the correct answer (6) at the first attempt.
Log in to reply
the only option we have is:
multiple choice: one chance
numbers: 3 chance
other than that, we have no way to set the number of chance.
I am puzzled by the question what is the maximum number of z tiles that you can use in a 9 by 9 square. An 18 by 18 square is also a 9 by 9 square by taking a unit twice as large as shown in the 6 by 6 square.
Albert Lau, there is no "obviously" about it, especially as 4z + 3v = 5^2, NOT 9^2.
Log in to reply
each z piece covers exactly 4 tiles and v piece covers exactly 3 tiles. since there are a total of 9 2 = 8 1 tiles, we have the above equation. hope that clears up.
What is the minimum dimension of the square which can be covered this way?
probably 6x6, we can prove 5x5 is impossible using similar method, and anything below 4x4 can trial and error.
5x9 tiles have maximum 0 (Z type) tetraminoes and 2x9 tiles have maximum 3 (Z type) tetraminoes.
Both rectangular tiles are considered in combination of L type triominoes with Z type tetraminoes.
Combining together {5x9+2x9+2x9}we get 9x9 tiling with 19 (L type) triominoes and 6 (Z type) tetraminoes as the answer.
6 is the answer!
Problem Loading...
Note Loading...
Set Loading...
let z = no. of Z-tile used, v = no. of V-tile used.
obviously, we have: 4 z + 3 v = 9 2 ⟹ v = 2 7 − 3 4 z — — ( 1 ) next, we color the 9 by 9 board as shown:
notice that Z-tiles always cover exactly 1 dark tile, V-tiles cover either 0 or 1 dark tile. since there are 25 dark tiles, we will need at least 25 Z or V tiles. hence
z
+
v
≥
2
5
—
—
(
2
)
subs (1) into (2), simplify, we have:
z
+
2
7
−
3
4
z
≥
2
5
⟹
z
≤
6
we prove that more than 6 is impossible, but that doesnt mean 6 is the maximum (yet).
to complete the proof, we have to construct an example by trial and error. fortunately we can use the dark tiles as a guide to improve our chance.
from (1), if z = 6 , v = 1 9 , z + v = 2 5 , this means every Z and V-tile must cover exactly one dark tile. within reasonable time, we can fit them together.
∴
z
=
6