Let be the smallest positive integer for which Find the remainder when is divided by 1000.
Solution
Let . The condition is equivalent to Let's write where is not divisible by 3. If all primes dividing are , then has a positive number of factors that are and none that are , so has nonzero imaginary part. Therefore is divisible by some prime that is . In this case, the divisors of are equally likely to be 1 or , so the sum is Now, and 83 is prime, so we must either have , which forces , or , which forces . The first cases yields a lower value of , namely . Now let's try to compute this mod 1000. This is clearly divisible by 8. Modulo , so and . Therefore . 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.