Authors: Sally Myers Moite
For a fixed last prime, sieve the positive integers as follows. For every prime up to and including that last prime, choose one arbitrary remainder and its negative. Sieve the positive integers by eliminating all numbers congruent to the chosen remainders modulo their prime. Consider the maximum of the first open numbers left by all such sieves for a particular last prime. Computations for small last primes support a conjecture that the maximum first open number is less than (last prime)^1.75. If this conjecture could be proved, it would imply Goldbach’s Theorem is true.
Comments: 6 Pages.
[v1] 2019-06-15 15:16:11
Unique-IP document downloads: 17 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.