Problem #PRU-34968

Problems Number Theory Numeral systems Decimal number system Divisibility Division with remainders. Arithmetic of remainders Division with remainder

Problem

Prove that for any number \(d\), which is not divisible by \(2\) or by \(5\), there is a number whose decimal notation contains only ones and which is divisible by \(d\).