![]() |
[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. |
M332263333 has a factor: 7564203664111030934537
Assigned LL testing to "ANONYMOUS" on 2011-05-27 :shark: |
| All times are UTC. The time now is 23:02. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.