加载中…
We solve a few open problems related to a peculiar property of the integer tetration , which is the constancy of its congruence speed for any sufficiently large . Assuming radix- (the well-known decimal numeral system), we provide an explicit formula for the congruence speed of any that is not a multiple of . In particular, for any given , we prove to be true Ripà’s conjecture on the smallest such that . Moreover, for any , we show the existence of infinitely many prime numbers such that .

生成讲解博客的中文版本

生成AI智能校验的中文版本