International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 180 - Issue 16 |
Published: Feb 2018 |
Authors: Kenneth J. Prevot |
![]() |
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
@article{ 10.5120/ijca2018916346, author = { Kenneth J. Prevot }, title = { A Compendium of Unlikely Parameterizations for Prime Pairs Related to the Goldbach Conjecture }, journal = { International Journal of Computer Applications }, year = { 2018 }, volume = { 180 }, number = { 16 }, pages = { 13-14 }, doi = { 10.5120/ijca2018916346 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2018 %A Kenneth J. Prevot %T A Compendium of Unlikely Parameterizations for Prime Pairs Related to the Goldbach Conjecture%T %J International Journal of Computer Applications %V 180 %N 16 %P 13-14 %R 10.5120/ijca2018916346 %I Foundation of Computer Science (FCS), NY, USA
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.