20210713, 08:51  #1 
Jul 2021
3 Posts 
52. and 53. mersennes :)
hello;
i recognised that i have already found 51 mersenne prime by using my model now, i would like to give you next number 2^137438953471 1, another is 2^2199023255551 1 and i know the other one, i will be happy if you control them, then i will share the my model. Acording to my model we can find all numbers. regards.. 
20210713, 09:20  #2 
"Tucker Kao"
Jan 2020
Head Base M168202123
2^{2}×3×47 Posts 
The exponent of a Mersenne Prime must be prime too.
137438953471 = 223 * 616318177 2199023255551 = 13367 * 164511353 M164511353 already has 1 completed LL test which indicated it was a composite number. M616318177 is quiet a large prime exponent for someone to run a PRP test even with AMD Threadripper 5970X and Nvidia Geforce 3080 Ti. Last fiddled with by tuckerkao on 20210713 at 09:26 
20210713, 09:29  #3 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest
5924_{10} Posts 
Your model whatever it is has issues. https://www.alpertron.com.ar/ECM.HTM: 137438953471 = 2^{37}1 = 223 × 616318177 2199023255551 = 2^{41}1 = 13367 × 164511353 Therefore both claimed primes are easily shown to actually have factors, in seconds. See https://www.mersenneforum.org/showpo...13&postcount=4 Such large exponents would otherwise be impractical to primality test, P1 factor, or adequately trial factor. Current primality testing state of the art is ~5 months for exponent ~10^{9} on a Radeon VII GPU with Gpuowl. Runtime scaling extrapolates at p^{2.1} to primality test duration ~12,000 years for 137438953471, ~4.2 MILLION years for 2199023255551 at ~1 minute per iteration. (And 16 GiB of GPU ram would be inadequate.) So P1 runtime would be ~300 years and ~100,000 years. And also need more memory. See also https://primes.utm.edu/notes/crackpot.html Last fiddled with by kriesel on 20210713 at 09:58 
20210713, 09:52  #4 
"Tucker Kao"
Jan 2020
Head Base M168202123
2^{2}·3·47 Posts 
I'd enjoy a trivia such as: Prove 3,945,487,217,704,212,192,966,311 to be a factor of M28,326,058,902,171,529
I guess I'll know whether M13,910,929,897,510,559 is a Semiprime or not soon. Last fiddled with by tuckerkao on 20210713 at 10:31 
20210716, 13:21  #5 
Jul 2021
3 Posts 
you are certainly right, thanks

20210716, 13:23  #6 
Jul 2021
11_{2} Posts 

20210718, 17:07  #7  
"Daniel Jackson"
May 2011
14285714285714285714
677 Posts 
Quote:
Code:
Mod(2,3945487217704212192966311)^28326058902171529 %2 = Mod(1, 3945487217704212192966311) Last fiddled with by Stargate38 on 20210718 at 17:08 Reason: forgot code tags 

20210719, 03:54  #8 
Romulan Interpreter
"name field"
Jun 2011
Thailand
10011001010000_{2} Posts 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Doing P1 on known composite Mersennes  bur  Factoring  14  20210426 18:06 
The spread of low k´s (1 up to 13) of Mersennes  Kalli Hofmann  Probability & Probabilistic Number Theory  2  20200913 13:39 
Possible obfuscation for Mersennes  paulunderwood  Miscellaneous Math  3  20190124 03:14 
Stars and Mersennes  David John Hill Jr  Science & Technology  2  20091213 09:47 