Maths Olympiad Prep

Library / /247 of 348

Number theory Difficulty 5.0 AIME, harder Find the answer

Let NN be the smallest positive integer for which x2+x+1 divides 166dN,d>0xdx^{2}+x+1 \quad \text { divides } \quad 166-\sum_{d \mid N, d>0} x^{d} Find the remainder when NN is divided by 1000.

A number or a short expression. Spacing and $ signs are ignored.

Solution

Let ω=e2πi/3\omega=e^{2 \pi i / 3}. The condition is equivalent to 166=dN,d>0ωd166=\sum_{d \mid N, d>0} \omega^{d} Let's write N=3dnN=3^{d} n where nn is not divisible by 3. If all primes dividing nn are 1mod31 \bmod 3, then NN has a positive number of factors that are 1mod31 \bmod 3 and none that are 2mod32 \bmod 3, so dN,d>0ωd\sum_{d \mid N, d>0} \omega^{d} has nonzero imaginary part. Therefore nn is divisible by some prime that is 2mod32 \bmod 3. In this case, the divisors of nn are equally likely to be 1 or 2mod32 \bmod 3, so the sum is 12τ(n)+dτ(n)=2d12τ(n)-\frac{1}{2} \tau(n)+d \tau(n)=\frac{2 d-1}{2} \tau(n) Now, 2166=22832 \cdot 166=2^{2} \cdot 83 and 83 is prime, so we must either have d=42d=42, which forces τ(n)=4\tau(n)=4, or d=1d=1, which forces τ(n)=332\tau(n)=332. The first cases yields a lower value of NN, namely 342233^{42} 2^{3}. Now let's try to compute this mod 1000. This is clearly divisible by 8. Modulo 125,35=2437125,3^{5}=243 \equiv-7, so 3202401263^{20} \equiv 2401 \equiv 26 and 340676513^{40} \equiv 676 \equiv 51. Therefore 342237251=3672mod1253^{42} 2^{3} \equiv 72 \cdot 51=3672 \bmod 125. Since 672 is divisible by 8, this is our answer.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.