Divisibility (Medium)
AMC 10/12 mid (≈Q9–16) — multi-step.
Divisibility: core idea
gcd/lcm.
Example problem: hint and answer
Find the smallest positive integer divisible by both and .
Hint: Use lcm/gcd and count multiples carefully. Answer: 36.
Practice (9 problems — type your answers)
1. How many integers from to are divisible by but not by ?
2. Find the digit such that is divisible by .
3. How many positive integers less than are divisible by both and ?
4. What is the least positive integer leaving remainder when divided by and remainder when divided by ?
5. Find the number of trailing zeros in .
6. A number is divisible by and . What is the least possible positive value?
7. How many factors of are divisible by ?
8. Find the least positive multiple of whose digits sum to .
9. How many multiples of lie between and , inclusive?