![]() |
[M]M103830131[/M] has a 157.127-bit (48-digit) [b]composite[/b] (P24+P24) factor: [url=https://www.mersenne.ca/M103830131]199531333730879095999006796725214407904194653871[/url] (P-1,B1=1708000)
While the composite factor itself it not extremely interesting by itself, I find it interesting because: - it was found in stage 1. - the prime factors are very similar in size (78.460 and 78.667 bits). The prime factors are 415767534785818078323247 and 479910808412848576977793. |
Nice!
|
M106722533 has an 110 bits factor 771972811871697820846912678000249.
Albeit 110 bits is not a joke, the factor is not a record in itself, but it is quite large and nice, considering the fact that was found in stage 1 (yes, it is [URL="https://www.mersenne.ca/exponent/106722533"]sooo smooth[/URL], like ice cream!) |
[QUOTE=LaurV;579389]M106722533 has an [STRIKE]110[/STRIKE] bits factor 771972811871697820846912678000249. [/QUOTE]
Liar! Only 109 bits, 109.25 to be more exact. :razz: |
[QUOTE=Viliam Furik;579393]Liar! Only 109 bits, 109.25 to be more exact. :razz:[/QUOTE]Why stop there? 109.25024907447 :whee:
But LaurV isn't wrong, the factor does take 110 bits to represent. You don't say it's 32.8876 decimal digits long. :smile: |
[QUOTE=Viliam Furik;579393][QUOTE=LaurV;579389]M106722533 has an [STRIKE]110[/STRIKE] bits factor 771972811871697820846912678000249. [/QUOTE]Liar! Only 109 bits, 109.25 to be more exact. :razz:[/QUOTE]Oops.
From my "I can't count" liturgy: [b]Versicle:[/b] How many bits in two to the first power? [b]Responsory:[/b] Two, two. [b]Versicle:[/b] How many decimal digits in ten to the first power? [b]Responsory:[/b] Two, two. From the output of Pari-GP: [code]? v=binary(771972811871697820846912678000249) %1 = [1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1] ? #v %2 = 110 ?[/code] |
A nice run of the mill 79 bit factor: 1025757166134493292294953
But, it was found when I poached (not sorry) a stalled P-1 that was in the lowest 25 exponents for FTC. [M]103547179[/M] There are others down there that have zero check ins since assigned and are more than a month old and thus have violated the rules for Cat 0 (but the rules do seem to apply to P-1 assignments down in the low FTC's)[LIST][*]Must be completed in 30 days[*]Assignments are recycled if assignment is not started with 7 days or when assignment is more than 30 days old.[/LIST] |
[QUOTE=Uncwilly;579496]There are others down there that have zero check ins since assigned and are more than a month old and thus have violated the rules for Cat 0 (but the rules do seem to apply to P-1 assignments down in the low FTC's)[/QUOTE]
Just so you know, I'm working on those held by ANONYMOUS and Kas. Should all be done in about three days (assuming Colab cooperates). |
[QUOTE=chalsall;579497]Just so you know, I'm working on those held by ANONYMOUS and Kas. Should all be done in about three days (assuming Colab cooperates).[/QUOTE]
I have been working bottom up getting about 9 every 5 days. |
[QUOTE=Uncwilly;579503]I have been working bottom up getting about 9 every 5 days.[/QUOTE]
Yeah. I am aware you are on a certain team... :tu: Just wanted to declare intentions, so we didn't duplicate efforts. A Compute Cycle is a terrible thing to waste! :wink: |
[QUOTE=James Heinrich;579396]Why stop there? 109.25024907447 :whee:
But LaurV isn't wrong, [B]the factor does take 110 bits to represent[/B]. You don't say it's 32.8876 decimal digits long. :smile:[/QUOTE] Oh, didn't realize that. Sorry, LaurV. |
| All times are UTC. The time now is 20:13. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.