A Compendium of Unlikely Parameterizations for Prime Pairs Related to the Goldbach Conjecture
Author(s) -
J. Kenneth
Publication year - 2018
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/ijca2018916346
Subject(s) - compendium , goldbach's conjecture , computer science , prime (order theory) , conjecture , discrete mathematics , mathematics , combinatorics , linguistics , philosophy
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom