1)
Message boards :
Number crunching :
Start discussing new goals for 2021
(Message 146311)
Posted 1026 days ago by matzetoni
 Reach the 900 Mega Primes overall (> 345 MP!!)
Maybe we can round this one up to 365 mega primes overall? (average of 1 mega prime / day)

2)
Message boards :
Number crunching :
WW testing
(Message 144407)
Posted 1075 days ago by matzetoni
GTX 1060 6GB, driver 442.50 on Windows 10:
1) 67029FBFBC1AEFB0
2) 2F32CAD23BA5B1CA
3) 2276306935816523 is a Wieferich special instance (1 3 p)
B8B040FA3813FEB2

3)
Message boards :
Generalized Fermat Prime Search :
GFN1  GFN12 Status
(Message 144172)
Posted 1081 days ago by matzetoni
Table from Yves. ...
Thanks!
Interesting that there are more GFN8 primes than GFN7 primes in your search range :)
And the accuracy of the estimates is quite remarkable.

4)
Message boards :
Generalized Fermat Prime Search :
GFN1  GFN12 Status
(Message 144156)
Posted 1081 days ago by matzetoni
A huge congrats on this achievement and to all involved! I will definitely help out with some GFN12 work when it goes online. Will it run on GPUs too or CPUs only?
Also I'm curious about the statistics. Would you mind posting a table of expected and actual number of primes for all N=1 to 11?

5)
Message boards :
Sierpinski/Riesel Base 5 Problem :
Truthfulness of "largest known base 5 prime"
(Message 144057)
Posted 1085 days ago by matzetoni
Oh, you're right. The way I classified the examples with my attempt on a definition was completely wrong haha, never mind
maybe then b = "largest factor with maximum multiplicity in p1 (incl. composites)" yields my intended classification?

6)
Message boards :
Sierpinski/Riesel Base 5 Problem :
Truthfulness of "largest known base 5 prime"
(Message 144052)
Posted 1085 days ago by matzetoni
I really think it's futile to come up with a precise mathematical definition of "base5 prime". For example, which of the following (composite) numbers would you consider to be "base5"?
2^1 * 5^1000000 + 1
2^10 * 5^1000000 + 1
2^100 * 5^1000000 + 1
2^1000 * 5^1000000 + 1
2^10000 * 5^1000000 + 1
2^100000 * 5^1000000 + 1
2^1000000 * 5^1000000 + 1
2^1000000 * 5^100000 + 1
2^1000000 * 5^10000 + 1
2^1000000 * 5^1000 + 1
2^1000000 * 5^100 + 1
2^1000000 * 5^10 + 1
2^1000000 * 5^1 + 1
Maybe say something like "base b prime" is a prime of the form p=k*b^n+/1 with b>1 that maximizes b^nk, gcd(k,b)=1? Not sure whether this makes sense
Then I think those numbers would be classified as
 base 5
2^1 * 5^1000000 + 1
2^10 * 5^1000000 + 1
2^100 * 5^1000000 + 1
2^1000 * 5^1000000 + 1
2^10000 * 5^1000000 + 1
2^100000 * 5^1000000 + 1
 base 10
2^1000000 * 5^1000000 + 1
 base 2
2^1000000 * 5^100000 + 1
2^1000000 * 5^10000 + 1
2^1000000 * 5^1000 + 1
2^1000000 * 5^100 + 1
2^1000000 * 5^10 + 1
2^1000000 * 5^1 + 1

7)
Message boards :
Number crunching :
LLR2 installed on all big LLR projects
(Message 143245)
Posted 1112 days ago by matzetoni
Nice! This may attract a few crunchers to run conjecture projects more :)

8)
Message boards :
General discussion :
Favourite Prime Number.
(Message 142604)
Posted 1136 days ago by matzetoni
1+2+8+1+9+7+9 = 37 and 128*1979+1281979 are also prime :)

9)
Message boards :
Generalized Fermat Prime Search :
GFN15 MEGA Prime Search starts June 27, 2020
(Message 141605)
Posted 1176 days ago by matzetoni
Is it the smallest GFN13 with b > 10^16? /JeppeSN
Yep, it is. It's not too hard to find primes of this size, so I thought why not just go for it.
Wrote my own homemade (crappy python) sieve for it to get at least a few candidates out of the way before testing, so that was fun xD
Anyway, sorry for creating such much confusion :0

10)
Message boards :
Generalized Fermat Prime Search :
GFN15 MEGA Prime Search starts June 27, 2020
(Message 141587)
Posted 1176 days ago by matzetoni
ï¼Ÿ
just thought you guys like GFNs with large base ;)
