×

Integers with digits 0 or 1. (English) Zbl 0589.10004

The authors study congruences \(\ell \equiv a (mod k)\), \(k>1\) an integer and show that such a congruence has either infinitely many solutions \(\ell\) or no solution \(\ell\), where \(\ell\) shall be a nonnegative integer which may be expressed in base g (g fixed) using only the digits 0 or 1. Techniques that allow to obtain the smallest nontrivial solution are discussed.
Reviewer: P.Kirschenhofer

MSC:

11A63 Radix representation; digital problems
11A07 Congruences; primitive roots; residue systems
PDFBibTeX XMLCite
Full Text: DOI