Prime Factorization (AIME / USAJMO / AMO)
Proof-style AIME / USAJMO / AMO statements — develop a full argument; type only the final answer.
Proof track: treat each problem as a full olympiad writeup on paper. Here you only enter the final answer (integer or short expression).
Prime Factorization: core idea
Example problem: hint and answer
**(Proof track.)** Give a complete justification. Find the smallest square divisible by .
Hint: Factor completely and compare prime exponents. Answer: 32400.
Practice (9 problems — type your answers)
No proof submission required — answers only.
1. **(Proof track.)** Give a complete justification. How many divisors of are perfect cubes?
2. **(Proof track.)** Give a complete justification. Find .
3. **(Proof track.)** Give a complete justification. Find .
4. **(Proof track.)** Give a complete justification. Find the exponent of in .
5. **(Proof track.)** Give a complete justification. Find the least such that .
6. **(Proof track.)** Give a complete justification. Find the sum of all divisors of .
7. **(Proof track.)** Give a complete justification. How many positive integers divide but not ?
8. **(Proof track.)** Give a complete justification. Find the least integer with exactly divisors.
9. **(Proof track.)** Give a complete justification. Find the greatest common divisor of and .