IMC 2017, Day 1, Problem 3
For any positive integer , denote by the product of positive divisors of (e.g. ). For every positive integer define the sequence
Determine whether for every set , there exists a positive integer such that the following condition is satisfied:
For every with , the number is a perfect square if and only if .
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
(Proposed by Matko Ljulj , University of Zagreb)
Solution. We prove that the answer is yes; for every there exists a suitable . Specially, can be a power of : with some nonnegative integer . Write ; then
Lemma. Suppose that the sequences and satisfy and for , and . Then for each we have .
As an immediate corollary, we have for and .
Proof. We prove the by induction. For we have so the statement holds. Suppose the statement is true for some , then for we have
Going back to the solution of the problem, for every we construct inductively a sequence such that , and for every , is even if and only if .
For we can choose if or if . If we already have such a sequence for a positive integer , we can choose either the same sequence or choose and apply the same recurrence . By the Lemma, we have for , but and have opposite parities; hence, either the sequence or the sequence satisfies the condition for .
Repeating this process for , we obtain a suitable sequence .
Transcribed from the official solutions, pages 2–3. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.