Mr. Markus would like to place tiles on the floor sized 3 x 1 0 m 2 . Mr. Markus only have tiles sized 3 x 1 m 2 . How many way that Mr. Markus can use to set the tiles?
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.
I'm not sure why, but there is an additional space between your "\" and the "(", which is why the Latex doesn't display correctly. I've edited your problem to make it display correctly.
Log in to reply
Thanks sir
Log in to reply
Still doesn't display correctly @Rizky Riman ... maybe u can try editing the spaces?
It still doesn't display correctly or at all for me.
Log in to reply
Same here.
Log in to reply
@Sharky Kesa – I agree it doesnot work for me sometimes
can you just do it a bit clearly?
I hope you give a source.. this problem is from Indonesia Science Olympiad..
First, note that this is a recurrence problem. Let a n denotes the number of ways to place 3 × 1 tiles on a 3 × n floor. Then, realize that for n ≥ 3 , you have 2 ways to place the first few tiles:
Simply place 1 tile vertically. (Then there will be a n − 1 ways to place the rest of the tiles needed. (Since we have left with a ( n − 1 ) × 3 block)
Second, place 3 tiles horizontally, and you will be left with a n − 3 ways to arrange. (Since we have left with a ( n − 3 ) × 3 block)
Notice that there isn't any other way to tile the first few tiles (e.g. 2 tiles horizontally, because this arrangement forces the next tile placed to be also horizontal, and this becomes Case 2 above).
Therefore, we can formulate a recurrence:
a n = a n − 1 + a n − 3 for all n ≥ 4 .
We can easily come up with a 1 = 1 , a 2 = 1 , a 3 = 2 . Repeating the steps, we get a 1 0 = 2 8 .
//This is a recurrence //you can make a pattern at the paper..
//are you see the patern?
//so [3 x n] = [3 x n -1] + [3 x n - 3], to finding 3 x 10 (we must using bottom up)
Problem Loading...
Note Loading...
Set Loading...
The answer is 28.
If you try it from \( 3 x 1 m^{2} \) tiles, you'll find the pattern. Here it is.
\( 3 x 1 m^{2} = 1\)
\( 3 x 2 m^{2} = 1\)
\( 3 x 3 m^{2} = 2\)
\( 3 x 4 m^{2} = 3\)
\( 3 x 5 m^{2} = 4\)
\( 3 x 6 m^{2} = 6\)
\( 3 x 7 m^{2} = 9\)
\( 3 x 8 m^{2} = 13\)
\( 3 x 9 m^{2} = 19\)
\( 3 x 10 m^{2} = 28\)
The pattern is 1 , 1 , 2 , 3 , 4 , 6 , 9 , 1 3 , 1 9 , 2 8 , . . .
using n = ( n − 1 ) + ( n − 3 ) for n ≥ 4
So, the answer is 2 8