Skip to main content
OlympiadHQ

Browse · harp

Print

imc

number theory intermediate

Problem

A set of tiles numbered 1 through 100 is modified repeatedly by the following operation: remove all tiles numbered with a perfect square, and renumber the remaining tiles consecutively starting with 1. How many times must the operation be performed to reduce the number of tiles in the set to one?
(A)
(B)
(C)
(D)
Solution
The pattern is quite simple to see after listing a couple of terms. Thus, the answer is .
Final answer
C