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) ∈ ℕ_0 of any a ∈ ℕ − {0} that is not a multiple of 10. In particular, for any given n ∈ ℕ, we prove to be true Ripà's conjecture on the smallest a such that V(a) = n. Moreover, for any a ≠ 1 ∶ a ≢ 0 (mod

more »

... 10), we show the existence of infinitely many prime numbers, p_j = p_j(V(a)), such that V(p_j) = V(a).