mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2021-07-13, 08:51   #1
aasteroyis
 
Jul 2021

112 Posts
Minus 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..
aasteroyis is offline   Reply With Quote
Old 2021-07-13, 09:20   #2
tuckerkao
 
"Tucker Kao"
Jan 2020
Head Base M168202123

24×31 Posts
Default

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 2021-07-13 at 09:26
tuckerkao is online now   Reply With Quote
Old 2021-07-13, 09:29   #3
kriesel
 
kriesel's Avatar
 
"TF79LL86GIMPS96gpu17"
Mar 2017
US midwest

10110101001002 Posts
Default




Your model whatever it is has issues.

https://www.alpertron.com.ar/ECM.HTM:
137438953471 = 237-1 = 223 × 616318177
2199023255551 = 241-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, P-1 factor, or adequately trial factor. Current primality testing state of the art is ~5 months for exponent ~109 on a Radeon VII GPU with Gpuowl. Runtime scaling extrapolates at p2.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 P-1 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 2021-07-13 at 09:58
kriesel is offline   Reply With Quote
Old 2021-07-13, 09:52   #4
tuckerkao
 
"Tucker Kao"
Jan 2020
Head Base M168202123

1F016 Posts
Default

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 2021-07-13 at 10:31
tuckerkao is online now   Reply With Quote
Old 2021-07-16, 13:21   #5
aasteroyis
 
Jul 2021

316 Posts
Default

you are certainly right, thanks
aasteroyis is offline   Reply With Quote
Old 2021-07-16, 13:23   #6
aasteroyis
 
Jul 2021

3 Posts
Default

Quote:
Originally Posted by tuckerkao View Post
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.
82589933 × 168433723
aasteroyis is offline   Reply With Quote
Old 2021-07-18, 17:07   #7
Stargate38
 
Stargate38's Avatar
 
"Daniel Jackson"
May 2011
14285714285714285714

673 Posts
Default

Quote:
Originally Posted by tuckerkao View Post
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
It is. Pari/gp:

Code:
Mod(2,3945487217704212192966311)^28326058902171529
%2 = Mod(1, 3945487217704212192966311)

Last fiddled with by Stargate38 on 2021-07-18 at 17:08 Reason: forgot code tags
Stargate38 is offline   Reply With Quote
Old 2021-07-19, 03:54   #8
LaurV
Romulan Interpreter
 
LaurV's Avatar
 
"name field"
Jun 2011
Thailand

9,787 Posts
Default

Quote:
Originally Posted by Stargate38 View Post
It is. Pari/gp:

Code:
gp> Mod(2,3945487217704212192966311)^28326058902171529
 %2 = Mod(1, 3945487217704212192966311)
gp> ##
  ***   last result computed in 0 ms.
gp >
You missed the most important part. Fixed that for you
LaurV is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Doing P-1 on known composite Mersennes bur Factoring 14 2021-04-26 18:06
The spread of low k´s (1 up to 13) of Mersennes Kalli Hofmann Probability & Probabilistic Number Theory 2 2020-09-13 13:39
Possible obfuscation for Mersennes paulunderwood Miscellaneous Math 3 2019-01-24 03:14
Stars and Mersennes David John Hill Jr Science & Technology 2 2009-12-13 09:47

All times are UTC. The time now is 11:16.


Sat Oct 23 11:16:05 UTC 2021 up 92 days, 5:45, 0 users, load averages: 1.04, 1.29, 1.20

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.