MathDB
O 41

Source:

May 25, 2007
inductionmodular arithmetic

Problem Statement

Prove that for every positive integer nn there exists an nn-digit number divisible by 5n5^n all of whose digits are odd.
Back to ProblemsView on AoPS