Topic: Unknown Mathematician Proves Elusive Property of Prime Numbers (Read 1801 times)
Wonder how I missed this for a couple months. Probably because I've been a lazy fuck reading stupid shit. It isn't quite proving the twin primes conjectur but it's just a couple steps away. I wish I hadn't been so fucking lazy at math and stopped after calculus.
From the wired article:
Quote
The Sieve of Eratosthenes works perfectly to identify primes, but it is too cumbersome and inefficient to be used to answer theoretical questions. Over the past century, number theorists have developed a collection of methods that provide useful approximate answers to such questions.
“The Sieve of Eratosthenes does too good a job,” Goldston said. “Modern sieve methods give up on trying to sieve perfectly.”
GPY developed a sieve that filters out lists of numbers that are plausible candidates for having prime pairs in them. To get from there to actual prime pairs, the researchers combined their sieving tool with a function whose effectiveness is based on a parameter called the level of distribution that measures how quickly the prime numbers start to display certain regularities.
The level of distribution is known to be at least ½. This is exactly the right value to prove the GPY result, but it falls just short of proving that there are always pairs of primes with a bounded gap.
Since we don't try to prove that there is an infinite number of primechains, it should work, right? “The Sieve of Eratosthenes does too good a job,” Goldston said. “Modern sieve methods give up on trying to sieve perfectly.”
GPY developed a sieve that filters out lists of numbers that are plausible candidates for having prime pairs in them. To get from there to actual prime pairs, the researchers combined their sieving tool with a function whose effectiveness is based on a parameter called the level of distribution that measures how quickly the prime numbers start to display certain regularities.
The level of distribution is known to be at least ½. This is exactly the right value to prove the GPY result, but it falls just short of proving that there are always pairs of primes with a bounded gap.
I wonder if this GPY sieve can be used for primecoin, i think it should and be much faster too. 
GPYCOIN?
I wonder if this GPY sieve can be used for primecoin, i think it should and be much faster too.
Thanks 
Great story thanks for sharing.
Jump to: