Problem #PRU-34968

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

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\).