I have completed b=34 and b=38 to n=100000. (38^90713+1)^22 is the only prime.

[QUOTE=rogue;581572]I have completed b=34 and b=38 to n=100000. (38^90713+1)^22 is the only prime.[/QUOTE]
Are you continuing with these bases? 
[QUOTE=gd_barnes;581601]Are you continuing with these bases?[/QUOTE]
No. 
Base 42 is done to 150k, one prime found, reported in other thread.
Reserving to 200k. 
Reserve base 970 to n=10k

[QUOTE=Grotex;592395]Reserve base 970 to n=10k[/QUOTE]
Detect a 3PRP: (970^38991)^22 Testing n=8232 
[QUOTE=Grotex;592395]Reserve base 970 to n=10k[/QUOTE]
Testing n=9697. (970^38991)^22 is proven prime. [QUOTE]Primality testing (970^38991)^22 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 3, base 1+sqrt(3) Generic modular reduction using generic reduction FMA3 FFT length 8K, Pass1=128, Pass2=64, clm=2 on A 77371bit number Calling BrillhartLehmerSelfridge with factored part 44.96% (970^38991)^22 is prime! (57.3576s+0.0391s)[/QUOTE] 
[QUOTE=Grotex;592395]Reserve base 970 to n=10k[/QUOTE]
Done. Only 1 prime: (970^38991)^22 Release base 970. Reserve base 1318 to n=10k. 
[QUOTE=Grotex;592700]Done.
Only 1 prime: (970^38991)^22 Release base 970. Reserve base 1318 to n=10k.[/QUOTE] Base 1318 Done. No primes. Release base 1318. Reserve base 1484 to n=10k. 
[QUOTE=Grotex;592842]Base 1318 Done.
No primes. Release base 1318. Reserve base 1484 to n=10k.[/QUOTE] Base 1484 done. Only 1 prime: (1484^9606+1)^22 [QUOTE] Primality testing (1484^9606+1)^22 [N+1, BrillhartLehmerSelfridge] Running N+1 test using discriminant 5, base 1+sqrt(5) Generic modular reduction using generic reduction FMA3 FFT length 20K, Pass1=320, Pass2=64, clm=4 on A 202404bit number Calling BrillhartLehmerSelfridge with factored part 40.51% (1484^9606+1)^22 is prime! (329.5672s+0.1762s) [/QUOTE] 
Release base 1484.
Reserve base 1992 to n=10k. 
[QUOTE=Grotex;592987]Release base 1484.
Reserve base 1992 to n=10k.[/QUOTE] Done. No primes. 
Base 10 is at n = 208.2 k, no primes found, continuing...

2/14 update
Base 10 is at n = 223.2 k, no primes found, continuing. Tests are taking just under 35 minutes to complete on 3 cores of a i56400.

Any ranges open?

[QUOTE=birtwistlecaleb;601630]Any ranges open?[/QUOTE]
Almost all of them. See here: [URL]https://www.rieselprime.de/ziki/CarolKynea_table[/URL] 
Reserve base 146 to n=20k
What seiving application supports Carol and Kyena numbers, the +2s make it impossible to sieve on NewPgen. Edit 2: gonna use probable prime testing for the numbers with yafu instead 
Edit3: cksieve+pfgw is working!

reserving up to 50000 instead (for the same base i reserved up to 20k)

30k instead, very sorry for all of the changes.

Up to PRP: (146^14016+1)^22, no primes yet
also log vomit update! :yucky: [url]https://pastebin.com/4tuafyv7[/url] 
n=16647: No primes

update 3/15
Base 10 is at n = 236.1 k, no primes found, continuing. ETA to complete to n = 250k is 1 month.
Considering sieving it to n = 500k, but I would not test the range alone. If I were to do that, would that be an interesting project for a PRPserver? 
i am!
(n=21k: no primes) [B][I]!!LOG MISSED 1664818769!![/I][/B] continuing after seiving stopping too: 21092: no primes 
next: all 10k bases to 20k up to b=200 (sieved)
bases complete: 148 150 152 162 164 (new posts after editing expires) 
Complete:
166 168 170 172 174 176 178 In progress: 182 184 186 188 190 192 194 198 200 
1 Attachment(s)
All complete: File attached
(find (base you want)^) in ctrl f to see where the numbers for that range are 
Next range: b46 from 30k to 50k
ETA: ~1.21.7 weeks 
Caleb,
We appreciate the updates. However it isn't necessary to report updates several times a day or even once a day. Just post a reservation when you begin a base(s). Then when done with the base(s), post the nrange completed and the primes found. The same thing applies to sieving. Otherwise there are too many posts to wade through in the future. Thanks, Gary 
ETA edit: 2 weeks, 3.6 days

1 Attachment(s)
Early end: 37314 (error in input+too long assignment)

[QUOTE=birtwistlecaleb;602115]Early end: 37314 (error in input+too long assignment)[/QUOTE]
What does this mean? Are you releasing base 46 at n=37314? 
Yes.

[QUOTE=birtwistlecaleb;602115]Early end: 37314 (error in input+too long assignment)[/QUOTE]
What does this mean? Is testing values beyond that failing? 
I messed up my input file by accident, and im bored of it already.
[B]Moderator note: Work by this user is not being accepted due to jumping around and leaving holes in ranges searched.[/B] 
Base 10 is up to n = 250k, no primes in the range n = 200k 250k. Releasing the base.
Sieve for n = 250k500k is at 93 T, probably needs another day and a half to get to 100T. I would imagine this should be sieved to 200 or even 300 T before being tested. I'll provide a file when the sieve is done in the case one wants to do a PRPnet project with it. 
To clean up the irritations in the other thread:
I've done CK46 for 30000<n<50000, no primes found 
[QUOTE=Dylan14;604246]Base 10 is up to n = 250k, no primes in the range n = 200k 250k. Releasing the base.
Sieve for n = 250k500k is at 93 T, probably needs another day and a half to get to 100T. I would imagine this should be sieved to 200 or even 300 T before being tested. I'll provide a file when the sieve is done in the case one wants to do a PRPnet project with it.[/QUOTE] I'd like to take base 10 starting at 250K. Not sure how high I'll go, maybe to 500K. 
[QUOTE=ryanp;605837]I'd like to take base 10 starting at 250K. Not sure how high I'll go, maybe to 500K.[/QUOTE]
Found a hit: [URL="https://primes.utm.edu/primes/page.php?id=133928"](10^3345681)^22[/URL]. 
[QUOTE=ryanp;605884]Found a hit: [URL="https://primes.utm.edu/primes/page.php?id=133928"](10^3345681)^22[/URL].[/QUOTE]
Nice one! My sieve file is at 158.8 T, do you want it, or are you good? 
[QUOTE=Dylan14;605951]Nice one! My sieve file is at 158.8 T, do you want it, or are you good?[/QUOTE]
Think I'm already good, but thanks! 
Cleaning holes in CK146:
I've done CK146 for 10000<n<30000, no primes found 
I've taken CK10 up through n=800000. Going to try to continue all the way up to n=1M.

[QUOTE=kar_bon;606082]Cleaning holes in CK146:
I've done CK146 for 10000<n<30000, no primes found[/QUOTE] Will also take CK146 for [$]30000 < n < 400000[/$]. 
I've finished Ck146 for [$]n \le 400000[/$], releasing the base. The primes found are:
[CODE](146^61827+1)^22 (146^1448821)^22 (146^180482+1)^22 (146^276995+1)^22[/CODE] 
All times are UTC. The time now is 19:58. 
Powered by vBulletin® Version 3.8.11
Copyright ©2000  2022, Jelsoft Enterprises Ltd.