MOD Induction ProofByContradiction USAMO
2003


Problem - 3200
Prove that for every positive integer $n$, there exists an $n$-digit number divisible by $5^n$ all of whose digits are odd.

report an error