12/31/2021, 06:58 AM
(12/17/2021, 01:09 AM)JmsNxn Wrote: Looks very interesting!
I'll be sure to chop out some time to read these.
Regards, James
Thank you very much, James.
I've just uploaded a basic preprint on RG where we use the congruence speed formula in order provide a complete answer to the question posted by Luknik here: Repetition of the last digits of a tetration of generic base
Here is the preprint we are working on, which I'd like to share just in case that you and/or somebody else are/is still interested in the topic: Number of stable digits of any integer tetration
Wishing all the forum members a happy new year (despite these difficult times)!
Marco
Let \(G(n)\) be a generic reverse-concatenated sequence. If \(G(1) \notin \{2, 3, 7\}\), then \(^{G(n)}G(n) \pmod {10^d}≡^{G({n+1})}G({n+1}) \pmod {10^d}\), \(\forall n \in \mathbb{N}-\{0\}\)
("La strana coda della serie n^n^...^n", p. 60).
("La strana coda della serie n^n^...^n", p. 60).