|
Now, doesn't it feel good to have let all that vanity loose? Bottled-up vanity could have bad consequences. :smile:
|
P-1 found a factor in stage #1, B1=1000000.
UID: dabaichi/alpha_277, M[URL="http://www.mersenne.org/report_exponent/?exp_lo=7852241&exp_hi=10000&B1=Get+status"]7852241[/URL] has a factor: 262871325597814670948015440740747361897 (127.628 bits) =12636032572020488377 * 20803311806894291761 12636032572020488377 (63.4542 bits) [URL="http://www.mersenne.ca/exponent.php?exponentdetails=7852241"]k[/URL] = 804613139868 = 2*2*3*1049*1229*52009 20803311806894291761 (64.1734 bits) k = 1324673542680 = 2*2*2*3*5*37*4597*64901 This is my first composite factor, and also my second P-1 factor. |
[QUOTE=Batalov;310349]M35649727 has a factor: 149161279507562462423
k = 2092039575893 M36046823 has a factor: 150792452126522743919 k = 2091619171633 M36624967 has a factor: 266121486601426921559 k = 3633061111037 M37394327 has a factor: 170811158018652301919 k = 2283918066217 M37578833 has a factor: 191473778996391019487 k = 2547628062271 M37581961 has a factor: 152701896365352887207 k = 2031584998523 M61396679 has a factor: 750729848684767969583 k = 6113765930929 M62020939 has a factor: 1826837897438471005007 k = 14727589801877 [/QUOTE] Cool, there are a few prime ks there. |
should I want to run a "stage 2" pm1 on dabaichi exponent, what is the correct syntax (with P95-as with gmp-ecm, i know...)?
[code] ecm -pm1 -maxmem 1800 -v -v 2e6 5e6 GMP-ECM 6.4.2 [configured with MPIR 2.5.1] [P-1] (2^7852241-1)/262871325597814670948015440740747361897 [/code] |
[QUOTE=Batalov;310345]Ah! An interesting reason. :-)
Who do you think found ~2,000,000 factors in the same range? And who do you think couldn't give a flying hoot whether their name was attached to such factors or not? Factors don't have names, man. Maybe some primes have, but factors? A dime a million.[/QUOTE] Where do I mail your $.20? :devil: [COLOR=green]-- Donate to the forum of course! I know I did. SB[/COLOR] |
Like butter
M58029469 has a factor: [URL="http://www.mersenne.ca/exponent.php?factordetails=9252873882138722445047"]9252873882138722445047[/URL] [TF:72:73*:mfaktc 0.19 barrett76_mul32]
found 1 factor for M58029469 from 2^72 to 2^73 (partially tested) [mfaktc 0.19 barrett76_mul32] 22 digits, 72.970 bits k = 79725646654967 [B]k factored = 37 × 47 × 67 × 109 × 131 × 173 × 277[/B] |
[QUOTE=flashjh;310465]M58029469 has a factor: [URL="http://www.mersenne.ca/exponent.php?factordetails=9252873882138722445047"]9252873882138722445047[/URL] [TF:72:73*:mfaktc 0.19 barrett76_mul32]
found 1 factor for M58029469 from 2^72 to 2^73 (partially tested) [mfaktc 0.19 barrett76_mul32] 22 digits, 72.970 bits k = 79725646654967 [B]k factored = 37 × 47 × 67 × 109 × 131 × 173 × 277[/B][/QUOTE] [URL="http://www.youtube.com/watch?v=CBrWNbjw3RA"]Indeed...[/URL] |
M84400871 has a factor: 366146159045877230441.
(68.311 bits)k=2^2*5*7*71*79*1429*1933 Found with B1=25k, could have been found with 4% of that... |
P-1 found a factor in stage #2, B1=1000000, B2=10000000, E=6.
M[URL="http://www.mersenne.ca/exponent.php?exponentdetails=7853249"]7853249[/URL] has a factor: 677290196547608503227551 (79.1641 bits) k = 43121655543304975 = 5*5*7*13*31*31*10567*1866547 This is my largest prime factor and my first factor found in P-1 stage 2. |
P-1 found a factor in stage #2, B1=490000, B2=10657500.
UID: Jwb52z/Clay, M45721331 has a factor: 2068776071860350403687 70.809 bits I don't know why this one was not found earlier unless it was just barely missed by the earlier testing. I'm also puzzled as to why I suddenly got a 45M exponent when I had been getting 57M to 59M range numbers. |
[QUOTE=Jwb52z;311009]P-1 found a factor in stage #2, B1=490000, B2=10657500.
UID: Jwb52z/Clay, M45721331 has a factor: 2068776071860350403687 70.809 bits I don't know why this one was not found earlier unless it was just barely missed by the earlier testing. I'm also puzzled as to why I suddenly got a 45M exponent when I had been getting 57M to 59M range numbers.[/QUOTE] [URL="http://www.mersenne.ca/exponent.php?exponentdetails=45721331"]James' site[/URL] says it was only TFd to 61. |
[QUOTE=flashjh;311103][URL="http://www.mersenne.ca/exponent.php?exponentdetails=45721331"]James' site[/URL] says it was only TFd to 61.[/QUOTE]Ah, thank you. I don't have all these helpful related sites saved to check, yet.
|
[QUOTE=flashjh;311103][URL="http://www.mersenne.ca/exponent.php?exponentdetails=45721331"]James' site[/URL] says it was only TFd to 61.[/QUOTE]
Actually, [URL="http://www.mersenne.ca/exponent.php?exponentdetails=45721331"]James' site[/URL] says it was TF'd to 70. :wink: |
No, it says 61. See the table called "TF results". In the table above it, the 68 (and respective 70) are the "limits" up to which TF has to be done by P95 (respective mfakt*).
|
[QUOTE=LaurV;311218]No, it says 61. See the table called "TF results". In the table above it, the 68 (and respective 70) are the "limits" up to which TF has to be done by P95 (respective mfakt*).[/QUOTE]
Umm... to 61 is the only result that was directly reported to Mersenne-aries, as opposed to trawled off of PrimeNet. But on PrimeNet it was TFd to 70. (Note that it says "Actual" just left of the 70.) |
hm... That makes sense too. Maybe James can enlighten us... How is it?
|
[QUOTE=Dubslow;311220]Umm... to 61 is the only result that was directly reported to Mersenne-aries, as opposed to trawled off of PrimeNet. But on PrimeNet it was TFd to 70. (Note that it says "Actual" just left of the 70.)[/QUOTE]
Actually, many intermediary results disappeard from James site a while ago (a month maybe), but to the best of my knowledge the table is still acurate: "Trial Factoring; Limit" / "Actual". Maybe it was a case of reducing the size of the database? |
"That escalated quickly!"
M435503 has a factor: 201346837275660859617983 (78 bits)
k = 7 * 139 * 281 * 845,482,271,069 ECM B1=50k |
P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M57650287 has a factor: 6203229201487897920327616351 92.325 bits. |
[QUOTE=Jwb52z;311416]P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M57650287 has a factor: 6203229201487897920327616351 92.325 bits.[/QUOTE] [URL="http://www.mersenne.org/report_exponent/?exp_lo=57650287"]Everyone[/URL] [URL="http://www.mersenne.ca/exponent.php?exponentdetails=57650287"]knows[/URL]. Unless it's exceptional, there's no need to tell us.... |
[QUOTE=chalsall;311448][URL="http://www.mersenne.org/report_exponent/?exp_lo=57650287"]Everyone[/URL] [URL="http://www.mersenne.ca/exponent.php?exponentdetails=57650287"]knows[/URL].
Unless it's exceptional, there's no need to tell us....[/QUOTE] >90 bits is rather exceptional... and that's what this thread is for anyways, exceptional or not. (It had been de facto P-1 factors only for a while, but recently TF factors have started reappearing.) |
Maybe this thread needs to be renamed, “Found an exceptional factor? Say it.”
Or maybe, “Found a factor? Say it, and we will ridicule you for saying it.” LOL |
Oh, c'mon... a 92.325 bits factor found in P-1 stage 1 is not so trivial... :smile:
Luigi |
[QUOTE=ET_;311469]Oh, c'mon... a 92.325 bits factor found in P-1 stage 1 is not so trivial... :smile:[/QUOTE]
OK... Should we report every factor found here by such means, even though the databases already have this knowledge? I understand that this is a vanity thread, but a 92.325 bit factor isn't really all that impressive -- even at stage 1. |
[QUOTE=chalsall;311473]OK...
Should we report every factor found here by such means, even though the databases already have this knowledge? I understand that this is a vanity thread, but a 92.325 bit factor isn't really all that impressive -- even at stage 1.[/QUOTE] Agree. M1000000000000000000000000000000000000000000000000000000004279 has a factor. k=9980824 Luigi |
Well, forgive me for living, then.
I assumed this was a thread to post factors for fun, but I guess some people can't live with that for some reason, but I'll keep on unless it starts being expressly forbidden, thank you. P-1 found a factor in stage #1, B1=530000. UID: Jwb52z/Clay, M57656957 has a factor: 31753520095302032607020663 84.715 bits. |
[QUOTE=Jwb52z;311502]Well, forgive me for living, then.
I assumed this was a thread to post factors for fun, but I guess some people can't live with that for some reason, but I'll keep on unless it starts being expressly forbidden, thank you. P-1 found a factor in stage #1, B1=530000. UID: Jwb52z/Clay, M57656957 has a factor: 31753520095302032607020663 84.715 bits.[/QUOTE] Are you familiar with Leonard Cohen? [YOUTUBE]GUfS8LyeUyM[/YOUTUBE] [URL="http://www.mersenne.org/report_exponent/?exp_lo=57656957"]Everybody[/URL] [URL="http://www.mersenne.ca/exponent.php?exponentdetails=57656957"]knows.[/URL] |
Do you intend to do that every time I, or anyone else, post a factor simply because you think it's not worthy of being talked about simply because it's recorded on some server list/table/database? I wasn't going to mention this because it was private, but I think I can safely say you can take all this as my giving you a No in response to your offer to go along with the GPU72 subproject now. I hope that you're actually being sarcastic about it, but it's not looking that way if you are going to post links to what I have put in my post from where it's recorded.
|
Yeah, what gives chalsall?
It didn't seem to bother you until 12 hours ago, but this has been going on since before GPU272 even started. |
[QUOTE=Jwb52z;311505]Do you intend to do that every time I, or anyone else, post a factor simply because you think it's not worthy of being talked about simply because it's recorded on some server list/table/database? I wasn't going to mention this because it was private, but I think I can safely say you can take all this as my giving you a No in response to your offer to go along with the GPU72 subproject now. I hope that you're actually being sarcastic about it, but it's not looking that way if you are going to post links to what I have put in my post from where it's recorded.[/QUOTE]
LOL... I sent you one PM months ago asking if you'd like to join the GPU72 project. I never heard back from you, and I never perused. But let's be honest -- we already know when you find a factor -- probably before you do; you don't have to tell us. |
[QUOTE=Dubslow;311506]Yeah, what gives chalsall? It didn't seem to bother you until 12 hours ago, but this has been going on since before GPU272 even started.[/QUOTE]
Grasshopper... Signal to noise. |
[QUOTE=chalsall;311508]LOL... I sent you one PM months ago asking if you'd like to join the GPU72 project. I never heard back from you, and I never perused.
But let's be honest -- we already know when you find a factor -- probably before you do; you don't have to tell us.[/QUOTE]I really want to know how/why you'd know before I do, but you're being sort of snotty about things, so don't bother telling me. |
[QUOTE=Jwb52z;311511]I really want to know how/why you'd know before I do, but you're being sort of snotty about things, so don't bother telling me.[/QUOTE]
Calm down. Iff you have systems which automatically report their results then others might know the results before you do. Iff you are in full control of the reporting you will be the first to know. But only iff you are observant. Is it just me, or it the tension high? |
[QUOTE=chalsall;311513]only iff you are observant.[/quote]The Redundancy Department of Redundancy called... :razz:
[QUOTE=chalsall;311513] Is it just me, or it the tension high?[/QUOTE] My usual response is to ignore it when someone's being stupid. (Note that my post count in response to cheesehead's silliness is pretty low. (Also note that cheesehead makes a lot of not-silly posts, to be "politically correct".)) |
[QUOTE=chalsall;311513]Calm down.
Iff you have systems which automatically report their results then others might know the results before you do. Iff you are in full control of the reporting you will be the first to know. But only iff you are observant. Is it just me, or it the tension high?[/QUOTE]How do you expect me, or anyone else, to react when you are basically saying you're the judge of all things pertaining to what is and is not valid or worthy enough or interesting enough or important enough to talk about in relation to factors, especially in a thread that's suppose to be [B]FUN[/B]. The phrase "pissing in someone's cornflakes" comes to mind at times like this. I apologize if that's not allowed to be said on this forum. Ugh! |
[QUOTE=Jwb52z;311520]The phrase "pissing in someone's cornflakes" comes to mind at times like this. I apologize if that's not allowed to be said on this forum. Ugh![/QUOTE]
Oh no, please continue. Many supermods have said much worse (not really chalsall though). |
[QUOTE=Jwb52z;311520]How do you expect me, or anyone else, to react when you are basically saying you're the judge of all things pertaining to what is and is not valid or worthy enough or interesting enough or important enough to talk about in relation to factors, especially in a thread that's suppose to be [B]FUN[/B]. The phrase "pissing in someone's cornflakes" comes to mind at times like this. I apologize if that's not allowed to be said on this forum. Ugh![/QUOTE]
IMHO, you are overreacting. |
[QUOTE=chalsall;311523]IMHO, you are overreacting.[/QUOTE]
I gotta side with Jwb52z here. It's a harmless thread, why get involved with negative comments? IMO, your response would be much more appropriate if someone started a *new* thread saying "Look at the 90-bit factor I found with P-1!!!". |
Thank you for the support, P95.
|
A relative smooth P-1 factor above 2[SUP]100[/SUP] found a couple of days ago:
P-1 found a factor in stage #1, B1=570000. M56916199 has a factor: 192514199269068153431847285313537 (107.24 Bits; k = 1691207447541148640581632 = 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 3 * 3 * 3 * 7 * 11 * 227 * 1931 * 2141 * 9643 * 43891) |
[QUOTE=TheJudger;311629]A relative smooth P-1 factor above 2[SUP]100[/SUP] found a couple of days ago:
P-1 found a factor in stage #1, B1=570000. M56916199 has a factor: 192514199269068153431847285313537 (107.24 Bits; k = 1691207447541148640581632 = 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 2 * 3 * 3 * 3 * 7 * 11 * 227 * 1931 * 2141 * 9643 * 43891)[/QUOTE] ....wow 2^11. B1=43K and >100 bits. |
[QUOTE=Dubslow;311633]....wow
2^11. B1=43K and >100 bits.[/QUOTE] Even better... B1=10K, B2=44K... Luigi (Now that I think about it... which one would be faster?) |
[QUOTE=ET_;311657]Even better... B1=10K, B2=44K...
Luigi (Now that I think about it... which one would be faster?)[/QUOTE]That one. |
[QUOTE=ET_;311657](Now that I think about it... which one would be faster?)[/QUOTE]
The one with a lower B1 is much faster, as for each additional prime to B1 you need to do a new exponentiation (i.e. a couple of squaring operations and multiplications) mod Mp. When extending B2, for each additional [U]cluster[/U] of primes that you add to B2 you need to do a (single one) multiplication mod Mp. |
[QUOTE=LaurV;311694]The one with a lower B1 is much faster, as for each additional prime to B1 you need to do a new exponentiation (i.e. a couple of squaring operations and multiplications) mod Mp. When extending B2, for each additional [U]cluster[/U] of primes that you add to B2 you need to do a (single one) multiplication mod Mp.[/QUOTE]
That is true, but the modular multiplication on B2 are done on a much higher number of bits... That is the reason of my question. Luigi |
Chals,
Cohen has nothing to do with it. If you want to play that game, don't quote Jwb. "Everybody Knows" what he said- it is on the same page. Please don't take this as an attack on you personally, [B]but please leave the bard duties to daveiddy! [/B]Just my 2¢. |
Found a few lately:
[CODE]P-1 found a factor in stage #1, B1=810000. UID: PageFault/boxen_01, M70002791 has a factor: 10476233014671785173315351[/CODE] [URL="http://www.mersenne.ca/exponent.php?exponentdetails=70002791"]M70002791[/URL] k = 3 x 5^2 x 19 x 79 x 761 x 2141 x 407959 [URL="http://www.mersenne.ca/exponent.php?exponentdetails=70003481"]M70003481[/URL] [CODE]P-1 found a factor in stage #1, B1=810000. UID: PageFault/boxen_01, M70003481 has a factor: 222473048199885240645001[/CODE] k = 2^2 x 3 x 5^4 x 277 x 2731 x 280069 These aren't very smooth. Both could have been found with a ridiculous B1 of 2750. Perhaps I should start pre-screening for these? |
[QUOTE=PageFault;312321]Found a few lately:
[CODE]P-1 found a factor in stage #1, B1=810000. UID: PageFault/boxen_01, M70002791 has a factor: 10476233014671785173315351[/CODE][URL="http://www.mersenne.ca/exponent.php?exponentdetails=70002791"]M70002791[/URL] k = 3 x 5^2 x 19 x 79 x 761 x 2141 x 407959 [URL="http://www.mersenne.ca/exponent.php?exponentdetails=70003481"]M70003481[/URL] [CODE]P-1 found a factor in stage #1, B1=810000. UID: PageFault/boxen_01, M70003481 has a factor: 222473048199885240645001[/CODE]k = 2^2 x 3 x 5^4 x 277 x 2731 x 280069 These aren't very smooth. Both could have been found with a ridiculous B1 of 2750. Perhaps I should start pre-screening for these?[/QUOTE] FWIW, in the 84.4M range, there are at least (several tests left) three numbers factored with B1=60000=B2 or less, including M84,400,003. I am taking this 100k range to B1=1M (slowly) and saving files to do B2 on top of. |
P-1 found a factor in stage #2, B1=530000, B2=9805000.
UID: Jwb52z/Clay, M57744637 has a factor: 256107633532327108861568647 87.727 bits |
P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M57731417 has a factor: 1322645848375959335562359 80.130 bits |
P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M57739921 has a factor: 174129453467924169651127 77.205 bits |
P-1 found a factor in stage #2, B1=565000, B2=12006250, E=6.
UID: Jatheski/JTS_2, M56268371 has a factor: 445745465219441846607767554801 (98.492 bits) k = 3960888304545388799400 = 2^3 × 3 × 5^2 × 47 × 599 × 8573 × 26041 × 1050331 Largest factor I found using P-1 :smile: |
[QUOTE=Jatheski;312517]P-1 found a factor in stage #2, B1=565000, B2=12006250, E=6.
UID: Jatheski/JTS_2, M56268371 has a factor: 445745465219441846607767554801 (98.492 bits) k = 3960888304545388799400 = 2^3 × 3 × 5^2 × 47 × 599 × 8573 × 26041 × 1050331 Largest factor I found using P-1 :smile:[/QUOTE] Sorry for the double post but i cannot edit my previous reply... Two weeks ago i found this one: P-1 found a factor in stage #2, B1=535000, B2=[B]10967500[/B], E=6. UID: Jatheski/JTS_2, M57252271 has a factor: 68943540478860569348473098497 (95.799 bits) k = 602103106782092271488 = 2^7 × 11 × 53 × 521 × 1607 × [B]9636930871 [/B] |
[QUOTE=Jatheski;312530]Sorry for the double post but i cannot edit my previous reply...
Two weeks ago i found this one: P-1 found a factor in stage #2, B1=535000, B2=[B]10967500[/B], E=6. UID: Jatheski/JTS_2, M57252271 has a factor: 68943540478860569348473098497 (95.799 bits) k = 602103106782092271488 = 2^7 × 11 × 53 × 521 × 1607 × [B]9636930871 [/B][/QUOTE] That is a monster B-S find... wow. I'm pretty sure you [URL="http://www.mersenne.ca/brent-suyama.php?s=b2m&o=d"]smashed the record[/URL]. Could you submit the result [URL="http://www.mersenne.ca/index.php?submitresults=1"]here[/URL] so that it appears on that list? |
[QUOTE=Dubslow;312535]That is a monster B-S find... wow. I'm pretty sure you [URL="http://www.mersenne.ca/brent-suyama.php?s=b2m&o=d"]smashed the record[/URL].
Could you submit the result [URL="http://www.mersenne.ca/index.php?submitresults=1"]here[/URL] so that it appears on that list?[/QUOTE] Done :wink: |
M1107383 has factor 1564474840193935787130546961654820353 (120.23 bits)
k = 2^8 * 3 * 11 * 19 * 349 * 58271 * 416761 * 423299 * 1226651 M55519133 has factor 29752078175850937971540599 (84.62 bits) k = 29 * 73 * 83 * 769 * 797 * 2488061 |
P-1 found a factor in stage #2, B1=530000, B2=9805000.
UID: Jwb52z/Clay, M57969139 has a factor: 32237856363446949033270079 84.737 bits |
P-1 found a factor in stage #2, B1=10000000, B2=400000000.
M474137 has a factor: 3398601717070568835246593 ( 25 decimal digits, 82 bits ) k = 2^8 x 199 x 2294057 x 30666851 P-1 found a factor in stage #2, B1=10000000, B2=400000000. M476611 has a factor: 17313319622608998427801440431 ( 29 decimal digits, 94 bits ) k = 5 x 11^2 x 19 x 53 x 823 x 533593 x 67887761 |
M56977079 has factor [URL="http://mersenne.ca/exponent.php?factordetails=3553288320740450075606119012577"]3553288320740450075606119012577[/URL] (101.48 bits)
k = 2^4 * 7^2 * 149 * 227 * 6067 * 337681 * 573973 |
[QUOTE=KingKurly;313219]M56977079 has factor [URL="http://mersenne.ca/exponent.php?factordetails=3553288320740450075606119012577"]3553288320740450075606119012577[/URL] (101.48 bits)
k = 2^4 * 7^2 * 149 * 227 * 6067 * 337681 * 573973[/QUOTE] Nice, just outside B1 in S1. |
P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M58066049 has a factor: 517011437412020183884049 78.775 bits |
P-1 found a factor in stage #1, B1=530000.
UID: Jwb52z/Clay, M57943411 has a factor: 1414709200898298734286401 80.227 bits. |
ECM found a factor in curve #1, stage #0
Sigma=4307542445565784, B1=50000, B2=250000. M268435456 has a factor: 85 What did I win? LOL |
[QUOTE=TObject;313675]ECM found a factor in curve #1, stage #0
Sigma=4307542445565784, B1=50000, B2=250000. M268435456 has a factor: 85 What did I win? LOL[/QUOTE] A math book on Mersenne factors? :smile: 85 has not the form 2kp+1... and 268435456 is 2[sup]28[/sup] and not prime. Luigi |
ET
[QUOTE=ET_;313696]A math book on Mersenne factors? :smile:
85 has not the form 2kp+1... and 268435456 is 2[sup]28[/sup] and not prime. Luigi[/QUOTE] I'm just going to wait until this sinks in for ya, bub. [COLOR=White]2^268435456-1%5=?[/COLOR] |
[QUOTE=ET_;313696]A math book on Mersenne factors? :smile:
85 has not the form 2kp+1... and 268435456 is 2[sup]28[/sup] and not prime. Luigi[/QUOTE] Did whoever created the [url=http://www.mersenne.org/report_ECM/]ECM Progress[/url] report on PrimeNet also win the said book? LOL |
Composite exponent + composite divisor= ?
|
[QUOTE=TObject;313740]Did whoever created the [url=http://www.mersenne.org/report_ECM/]ECM Progress[/url] report on PrimeNet also win the said book? LOL[/QUOTE]
[QUOTE=FTFP][B][SIZE="7"]ECM on Fermat numbers[/SIZE][/B][/QUOTE] Fermat number = 2^xxxx[B][COLOR="Red"]+[/COLOR][/B]1 |
P-1 found a factor in stage #2, B1=530000, B2=9805000.
UID: Jwb52z/Clay, M58188989 has a factor: 55849484816777970918764473 85.530 bits. |
Two factors found with Brent-Suyama:
P-1 found a factor in stage #2, B1=260000, B2=6305000, E=12. M4037023 has a factor: 46132411290706485444839 k = 5713667136737453 = 17 × 31 × 53 × 1327 × 154,154,969 P-1 found a factor in stage #2, B1=290000, B2=7395000, E=12. M4438789 has a factor: 1402524780745530895151 k = 157985069885675 = 5^2 × 73883 × 85,532,569 |
A big one
ANONYMOUS Manual testing 1019 F-ECM Oct 13 2012 2:05AM 0.0 0.0000 1140356877758679056056869944845540826402854641895928218298013381554156431441
249.334 bits Quote from [URL]http://www.mersenne.org/report_recent_cleared/[/URL] There are now 4 known factors of M1019 with a total size of 452.3 bits Factor was not found by me. It would be interesting to know who was the "Anonymous" this time? [URL="http://www.mersenne.org/report_factors/?exp_lo=1&exp_hi=100000&exp_date=&fac_len=76&dispdate=1&B1=Get+Factors"]13th biggest known factor of any Mp[/URL] (not counting the biggest factors of fully factored Mps). Does anyone know wether the remaining 567-bit factor is composite or not? OK Now I have found [URL="http://www.mersenneforum.org/showpost.php?p=314446&postcount=175"]this post[/URL]. Adding a question: Does "prp" in frmky:s log mean that the factors are probable primes, not proven to be primes? |
Found by NFS@home
[URL]http://escatter11.fullerton.edu/nfs/forum_thread.php?id=386[/URL] The remaining 567-bit factor is prime |
[QUOTE=aketilander;314481]
Adding a question: Does "prp" in frmky:s log mean that the factors are probable primes, not proven to be primes?[/QUOTE] Techinically, yes, but with numbers > 30-50 digits, the chance of prp-liar is [i]incredibly[/i] small, small enough that no one usually bothers to check it. Besides, the [URL="http://factordb.com/index.php?query=M1019"]FactorDB[/URL] [URL="http://factordb.com/index.php?id=1100000000543628119"]automatically[/URL] [URL="http://factordb.com/index.php?id=1100000000543628120"]checks[/URL] primality of all numbers < 300 digits (and there are many programs/methods to do larger numbers). |
[QUOTE=Dubslow;314524]Techinically, yes, but with numbers > 30-50 digits, the chance of prp-liar is [I]incredibly[/I] small, small enough that no one usually bothers to check it. Besides, the [URL="http://factordb.com/index.php?query=M1019"]FactorDB[/URL] [URL="http://factordb.com/index.php?id=1100000000543628119"]automatically[/URL] [URL="http://factordb.com/index.php?id=1100000000543628120"]checks[/URL] primality of all numbers < 300 digits (and there are many programs/methods to do larger numbers).[/QUOTE]
Thanks Dubslow, I keep forgetting about FactorDB, its so useful! |
[QUOTE=TObject;313675]ECM found a factor in curve #1, stage #0
Sigma=4307542445565784, B1=50000, B2=250000. M268435456 has a factor: 85 What did I win? LOL[/QUOTE] [QUOTE=ET_;313696]A math book on Mersenne factors? :smile: 85 has not the form 2kp+1... and 268435456 is 2[sup]28[/sup] and not prime. Luigi[/QUOTE] M268435456 does have a factor of 85. Although 85 and 268435456 happen to be composite, it does not invalidate the statement made, even if such statement is not mathematically relevant here. For what it's worth: M268435456 = 3 * 5 * 17 * 257 * 641 * 65537 * 6700417 * ?? Or more interestingly M(2^28) = (2^1+1) * (2^2+1) * (2^4+1) * (2^8+1) * (2^16+1) * (2^32+1) * ?? Note that 2^32+1 = 641 * 6700417. Edit: The question is: How long does this sequence continue? In other words are 2^64+1 and 2^128+1 factors also? |
After some analysis, I just answered my own question above. I'm sure many on here recognize this but I did not. I'll state it for others like me who did not know the following:
For any 2^(2^q)-1 where q is sufficiently large, algebraic factors are: [code] [2^(2^0)+1] * [2^(2^1)+1] * [2^(2^2)+1] * [2^(2^3)+1] * [2^(2^4)+1] * ..... * [2^(2^(q-1))+1] [/code] Therefore M268435456, which represents 2^(2^28)-1 = [code] [2^(2^0)+1] * [2^(2^1)+1] * [2^(2^2)+1] * [2^(2^3)+1] * [2^(2^4)+1] * ..... * [2^(2^27)+1] [/code] Obviously these are not all prime factors but it is a good starting point for full prime factorization. |
M268435456=F28-2
|
[QUOTE=Dubslow;312535]That is a monster B-S find... wow. I'm pretty sure you [URL="http://www.mersenne.ca/brent-suyama.php?s=b2m&o=d"]smashed the record[/URL].
Could you submit the result [URL="http://www.mersenne.ca/index.php?submitresults=1"]here[/URL] so that it appears on that list?[/QUOTE] Just to let you know, it seems that [URL="http://www.mersenne.ca/brent-suyama.php"]statistics[/URL] are not updated. |
[QUOTE=Jatheski;314860]Just to let you know, it seems that [URL="http://www.mersenne.ca/brent-suyama.php"]statistics[/URL] are not updated.[/QUOTE]Thanks (and thanks to Dubslow for pointing me to this thread).
I have found (and fixed) the problem whereby new P-1 factors weren't updating the table as required. I have also gone back and fixed the 4570 affected exponents that weren't correctly registered. And I have also rebuilt the Brent-Suyama table so that the missing exponents are now listed. Now that I've fixed the problem it should continue to operate correctly, but please let me know (PM or email) if it's misbehaving in some way. edit: I just added the date field to the display, [strike]it should automatically populate with date-discovered during its automated overnight update[/strike] and rebuilt the database again so the dates show up now. |
[QUOTE=James Heinrich;314920]Thanks (and thanks to Dubslow for pointing me to this thread).
I have found (and fixed) the problem whereby new P-1 factors weren't updating the table as required. I have also gone back and fixed the 4570 affected exponents that weren't correctly registered. And I have also rebuilt the Brent-Suyama table so that the missing exponents are now listed. Now that I've fixed the problem it should continue to operate correctly, but please let me know (PM or email) if it's misbehaving in some way. edit: I just added the date field to the display, it should automatically populate with date-discovered during its automated overnight update.[/QUOTE] :tu: :smile: Teh interwebz are an awesome place. :grin: |
[QUOTE=James Heinrich;314920]I have found (and fixed) the problem whereby new P-1 factors weren't updating the table as required...[/QUOTE]
Thanks! |
[QUOTE=James Heinrich;314920]I have found (and fixed) the problem whereby new P-1 factors weren't updating the table as required.[/QUOTE]
Thanks ! [QUOTE=Dubslow;312535]That is a monster B-S find... wow. I'm pretty sure you [URL="http://www.mersenne.ca/brent-suyama.php?s=b2m&o=d"]smashed the record[/URL]. [/QUOTE] Yes I did !! :toot::fusion: |
P-1 found a factor in stage #1, B1=535000.
UID: Jwb52z/Clay, M58348951 has a factor: 179068177582890463986842786311 97.176 bits. |
P-1 found a factor in stage #2, B1=535000, B2=9897500.
UID: Jwb52z/Clay, M58376471 has a factor: 430369798332186021062236207481 98.442 bits. |
My first prime k
M[URL="http://www.mersenne.ca/exponent.php?exponentdetails=122881769"]122881769[/URL] has a factor: 43419285610788256439 (65.235 bits)
k=176670982051 (prime) This is my first factor with k being a prime! |
[QUOTE=firejuggler;250103]thanks to mfackt....
[code] M80622803 has a factor 156127704855377865257 M80547619 has a factor 164225854090231111921 M80623813 has a factor 74358285257003853433 M80465149 has a factor 205346902306982285351 M80645441 has a factor 74037992691676741151 M80429911 has a factor 33776959888323700737 M80625551 has a factor 110687074647006079529 M80589031 has a factor 46693727088018753713 M79154843 has a factor 68788380075731936863 M80701741 has a factor 57218973166606961263 M80309303 has a factor 118578090508483702721 M80696089 has a factor 66027939754284563593 M80699447 has a factor 47032613446676890273 M80630159 has a factor 5856285027082755031 M80700929 has a factor 44381842139698978511 M80701553 has a factor 45527575148762247041 M80624041 has a factor 37515177594283365607 M80581283 has a factor 70717839619935960241 M80701561 has a factor 55672736219070980281 M80650799 has a factor 51454583621456883601 M77224867 has a factor 39977700267067630681 [/code] in the last few days, all by TF[/QUOTE] I'm doing some double checking of older posts here. 2 of these factors are composite with very small factors and hence are incorrect: 33776959888323700737 = 3 * 13 * 419^2 * 4933190711903 [The factor should be 133776959888323700737.] 5856285027082755031 = 13 * 227 * 691 * 77893 * 36870287 [The factor should be 95856285027082755031.] |
I'm just curious. Is it considered redundant to enter the factors reported in this thread into the factor database at factordb.com ? I see many of them not in there.
|
[QUOTE=gd_barnes;315893]I'm just curious. Is it considered redundant to enter the factors reported in this thread into the factor database at factordb.com ? I see many of them not in there.[/QUOTE]
I guess "pointless" would be correct way to put it. There is no point in entering the factor without the corresponding divisibility info. And factordb can't handle the Mxxx numbers themselves (too big). [It says the limit is 10 million digits, but for all intents and purposes, it can't handle things above a few hundred thousand digits] |
[QUOTE=axn;315894]I guess "pointless" would be correct way to put it. There is no point in entering the factor without the corresponding divisibility info. And factordb can't handle the Mxxx numbers themselves (too big). [It says the limit is 10 million digits, but for all intents and purposes, it can't handle things above a few hundred thousand digits][/QUOTE]
Um...it can accept factors of numbers up to 18 million digits right now! I entered several factors from here for ~2^60M-1. It will correctly tell you if the number is divisible or not. What do you mean by "it can't handle things above..."? Effectively it is a storage facility for these large numbers. It's not intended to factor them except for very tiny factors. Anyway...just my two cents. |
[QUOTE=gd_barnes;315897]Um...it can accept factors of numbers up to 18 million digits right now! I entered several factors from here for ~2^60M-1. It will correctly tell you if the number is divisible or not.[/quote]
I didn't test how high it would accept -- just went by the error message the system itself reported. But merely accepting a number is not 'handling' it. [QUOTE=gd_barnes;315897]What do you mean by "it can't handle things above..."? Effectively it is a storage facility for these large numbers. It's not intended to factor them except for very tiny factors.[/QUOTE] So now you have 2 large numbers requiring megabytes of storage -- the original mersenne number and the cofactor (which will be of unknown status). Utter waste of space. FactorDB should be a storage facility of factors, not unfactorable numbers. These huge numbers take up space and other resources, with nothing to show for it. |
P-1 found a factor in stage #2, B1=540000, B2=10260000.
UID: Jwb52z/Clay, M58476683 has a factor: 964450670265572517690165478951 99.606 bits. |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58776209 has a factor: 142915865466782539771681 76.920 bits. |
When doing some [COLOR=black]''[/COLOR][URL="http://www.mersenne.ca/p1small.php"][COLOR=black]Exponents that were poorly P-1 factored[/COLOR][/URL][COLOR=black]'' I found this:[/COLOR]
P-1 found a factor in stage #2, B1=175000, B2=3675000, E=6. M14350313 has a factor: 24631165036779102954314969 > 85 bits Sadly, already LL tests done. |
[QUOTE=Stef42;316744]When doing some [COLOR=black]''[/COLOR][URL="http://www.mersenne.ca/p1small.php"][COLOR=black]Exponents that were poorly P-1 factored[/COLOR][/URL][COLOR=black]'' I found this:[/COLOR]
P-1 found a factor in stage #2, B1=175000, B2=3675000, E=6. M14350313 has a factor: 24631165036779102954314969 > 85 bits Sadly, already LL tests done.[/QUOTE] I have a feeling it was done quite a while ago :smile: |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58840811 has a factor: 100788975655846818476209 76.416 bits. |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58849337 has a factor: 336520365826449387593167 78.155 bits. |
P-1 found a factor in stage #2, B1=545000, B2=10355000.
UID: Jwb52z/Clay, M58845587 has a factor: 45235574031873267829529 75.260 bits. |
| All times are UTC. The time now is 22:52. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.