Final digit strings of powers

DOI10.1007/S00591-006-0010-YMaRDI QIDQ873910zbMATH OpenOpenAlexFDO

Authors Günter Köhler, Jürgen Spilker

Publication date 20 March 2007

Published in Mathematische Semesterberichte (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00591-006-0010-y

zbMATH Keywords

block of digits congruence power

Mathematics Subject Classification ID

Congruences; primitive roots; residue systems (11A07) Radix representation; digital problems (11A63)

Review text

For an arbitrary integer \(b\), and natural numbers \(k\) and \(m\), the authors determine whether \(b\) occurs as a \(k\)th-power residue modulo \(m\) and if so, how often. The case where \(0 \leq b < m = 10^r\) is especially interesting, since then we ask (in decimal notation) about the appearance of \(b\) as the \(r\) least significant decimal digits of a perfect \(k\)th power. For example, 5000 can appear as ending decimal block in a cube, but not in a square. The proofs only use the Chinese remainder theorem and Gauss's theorem on the group structure of the multiplicative group modulo \(p^r\) (cyclic when \(p\) is odd).

Recommendations

Cites work

Cited in

(6)

This page was built for publication: Final digit strings of powers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q873910)