mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Lone Mersenne Hunters

Reply
 
Thread Tools
Old 2022-05-23, 17:05   #2135
nordi
 
Dec 2016

23·3·5 Posts
Default

M36919 has a 180.968-bit (55-digit) factor: 2997347544642661833497896836795494793702018162645139063 (P-1,B1=2000000000,B2=401927737170960)


That gets me to the top of the list of P-1 factors for Mersenne numbers! And all thanks to the new version 30.8 of mprime.


nordi is offline   Reply With Quote
Old 2022-05-23, 17:12   #2136
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

3,733 Posts
Default

James Heinrich is offline   Reply With Quote
Old 2022-05-23, 17:17   #2137
axn
 
axn's Avatar
 
Jun 2003

33·199 Posts
Default

Nice!
axn is online now   Reply With Quote
Old 2022-05-23, 18:15   #2138
masser
 
masser's Avatar
 
Jul 2003
Behind BB

3·5·127 Posts
Default

Wow! Congrats!
masser is offline   Reply With Quote
Old 2022-05-23, 18:47   #2139
charybdis
 
charybdis's Avatar
 
Apr 2020

23·3·31 Posts
Default

Quote:
Originally Posted by nordi View Post
That gets me to the top of the list of P-1 factors for Mersenne numbers! And all thanks to the new version 30.8 of mprime.
Congratulations!

This comes in at 10th place on the all-time P-1 list, i.e. not restricted to Mersennes. You should drop Paul Zimmermann an email; his address is on the page I linked.
charybdis is online now   Reply With Quote
Old 2022-05-23, 19:31   #2140
James Heinrich
 
James Heinrich's Avatar
 
"James Heinrich"
May 2004
ex-Northern Ontario

3,733 Posts
Default

Quote:
Originally Posted by charybdis View Post
This comes in at 10th place on the all-time P-1 list, i.e. not restricted to Mersennes. You should drop Paul Zimmermann an email; his address is on the page I linked.
Record-size Mersenne factors are automatically reported to Paul Zimmerman (and Richard Brent for ECM) during the nightly data sync. The codepath for auto-reporting P-1 factors hasn't yet been tested (nobody has found a sufficiently large P-1 factor since I wrote the code in 2020) so tonight will be its test. Wouldn't hurt for nordi to email him anyways.

Last fiddled with by James Heinrich on 2022-05-23 at 19:31
James Heinrich is offline   Reply With Quote
Old 2022-05-23, 20:35   #2141
xilman
Bamboozled!
 
xilman's Avatar
 
"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across

11,369 Posts
Default

Quote:
Originally Posted by storm5510 View Post
This is from GMP-ECM, and an error on my part:

Code:
********** Factor found in step 2: 223
2022-04-04 09:43:03.243 Found prime factor of 3 digits: 223
2022-04-04 09:43:03.243 Composite cofactor (2^7363-1)/223 has 2215 digits
This is for M7363 which does not appear in any database I can find. I had intended M4363. Make of it what you will.
Substantially beyond the limits of the 2- Cunningham table.

Don't let that stop you from trying to find more factors though.
xilman is offline   Reply With Quote
Old 2022-05-23, 20:39   #2142
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

9,857 Posts
Default

Quote:
Originally Posted by nordi View Post
M36919 has a 180.968-bit (55-digit) factor: 2997347544642661833497896836795494793702018162645139063 (P-1,B1=2000000000,B2=401927737170960)


That gets me to the top of the list of P-1 factors for Mersenne numbers! And all thanks to the new version 30.8 of mprime.
That is indeed a good factor!

Cross-post it in the "(Preying for) World Record P-1" thread
Batalov is offline   Reply With Quote
Old 2022-05-23, 20:43   #2143
xilman
Bamboozled!
 
xilman's Avatar
 
"𒉺𒌌𒇷𒆷𒀭"
May 2003
Down not across

11,369 Posts
Default

Quote:
Originally Posted by xilman View Post
Substantially beyond the limits of the 2- Cunningham table.

Don't let that stop you from trying to find more factors though.
For instance:
Code:
pcl@thoth:~/Astro/Misc$ ecm 10000
GMP-ECM 7.0.4 [configured with GMP 6.2.1, --enable-asm-redc] [ECM]
(2^7363-1)/223
Input number is (2^7363-1)/223 (2215 digits)
Using B1=10000, B2=1678960, polynomial x^1, sigma=0:17348063569600894463
Step 1 took 838ms
Step 2 took 724ms
********** Factor found in step 2: 4816405503271
Found prime factor of 13 digits: 4816405503271
Composite cofactor ((2^7363-1)/223)/4816405503271 has 2202 digits
((2^7363-1)/223)/4816405503271
Input number is ((2^7363-1)/223)/4816405503271 (2202 digits)
Using B1=10000, B2=1678960, polynomial x^1, sigma=0:17644336739200299761
Step 1 took 833ms
********** Factor found in step 1: 616318177
Found prime factor of 9 digits: 616318177
Composite cofactor (((2^7363-1)/223)/4816405503271)/616318177 has 2193 digits
That was, of course, rather silly. Because we know that 7363 = 37*199 there are some obvious algebraic factors. It was easier for me to type in ((2^7363-1)/223)/4816405503271 than to perform the algebra.
xilman is offline   Reply With Quote
Old 2022-05-25, 02:20   #2144
Dr Sardonicus
 
Dr Sardonicus's Avatar
 
Feb 2017
Nowhere

133008 Posts
Default

Quote:
Originally Posted by xilman View Post
For instance:
Code:
pcl@thoth:~/Astro/Misc$ ecm 10000
GMP-ECM 7.0.4 [configured with GMP 6.2.1, --enable-asm-redc] [ECM]
(2^7363-1)/223
Input number is (2^7363-1)/223 (2215 digits)
Using B1=10000, B2=1678960, polynomial x^1, sigma=0:17348063569600894463
Step 1 took 838ms
Step 2 took 724ms
********** Factor found in step 2: 4816405503271
Found prime factor of 13 digits: 4816405503271
Composite cofactor ((2^7363-1)/223)/4816405503271 has 2202 digits
((2^7363-1)/223)/4816405503271
Input number is ((2^7363-1)/223)/4816405503271 (2202 digits)
Using B1=10000, B2=1678960, polynomial x^1, sigma=0:17644336739200299761
Step 1 took 833ms
********** Factor found in step 1: 616318177
Found prime factor of 9 digits: 616318177
Composite cofactor (((2^7363-1)/223)/4816405503271)/616318177 has 2193 digits
That was, of course, rather silly. Because we know that 7363 = 37*199 there are some obvious algebraic factors. It was easier for me to type in ((2^7363-1)/223)/4816405503271 than to perform the algebra.
For an odd prime p, any prime factor q of 2^p - 1 is of the form 2*k*p+1, k integer; in particular, q > p.

This leads to a ludicrous proof of compositeness and factorization:

The fact that 223 divides 2^7363 - 1 though 223 < 7363 proves that 7363 is composite.

Factoring 223 - 1 or 222, we get the prime factors 2, 3, and 37. And 37 divides 7363, the quotient being 199.

Curiously, the factor 4816405503271 divides the "primitive part" (2^7363 - 1)/(2^37 - 1)/(2^199 - 1) of 2^7363 - 1. The cofactor (2^7363 - 1)/(2^37 - 1)/(2^199 - 1)/4816405503271 is composite.

Last fiddled with by Dr Sardonicus on 2022-05-25 at 02:23 Reason: gifnix topsy
Dr Sardonicus is offline   Reply With Quote
Old 2022-05-28, 14:38   #2145
charybdis
 
charybdis's Avatar
 
Apr 2020

74410 Posts
Default

Quote:
Originally Posted by James Heinrich View Post
Record-size Mersenne factors are automatically reported to Paul Zimmerman (and Richard Brent for ECM) during the nightly data sync. The codepath for auto-reporting P-1 factors hasn't yet been tested (nobody has found a sufficiently large P-1 factor since I wrote the code in 2020) so tonight will be its test. Wouldn't hurt for nordi to email him anyways.
I see that Paul's list still hasn't ben updated. Did the code work correctly?
charybdis is online now   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Factor found that should have been found by P-1 tha Data 65 2020-08-05 21:11
F12 factor found? johnadam74 FermatSearch 16 2016-11-03 12:10
TF Factor Found CPU Credit TheMawn GPU Computing 3 2013-06-17 06:21
found this factor tha Factoring 4 2007-06-18 19:56
After a factor is found it keeps on going jocelynl Software 6 2004-08-07 01:31

All times are UTC. The time now is 02:06.


Sat Jun 25 02:06:20 UTC 2022 up 72 days, 7 mins, 0 users, load averages: 1.29, 1.10, 1.07

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔