The congruence speed formula
Abstract
We solve a few open problems related to a peculiar property of the integer tetration ba, which is the constancy of its congruence speed for any sufficiently large b=b(a). Assuming radix-10 (the well-known decimal numeral system), we provide an explicit formula for the congruence speed V(a) ∈ N0 of any a ∈ N-\0\ that is not a multiple of 10. In particular, for any given n ∈ N, we prove to be true Rip\`a's conjecture on the smallest a such that V(a)=n. Moreover, for any a ≠ 1 : a 0 10, we show the existence of infinitely many prime numbers pj:=pj(V(a)) such that V(pj)=V(a).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.