2013 UMO Problems/Problem 6
Problem
How many ways can one tile the border of a triangular grid of hexagons of length completely using
only
and
hexagon tiles? Express your answer in terms of a well-known sequence, and
prove that your answer holds true for all positive integers
(examples of such grids for
,
,
, and
are shown below).
Solution
See Also
2013 UMO (Problems • Answer Key • Resources) | ||
Preceded by Problem 5 |
Followed by Last Question | |
1 • 2 • 3 • 4 • 5 • 6 | ||
All UMO Problems and Solutions |