Prime number conjectures from the Shapiro class structure

zbMATH Open1432.11005arXiv1903.09619MaRDI QIDQ5221069FDOQ5221069

Gaurav Bhatnagar, Hartosh Singh Bal

Publication date: 24 March 2020

Abstract: The height $H(n)$ of $n$, introduced by Pillai in 1929, is the smallest positive integer $i$ such that the $i$th iterate of Euler's totient function at $n$ is $1$. 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 $H$ and its relatives are closely related to the important functions of number theory, namely $pi(n)$ and the $n$th prime $p_n$. We conjecture formulas for $pi(n)$ and $p_n$ in terms of the height function.

Full work available at URL: https://arxiv.org/abs/1903.09619

zbMATH Keywords

heightShapiro class structure

Mathematics Subject Classification ID

Arithmetic functions; related numbers; inversion formulas (11A25) Primes (11A41)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Remark on Stirling's Formula
• On Iterates of Euler's φ-Function
• An Arithmetic Function Arising From the /phi Function
• Iteration of the φ Function
• Concerning the Iterated φ Function

Cited In (2)

• Congruence Primes of the Kim–Ramakrishnan–Shahidi Lift
• The partition-frequency enumeration matrix

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)