![]() |
|
|
#122 | |
|
Nov 2009
2·52·7 Posts |
Quote:
|
|
|
|
|
|
|
#123 |
|
Sep 2010
Scandinavia
26716 Posts |
|
|
|
|
|
|
#124 |
|
Jun 2009
22×32×19 Posts |
There are dozens of PRPs with 58711 digits that could be proved using N+1. Unfortunately, it says "too big to prove atm"
|
|
|
|
|
|
#125 |
|
"Daniel Jackson"
May 2011
14285714285714285714
12278 Posts |
That needs to be fixed (hopefully in the next 6 months). Anyway, I found this Proth prime with NewPGen and LLR:
731969*2969+1 (N-1) I've attached my LLR results (n=2-1000, n=1000-2000) to this post. "FOSH" (base-36 for 731969=7*17*6151) is also the name of a species of birdlike alien from Star Wars. Last fiddled with by Stargate38 on 2013-04-30 at 00:33 Reason: fix wording and add factors of k. |
|
|
|
|
|
#126 |
|
"Daniel Jackson"
May 2011
14285714285714285714
3·13·17 Posts |
Actually, I meant n=1000-10000, not 2000
Last fiddled with by Stargate38 on 2013-05-01 at 19:07 |
|
|
|
|
|
#127 |
|
Mar 2006
Germany
290410 Posts |
|
|
|
|
|
|
#128 |
|
"Daniel Jackson"
May 2011
14285714285714285714
3·13·17 Posts |
5855753, 93692033, and 374768129? Those are small numbers. I only consider the ones >M31. I used Proth to find more primes. Their base-36 values start with species names from Star Wars (I love the Saga and especially the Guide to Alien Species, which I have in my collection):
731969*3615-1 731969*3617-1 731969*3699-1 731969*3615-1 731969*3617-1 731969*3699-1 26350885*365+1 26350885*366+1 26350885*368+1 26350885*3627+1 26350885*3648+1 26350885*3665+1 26350885*36264+1 26350885*36551+1 26350885*362009+1 26350885*362224+1 26350885*364776+1 26350885*365067+1 I'll post these and more primes in their own thread after I find more. Before I do that, however, I want to know if there is already a thread for this type of prime or not. Last fiddled with by Stargate38 on 2013-05-01 at 22:38 Reason: replace "post" with "thread" |
|
|
|
|
|
#129 | |
|
Mar 2006
Germany
23·3·112 Posts |
Quote:
There's no thread for such numbers. CRUS is only searching for bases <= 1030 and special k-values. I suggest to make your own page/list and search/find all primes for n>0, otherwise it's not valuable at all. |
|
|
|
|
|
|
#130 |
|
"Daniel Jackson"
May 2011
14285714285714285714
12278 Posts |
First, it's impossible to get all the primes for n>0 because there are an infinity of them. Second, I only want to go to n=10000 for now because my computer is much slower then yours. I'll have to get a ton of money built up for buying a new one, which could take years with the current economy (thus the limit of n=10000).
![]() Do you know of any 100% free sites I could put my list on, such that it won't be deleted after 1-2 months of inactivity? I have a lot of side projects (3D modeling, simulations of planet formation, etc.). Last fiddled with by Stargate38 on 2013-05-02 at 18:30 Reason: Need free host for number list! |
|
|
|
|
|
#131 |
|
Mar 2006
Germany
290410 Posts |
The expression "all primes for n>0" was meant to be of the form k*b^n+/-1 for your examples given with base 36 and k=731969 or k=26350885.
So like Mersenne primes 2^n-1 are always given for all n>0 not only greater than some limit. For example of base-36 k-value: 26350885: 2, 5, 6, 8, 27, 48, 65, 264, 551, 2009, 2224, 4776, 5067 [10k] No, I don't know any free site but there're some for a very small budget of 20 € / year. |
|
|
|
|
|
#132 |
|
"Daniel Jackson"
May 2011
14285714285714285714
29716 Posts |
There HAS to be a free site out there SOMEWHERE! I'm NOT paying to keep my numbers online!
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Can two Mersenne numbers share a factor? | James Heinrich | Math | 57 | 2011-09-12 14:16 |
| Avoidance of self- & other-deception in proofs | cheesehead | Soap Box | 71 | 2010-01-14 09:04 |
| Curious and want to share about Prime number 23 | spkarra | PrimeNet | 4 | 2009-11-20 03:54 |
| Status of GIMPS proofs | Brian-E | Information & Answers | 7 | 2007-08-02 23:15 |
| Collection of Proofs? | Orgasmic Troll | Math | 1 | 2004-12-30 15:10 |