Simple Proof of the Hardy–littlewood Conjecture
Main Article Content
Abstract
Abstract
The Hardy–Littlewood conjecture suggests that every odd integer 2n + 1 greater than or equal to 7 is the sum of three prime numbers, two of which are equal. In this paper, we present a simple approach that attempts to prove this conjecture.
Downloads
Article Details
Copyright (c) 2025 Chebba MA.

This work is licensed under a Creative Commons Attribution 4.0 International License.
Licensing and protecting the author rights is the central aim and core of the publishing business. Peertechz dedicates itself in making it easier for people to share and build upon the work of others while maintaining consistency with the rules of copyright. Peertechz licensing terms are formulated to facilitate reuse of the manuscripts published in journals to take maximum advantage of Open Access publication and for the purpose of disseminating knowledge.
We support 'libre' open access, which defines Open Access in true terms as free of charge online access along with usage rights. The usage rights are granted through the use of specific Creative Commons license.
Peertechz accomplice with- [CC BY 4.0]
Explanation
'CC' stands for Creative Commons license. 'BY' symbolizes that users have provided attribution to the creator that the published manuscripts can be used or shared. This license allows for redistribution, commercial and non-commercial, as long as it is passed along unchanged and in whole, with credit to the author.
Please take in notification that Creative Commons user licenses are non-revocable. We recommend authors to check if their funding body requires a specific license.
With this license, the authors are allowed that after publishing with Peertechz, they can share their research by posting a free draft copy of their article to any repository or website.
'CC BY' license observance:
License Name |
Permission to read and download |
Permission to display in a repository |
Permission to translate |
Commercial uses of manuscript |
CC BY 4.0 |
Yes |
Yes |
Yes |
Yes |
The authors please note that Creative Commons license is focused on making creative works available for discovery and reuse. Creative Commons licenses provide an alternative to standard copyrights, allowing authors to specify ways that their works can be used without having to grant permission for each individual request. Others who want to reserve all of their rights under copyright law should not use CC licenses.
Tao T. Every odd number greater than 1 is the sum of at most five primes. Math Comput. 2014;83(286):997–1038.
Hardy GH, Littlewood JE. Some problems of 'Partitio Numerorum.' III. On the expression of a number as a sum of primes. Acta Math. 1923;44:1–70. Available from: http://dx.doi.org/10.1007/BF02403921
Chen JR, Wang TZ. On odd Goldbach problem. Acta Math Sinica. 1989;32:702–718.
Aletheia-Zomlefer S, Fukshansky L, Garcia SR. The Bateman–Horn conjecture: Heuristic, history, and applications. Expo Math. 2020;38(4):430–479. Available from: https://doi.org/10.48550/arXiv.1807.08899
Helfgott HA. The ternary Goldbach conjecture is true. Ann Math Stud [Preprint]. 2015. Available from: https://arxiv.org/abs/1312.7748
Montgomery HL, Vaughan RC. Multiplicative number theory I: Classical theory. Cambridge: Cambridge University Press; 2007. Available from: https://assets.cambridge.org/97805218/49036/frontmatter/9780521849036_frontmatter.pdf
Granville A. Harald Cramér and the distribution of prime numbers. Scand Actuar J. 1995;1995(1):12–28. Available from: https://doi.org/10.1080/03461238.1995.10413946
Pomerance C. A tale of two sieves. Notices Am Math Soc. 1996;43(12):1473–1485. Available from: https://www.ams.org/notices/199612/pomerance.pdf
Nathanson MB. Additive number theory: The classical bases. New York: Springer; 1996. (Graduate Texts in Mathematics; vol. 164). Available from: https://download.e-bookshelf.de/download/0000/0017/29/L-G-0000001729-0002340718.pdf