Skip to main content
Log in

Towards an elementary formulation of the Riemann hypothesis in terms of permutation groups

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

Abstract

This paper investigates the relationship between the Riemann hypothesis and the statement \(\forall n, ~g(n) \le e^{\sqrt{p_n}}\), where g(n) is the maximum order of an element of \(S_n\), the symmetric group on n elements, and \(p_n\) is the n-th prime. We show this inequality holds under the Riemann Hypothesis. We also make progress towards establishing the converse by proving \(\exists n,~g(n)>e^{\sqrt{p_n}}\) if the Riemann Hypothesis is false and the supremum of the set of the real parts of the Riemann zeta function’s zeros \(\sup \{\Re (\rho )~|~\zeta (\rho ) = 0\}\) is not equal to 1.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Büthe, J.: An analytic method for bounding \(\psi (x)\). Math. Comput. 87, 1991–2009 (2018)

    Article  MathSciNet  Google Scholar 

  2. de la Vallée-Poussin, C.J.: Recherches analytiques sur la théorie des nombres premiers. Ann. Soc. Sci. Bruxelles 20, 183–256 (1899)

    Google Scholar 

  3. Deleglise, M., Nicolas, J.-L.: The Landau function and the Riemann Hypothesis. J. Comb. Number Theory 11(2), 45–95 (2019)

    Google Scholar 

  4. Ingham, A.E.: The Distribution of Prime Numbers. Cambridge Tracts in Mathematics and Mathematical Physics, No. 30 Stechert-Hafner, Inc., New York (1990)

  5. Kotnik, T.: The prime-counting function and its analytic approximations. Adv. Comput. Math. 29, 55–70 (2008)

    Article  MathSciNet  Google Scholar 

  6. Massias, J.-P., Nicolas, J.-L., Robin, G.: Évaluation asymptotique de l’ordre maximum d’un élément du groupe symétrique. Acta Arith. 50, 221–242 (1988)

    Article  MathSciNet  Google Scholar 

  7. Nicolas, J.-L.: Sur l’ordre maximum d’un élément dans le groupe \(S_n\) des permutations. Acta Arith. 14, 315–332 (1968)

    Article  Google Scholar 

  8. Rosser, J.B.: The n-th prime is greater than \(n \log n\). Proc. Lond. Math. Soc. 45, 21–44 (1939)

    Article  MathSciNet  Google Scholar 

  9. Rosser, J.B., Schoenfeld, L.: Approximate formulas for some functions of prime numbers. Ill. J. Math. 6, 64–94 (1962)

    MathSciNet  Google Scholar 

  10. Schoenfeld, L.: Sharper bounds for the Chebyshev functions \(\theta (x)\) and \(\psi (x)\) II". Math. Comput. 30(134), 337–360 (1976)

    MathSciNet  Google Scholar 

Download references

Acknowledgements

We are grateful to Jean-Louis Nicolas for his encouragement and helpful correspondence. We are also grateful to the referees for their feedback on earlier drafts of this paper.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jacob Tsimerman.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Will Cavendish is unaffiliated at the moment with a university.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cavendish, W., Tsimerman, J. Towards an elementary formulation of the Riemann hypothesis in terms of permutation groups. Ramanujan J (2024). https://doi.org/10.1007/s11139-024-00829-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11139-024-00829-2

Keywords

Navigation