The congruence speed formula

Abstract: We solve a few open problems related to a peculiar property of the integer tetration ${^{b}a}$, 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) \in \mathbb{N}_0$ of any $a \in \mathbb{N}-{0}$ that is not a multiple of $10$. In particular, for any given $n \in \mathbb{N}$, we prove to be true Rip`a's conjecture on the smallest $a$ such that $V(a)=n$. Moreover, for any $a \neq 1 : a \not\equiv 0 \pmod {10}$, we show the existence of infinitely many prime numbers $p_j:=p_j(V(a))$ such that $V(p_j)=V(a)$.

• The paper presents the concept of congruence speed V(a) to analyze stability in integer tetrations modulo 10.
• It derives a general analytic formula linking any base a (with a ≠ 1 and not divisible by 10) to its congruence speed.
• The results have implications for prime sequences and cryptography, opening new pathways in computational number theory.

Insights into the Congruence Speed Formula for Tetrations

The paper under discussion presents a detailed investigation into the properties of the integer tetration, specifically concerning the constancy of its congruence speed for sufficiently large hyperexponents. The essences of the study revolve around defining, deriving, and proving properties related to congruence speed, denoted as $V(a)$, within the context of the decimal system ($\text{radix-10}$).

The core contribution of this research is the formulation of a general analytic expression for the congruence speed $V(a)$ of an integer base $a$, where $a \neq 1$ and $a \not\equiv 0 \pmod{10}$. The notion of congruence speed $V(a, b)$ at hyperexponent height $b$, referred to as the hyperexponent, stabilizes to $V(a)$ as $b$ becomes sufficiently large, delineating a form of metastability in modular arithmetic for tetrations.

Key Findings

• Congruence Speed Definition: The paper introduces $V(a)$ as the positive integer that guarantees equivalence of successive tetrations in terms of their residue modulo $10^{d+V(a)}$ yet not $10^{d+V(a)+1}$. This property serves as the core metric for examining growth characteristics of tetrations within modular constraints.
• Existence and Uniqueness: The paper confirms the existence of infinitely many prime numbers $p_j$ such that $V(p_j) = V(a)$ for any base $a$.
• Analytic Formula Derivation: Through a spectrum of mathematical tools including tetration, polynomial equations, and modular arithmetic, the authors delineate a formula mapping arbitrary bases to congruence speed. This extension yields the minimal base $\tilde{a}(n)$ for each integer $n$ corresponding to the congruence speed $V(a) = n$.
• Implications for Prime Sequences: The elucidation of prime numbers' congruence speeds provides an intriguing pathway to define non-trivial sequences related to primes, emphasizing computational and theoretical implications in number theory.

Implications and Speculation

The meticulous characterization of congruence speed in this paper does more than satisfy curiosity regarding modular sequences; it extends potential applications into areas like cryptography where modular arithmetic plays a crucial role. By outlining a framework allowing the calculation of $V(a)$ for powers beyond elementary exponentiation, the paper enriches the landscape of computational number theory.

Looking forward, this exploration opens avenues for analogous examinations in other numeral systems. It suggests an implication for understanding the efficiency of certain system classes in computations reliant on cycles or modular properties, potentially affecting algorithms in cryptography, such as those related to public-key infrastructure where modular arithmetic and prime numbers are fundamental.

In conclusion, this paper rigorously establishes a fundamental aspect of tetration and opens doors for deeper exploration in both theoretical and applied mathematics. The introduction of congruence speed calculations in such a systematic form invites further research, particularly in elaborating on how these properties manifest in different numeral systems or extensions to higher transfinite operations.