Recent content by quazar540

bump. anyone?

Also, a quick graph of the continuous function that my sieving method returns, demonstrating a tight lower bound on the number of goldbach pairs for a given even integer (function in red, goldbach's comet in blue)

Hi all, I've developed a new sieving method that I believe provides a tight lower bound for the counting of certain kinds of primes. I'm 99% sure my solution works, and if so, it would allow the solution of many kinds of problems in additive number theory. The sieving method came out of...