members wanted for 5th largest prime search

[wgarnett]

Hello everyone,

I am recruiting members for my prime number search. Over at:
http://www.williamgarnett.net/
you can find all the information about my project. The results of the group are posted also.
We have already found prime #21 (formerly prime#15), and are going for #5 (largest "proth" prime).
After you read over, and if you are interested, you can e-mail me at:
vmrf@iup.edu
with the number of computers to participate, and their rough processor speeds, and I can get you to start immediately.
Thanks.
Regards,
William Garnett

 

[Lithium381]

this sounds interesting.......how about you e-mail me i'm lazy

lithium381 at yahoo.com

 

[Lithium381]

As for my info, it's in my sig down there under the beast "lithium"

 

[TallBill]

lol lith.. lazy slag

 

[ViRGE]

Your project sounds somewhat like Seventeen or Bust. Pardon my thickheadedness, but what's the difference?

 

[Robor]

Originally posted by: ViRGE
Your project sounds somewhat like Seventeen or Bust. Pardon my thickheadedness, but what's the difference?

I was thinking the same thing. How many "prime number searches" do we need?

 

[wgarnett]

Hi,

This is a search for the largest "proth" prime; primes of the form k*2^n+1 It would be the 5th largest prime number overall.
Seveenteen or Bust searches for proth primes too, but its focus is to find one prime for each of the 17 remainding k values (now 16 remainding). It's not concerned with size, but eliminating a k value by finding a proth prime with that k value.
I wanted to do this search to compare how easy it is to find large prime numbers; whether there is an advantage by using proth primes as opposed to Mersenne primes.
If interested, e-mail me at vmrf@iup.edu
I'll e-mail you now Lithium381.
Thanks.
Regards,
William Garnett

 

[Robor]

Originally posted by: wgarnett
Hi,

This is a search for the largest "proth" prime; primes of the form k*2^n+1 It would be the 5th largest prime number overall.
Seveenteen or Bust searches for proth primes too, but its focus is to find one prime for each of the 17 remainding k values (now 16 remainding). It's not concerned with size, but eliminating a k value by finding a proth prime with that k value.
I wanted to do this search to compare how easy it is to find large prime numbers; whether there is an advantage by using proth primes as opposed to Mersenne primes.
If interested, e-mail me at vmrf@iup.edu
I'll e-mail you now Lithium381.
Thanks.
Regards,
William Garnett

"My cat's name is mittens"

In case you don't watch The Simpsons that was me responding by saying I have absolutely no idea what you're talking about.

Good luck in the search though!