Checking this peculiar conjecture Are there infinitely many c-th perfect powers having a constant congruence speed of c?, a friend of mine has performed a computer search on the smallest tetration bases of the required form (i.e., \( 20 \cdot n + 5 \)) and the outcome shows that, as \(c \) grows, the rightmost digits of those smallest values \( 20 \cdot n + 5 \) freeze or \(10\)-adically converge to the string \(\dots 98869612812995910644531 \). So, the question now is to understand what decadic integer \(\dots 98869612812995910644531\) is, finding from which equation in the commutative ring of decadic integers it comes from.
Any hint?
Any hint?
For every radix \(r\geq 2\), the congruence speed of tetration stabilizes at a positive constant for all bases \(a>1\) with \(\mathrm{rad}(r )\nmid a\) if and only if \(r\) is squarefree. (NNTDM 32(3), Appendix B)
