Divisibility (Hard)
Late AMC 10/12 through early AIME — dense computation.
Divisibility: core idea
Factor counting.
Example problem: hint and answer
Find the least digit for which is divisible by .
Hint: Use congruences and factorization rather than calculating large numbers. Answer: 4.
Practice (9 problems — type your answers)
1. How many integers from to are divisible by or ?
2. Find the remainder when is divided by .
3. For how many digits is divisible by ?
4. Find the smallest positive multiple of with only digit .
5. How many divisors of are divisible by ?
6. Find the last two digits of .
7. Find the least for which is divisible by but not .
8. Find the remainder of upon division by .
9. Find the least positive integer congruent to and .