MathDB
Problems
Contests
National and Regional Contests
Canada Contests
Canada National Olympiad
2015 Canada National Olympiad
3
3
Part of
2015 Canada National Olympiad
Problems
(1)
combinatorial game!!! CMO 2015 P3
Source: canadian mathematical olympiad
4/24/2015
On a
(
4
n
+
2
)
×
(
4
n
+
2
)
(4n + 2)\times (4n + 2)
(
4
n
+
2
)
×
(
4
n
+
2
)
square grid, a turtle can move between squares sharing a side.The turtle begins in a corner square of the grid and enters each square exactly once, ending in the square where she started. In terms of
n
n
n
, what is the largest positive integer
k
k
k
such that there must be a row or column that the turtle has entered at least
k
k
k
distinct times?
combinatorics
square grid