The week's pick
Random Articles
Reseach Article
A Compendium of Unlikely Parameterizations for Prime Pairs Related to the Goldbach Conjecture
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 180 - Number 16 |
| Year of Publication: 2018 |
| Authors: Kenneth J. Prevot |
10.5120/ijca2018916346
|
Kenneth J. Prevot . A Compendium of Unlikely Parameterizations for Prime Pairs Related to the Goldbach Conjecture. International Journal of Computer Applications. 180, 16 ( Feb 2018), 13-14. DOI=10.5120/ijca2018916346
Abstract
The long-standing Goldbach Conjecture states that every even integer greater than 4 is equal to the sum of two odd prime numbers. An interesting exercise would be to check if some simply stated rules on prime number candidates would generate solutions satisfying the Conjecture. A collection of rules which are insufficient are presented with examples. A final conjecture is proposed, yet unresolved, dealing with maximal prime products. The closing conjecture offers a parameterization which is a candidate solution for the Goldbach Conjecture.
References
- S. Beaty, Software Support To Generate Maximal Products Pq In 2n, Metropolitan State University Of Denver, Denver Colorado
- H. Davenport, Multiplicative Number Theory, 3rd Edition, Springer-Verlag, 2000.
- J. Hass, M. D. Weir, G. B. Thomas, Jr., University Calculus, Early Transcendentals, Second Edition, Addison Wesley, Boston, Ma, 2012
- K. H. Rosen, Elementary Number Theory And Its Applications, 4th Edition, Addison Wesley Longman, 1999, Usa.
- Stewart, Redlin, Watson, Panman College Algebra Concepts And Contexts, Brooks/Cole, Belmont, Ca, 2011
Index Terms
Keywords