20200531, 01:04  #23 
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3
2^{2}·3·5·151 Posts 

20200531, 03:16  #24 
Undefined
"The unspeakable one"
Jun 2006
My evil lair
2^{5}×173 Posts 
Only if you assume the test was run perfectly without any coding bugs or subtle system problems. And that the poster is upstanding and forthright without any agenda towards deception.

20200531, 03:17  #25 
Sep 2002
Database er0rr
17×193 Posts 
Another test needs to be done to get matching residue. There remains a nonzero chance that the number is prime. Maybe something like 1/2^10000 considering how fantastically accurate GEC is

20200531, 03:45  #26 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
10000000010101_{2} Posts 
I bet Ken is on it as we speak.

20200531, 05:53  #27 
"Serge"
Mar 2008
Phi(3,3^1118781+1)/3
2^{2}×3×5×151 Posts 
.

20200531, 15:22  #28 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
4070_{10} Posts 
How far has 2^{70237298350549551468899}1 been factored?

20200531, 15:24  #29  
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
111111100110_{2} Posts 
Quote:


20200531, 16:06  #30 
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
8213_{10} Posts 
It is not worth anybody's time, expect the OP to worry about that.
2^110 per https://mersenneforum.org/showpost.p...5&postcount=19 Last fiddled with by Uncwilly on 20200531 at 16:15 
20200531, 16:09  #31 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
111111100110_{2} Posts 
I left M102589933 alone, since when I checked it earlier, it was reserved to GPU72. Then it progressed rapidly to a conclusion.
102589933 NF to 77 bits, P1 NF, PRP C, eliminated (Thanks Jan S et al) As a preemptive effort regarding further rhyming exponent claims, the few survivors have been taken a bit further 232589933 NF to 79 bits, P1 NF, PRP assigned (queued in gpuowl on a radeon vii) 642589933 NF to 84 bits, P1 in progress to B1=5740000,B2=172200000 (prime95 on i74790) 652589933 NF to 84 bits, P1 in progress to B1=5820000,B2=174600000 (gpuowl on radeon vii) M70237298350549551468899 I've done from zero, NF to 123 bits (Ernst's mfactor program took ~44 hours with 16 processes on a dual12corexeone52697 to do 122123 bits, with only ~15% impact on prime95 throughput thanks to hyperthreading; any further progress on it will be posted in https://www.mersenneforum.org/showpo...04&postcount=5. This one is wildly out of reach of P1 or primality testing, due to estimated file size, estimated memory requirements, software suitability, and run time projections) Last fiddled with by kriesel on 20200531 at 16:16 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Rough number behaviour close to record gaps  robert44444uk  Prime Gap Searches  1  20190207 16:41 
Can you find another number like 2200?  goldbug  Puzzles  31  20181208 20:11 
Test a Specific Exponent in Prime95. When it is 100% done, does it mean I find a new prime number?  king  Information & Answers  5  20180221 18:15 
find the missing number  MattcAnderson  Puzzles  10  20170521 01:52 
how do you find number of digits of a 2^n number?  Unregistered  Math  11  20041130 22:53 