jasong
01-13-2008, 01:31 AM
If you go here (http://primes.utm.edu/primes/lists/all.txt) and scroll down, you'll see that the last 6 or 7 hundred entries in the Top-5000 known primes list is very boring looking, since the vast majority of them are n=333,333. The Twin Prime Search Project, a sub-project of PrimeGrid, is attacking n=333,333 to attempt to find the highest twin prime ever to be known to man.
Now, I have nothing against Rytis, the administrator, or the project itself, but it bugs the crap out of me that all those primes look so damn generic, like they came off of an assembly line or something.
Over at Mersenne Forum("Open Projects" Forum, at the bottom of the page, in the "new project ideas" Sticky) I'm attempting to start a project to knock these off the list as quickly as possible. Basically, the idea is to pick an n(fixed n, since that sieves so much faster than fixed k) and a range of k that guarantees that any primes found in that range will be larger than Twin Prime Search primes. If it starts looking like we're committing the same "crime" as TPS, than anybody has the option to start a new range with a new n.
Anybody interested?
Now, I have nothing against Rytis, the administrator, or the project itself, but it bugs the crap out of me that all those primes look so damn generic, like they came off of an assembly line or something.
Over at Mersenne Forum("Open Projects" Forum, at the bottom of the page, in the "new project ideas" Sticky) I'm attempting to start a project to knock these off the list as quickly as possible. Basically, the idea is to pick an n(fixed n, since that sieves so much faster than fixed k) and a range of k that guarantees that any primes found in that range will be larger than Twin Prime Search primes. If it starts looking like we're committing the same "crime" as TPS, than anybody has the option to start a new range with a new n.
Anybody interested?