Browse · MathNet
PrintSAMC
Saudi Arabia number theory
Problem
How many integers in the set divide ?
Solution
Let . If , then . Also, if , then . It follows that any multiple of or in the set is not a divisor of . Any number in which is not divisible by or is also a divisor of . We have , and from Euler's Theorem we get The desired number is
Final answer
1072
Techniques
Fermat / Euler / Wilson theoremsφ (Euler's totient)Inclusion-exclusionDivisibility / Factorization