multiple of it with all digits not zero
Source: China TST 1990, problem 7
June 27, 2005
modular arithmeticinductionnumber theory unsolvednumber theory
Problem Statement
Prove that for every integer power of 2, there exists a multiple of it with all digits (in decimal expression) not zero.