Maths Olympiad Prep

Library / /44 of 94

Number theory Difficulty 4.8 AIME Prove it United States

Problem:
Find the greatest common divisor of the numbers 2002+2,20022+2,20023+2,2002+2, 2002^{2}+2, 2002^{3}+2, \ldots.

Solution

Solution:
Notice that 2002+22002+2 divides 20022222002^{2}-2^{2}, so any common divisor of 2002+22002+2 and 20022+22002^{2}+2 must divide (20022+2)(2002222)=6(2002^{2}+2)-(2002^{2}-2^{2})=6. On the other hand, every number in the sequence is even, and the nnth number is always congruent to 1n+201^{n}+2 \equiv 0 modulo 33. Thus, 66 divides every number in the sequence.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.