IMC 2002, Day 2, Problem 3
For each let
Show that is an integer.
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
Solution. We prove by induction on that and are integers, we prove this for as well. (For , the term in the definition of the sequences must be replaced by 1.)
From the power series of , and .
Suppose that for some , and are all multipliers of and , respectively. Then, by the binomial theorem,
The numbers and are expressed as linear combinations of the previous elements with integer coefficients which finishes the proof.
Transcribed from the official solutions, page 2. 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.