Prime number conjectures from the Shapiro class structure
From MaRDI portal
Publication:5221069
Abstract: The height of , introduced by Pillai in 1929, is the smallest positive integer such that the th iterate of Euler's totient function at is . H. N. Shapiro (1943) studied the structure of the set of all numbers at a height. We state a formula for the height function due to Shapiro and use it to list steps to generate numbers at any height. This turns out to be a useful way to think of this construct. In particular, we extend some results of Shapiro regarding the largest odd numbers at a height. We present some theoretical and computational evidence to show that and its relatives are closely related to the important functions of number theory, namely and the th prime . We conjecture formulas for and in terms of the height function.
Recommendations
Cites work
- scientific article; zbMATH DE number 3813704 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 4187929 (Why is no real title available?)
- A Remark on Stirling's Formula
- An Arithmetic Function Arising From the /phi Function
- Concerning the Iterated φ Function
- Iteration of the φ Function
- On Iterates of Euler's φ-Function
- Primes in classes of the iterated totient function
Cited in
(2)
This page was built for publication: Prime number conjectures from the Shapiro class structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5221069)