mersenneforum.org  

Go Back   mersenneforum.org > Prime Search Projects > Riesel Prime Search

Reply
 
Thread Tools
Old 2006-03-07, 11:54   #1
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

45610 Posts
Default How big K and n can be?

What is the biggest K and n that can be tested with NewPGen and LLR?

Thanks in advance for your response.

Edo
edorajh is offline   Reply With Quote
Old 2006-03-07, 15:07   #2
Kosmaj
 
Kosmaj's Avatar
 
Nov 2003

2×1,811 Posts
Default

NewPGen k:
k*2^n-1, k fixed, k < 2^31. If lareger than 2^31 k must be represented as a product of its factors, each less then 2^31 if such factorization is possible.

k*2^n-1, n fixed, I'm not aware of any limit. The largest I tried is 10^11 and it worked. I'm sure it will work at least to 10^12.

NewPGen n: Not aware of any limits, the largest I tried is 10M and it worked.

LLR k: I tried up to about 10^50 and it worked. Larry says that somewhere at 10^48 LLR slows down.

LLR n: I think like GIMPS (prime-95) about 80M.

But I wonder why are you asking? There are plenty k/n's to work on within "normal" bounds.
Kosmaj is offline   Reply With Quote
Old 2006-03-07, 15:23   #3
edorajh
 
edorajh's Avatar
 
Oct 2003
Croatia

23·3·19 Posts
Default

Thanks for this info.

I ask just out of curiosity.
edorajh is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 08:15.

Thu Jun 4 08:15:34 UTC 2020 up 71 days, 5:48, 0 users, load averages: 1.58, 1.40, 1.38

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.