SMC 2019 Q13
13. Anish has a number of small congruent square tiles to use in a mosaic. When he forms the tiles into a square of side \(n\), he has 64 tiles left over. When he tries to form the tiles into a square of side \(n + 1\), he has 25 too few.
How many tiles does Anish have?
- A 89
- B 1935
- C 1980
- D 2000
- E 2019
Senior Mathematical Challenge 2019, Question 13. © UK Mathematics Trust. Original paper on ukmt.org.uk
Answer: D 2000
Anish has both \(n^2 + 64\) and \((n + 1)^2 - 25\) tiles. So, \(n^2 + 64 = (n + 1)^2 - 25\) which simplifies to \(n^2 + 64 = n^2 + 2n + 1 - 25\) and then \(64 = 2n - 24\). So \(n = \frac{88}{2} = 44\). Therefore Anish has \(44^2 + 64 = 1936 + 64 = 2000\) tiles.
Solution © UK Mathematics Trust, from the SMC 2019 solutions. Longer versions with investigations: Solutions and investigations (PDF).