12/28/2022, 04:22 PM
(12/27/2022, 05:12 PM)MphLee Wrote:(12/26/2022, 08:40 AM)marcokrt Wrote: Awesome list! I would like to just point out that my real surname is "Ripà" (instead of "Ripa", a very common mistake indeed), mentioning also the last paper that I have written together with the other TetrationForum user "Luca Onnis", entitled "Number of stable digits of any integer tetration", which completes the trilogy on the congruence speed that I started by submitting to Notes on Number Theory and Discrete Mathematics, in 2019, the manuscript entitled "On the constant congruence speed of tetration" (see NNTDM, Vol. 26(3), pp. 245-260, DOI: 10.7546/nntdm.2020.26.3.245-260).
Hi Marco, forgive me for the typo. I'm actually well aware of your surname, I'm also italian so I don't have the excuse for being not used to accents. The reason for the error is, I was copy-pasting the name of the files in my folder on the forum, and windows do not accept special symbols naming the files then I had no enough time to double check the post.
Thanks for the contribution btw. I'll update my folder with your work. Some work on number theory related to hyperoperations is always welcome imho... since it is an underdeveloped topic. We need to face the problem from multiple viewpoints.
Cordialmente
ps: mi sono preso la liberta di usare i miei poteri da mod per editare il tuo ultimo messaggio e sistemare la sintassi LaTex, adesso aprendo il post puoi controllare come va fatta. You have to write "\ (" before a formula and "\ )" as closure.
I really do appreciate everything you have done, MphLee. Grazie!
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).

