MathNet 2007-part-01 — 187 problems (EN–VI) Question 6

Prove that for every positive integer $n$ there exists a positive integer $k$ such that the decimal representation of each of the numbers $k, 2k, \ldots, nk$ contains all the digits $0,1,2,3,4,5,6,7,8,9$.