Idempotent numbers
From MaRDI portal
Publication:951273
Idempotent numbers are defined as solutions of the equation \(n^k\equiv n\pmod {g^r}\) for arbitrary \(k,r\geq 2\). The authors find all non-trivial solutions of the given equation using only elementary number theory. Earlier \textit{C. Gross} [Math. Semesterber. 52, No. 2, 127--151 (2005; Zbl 1126.11006)] considered the case \(k=2\).
Recommendations
Cites work
Cited in
(5)- Idempotente (automorphe) Zahlen in \(q\)-Stellenwertsystemen.
- Integers with identical digits
- scientific article; zbMATH DE number 4142105 (Why is no real title available?)
- scientific article; zbMATH DE number 40764 (Why is no real title available?)
- Minimal idempotency, partial idempotency, search heuristics and constructive algorithms for idempotent integers
This page was built for publication: Idempotent numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q951273)