Maths Olympiad Prep

Library / /23 of 133

Number theory Difficulty 5.0 AIME Prove it Saudi Arabia

How many integers in the set {1,2,,2010}\{1,2, \ldots, 2010\} divide 52010!32010!5^{2010!}-3^{2010!}?

Solution

Let k{1,2,,2010}k \in \{1,2, \ldots, 2010\}. If 3k3 \mid k, then k52010!32010!k \nmid 5^{2010!}-3^{2010!}. Also, if 5k5 \mid k, then k52010!32010!k \nmid 5^{2010!}-3^{2010!}. It follows that any multiple of 33 or 55 in the set {1,2,,2010}\{1,2, \ldots, 2010\} is not a divisor of 52010!32010!5^{2010!}-3^{2010!}. Any number kk in {1,2,,2010}\{1,2, \ldots, 2010\} which is not divisible by 33 or 55 is also a divisor of 52010!32010!5^{2010!}-3^{2010!}. We have φ(k)<k<2010\varphi(k)<k<2010, and from Euler's Theorem we get
52010!32010!=aφ(k)bφ(k)11(modk). 5^{2010!}-3^{2010!}=a^{\varphi(k)}-b^{\varphi(k)} \equiv 1-1 \quad(\bmod k) .
The desired number is
2010[20103][20105]+[201015]=1072. 2010-\left[\frac{2010}{3}\right]-\left[\frac{2010}{5}\right]+\left[\frac{2010}{15}\right]=1072 .

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 and solution reproduced as published; topic and difficulty added by this site.