2020 PUMaC Team 1
Source:
January 1, 2022
combinatorics
Problem Statement
Consider a -by- board of unit squares. For some integer , we say the board is tiled by -by- squares if it is completely covered by (possibly overlapping) -by- squares with their corners on the corners of the unit squares. What is the largest integer k such that the minimum number of -by- squares needed to tile the -by- board is exactly equal to ?