On the equation \(a^x \equiv x\pmod{b^n}\)
Journal of integer sequences, Tome 12 (2009) no. 8
We study the solutions of the equation $ a^x\equiv x \left({mod }b^{n}\right)$. For some values of $ b$, the solutions have a particularly rich structure. For example, for $ b=10$ we find that for every $ a$ that is not a multiple of $ 10$ and for every $ n\geq 2$, the equation has just one solution $ x_n(a)$. Moreover, the solutions for different values of $ n$ arise from a sequence $ x(a)= \{x_{i}\}_{i\geq 0}$, in the form $ x_n(a)=\sum_{i=0}^{n-1} x_i 10^i$. For instance, for $ a=8$ we obtain
@article{JIS_2009__12_8_a6,
author = {Jim\'enez Urroz, J. and Yebra, J.Luis A.},
title = {On the equation \(a^x \equiv x\pmod{b^n}\)},
journal = {Journal of integer sequences},
year = {2009},
volume = {12},
number = {8},
zbl = {1202.11006},
language = {en},
url = {http://geodesic.mathdoc.fr/item/JIS_2009__12_8_a6/}
}
Jiménez Urroz, J.; Yebra, J.Luis A. On the equation \(a^x \equiv x\pmod{b^n}\). Journal of integer sequences, Tome 12 (2009) no. 8. http://geodesic.mathdoc.fr/item/JIS_2009__12_8_a6/