MathDB
A 50

Source:

May 25, 2007
Divisibility Theory

Problem Statement

Show that every integer k>1k>1 has a multiple less than k4k^4 whose decimal expansion has at most four distinct digits.