![]() |
|
|
#573 |
|
Jun 2003
2·3·7·112 Posts |
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]
|
|
|
|
|
|
#574 | |
|
May 2007
Kansas; USA
101000101011002 Posts |
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. Last fiddled with by gd_barnes on 2012-10-25 at 09:43 |
|
|
|
|
|
|
#575 | |
|
Jun 2003
10011110110102 Posts |
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. |
|
|
|
|
|
|
#576 |
|
Sep 2002
17·47 Posts |
P-1 found a factor in stage #2, B1=540000, B2=10260000.
UID: Jwb52z/Clay, M58476683 has a factor: 964450670265572517690165478951 99.606 bits. |
|
|
|
|
|
#577 |
|
Sep 2002
17·47 Posts |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58776209 has a factor: 142915865466782539771681 76.920 bits. |
|
|
|
|
|
#578 |
|
Feb 2012
the Netherlands
2×29 Posts |
When doing some ''Exponents that were poorly P-1 factored'' I found this:
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. Last fiddled with by Stef42 on 2012-11-02 at 10:34 |
|
|
|
|
|
#579 | |
|
"Mr. Meeseeks"
Jan 2012
California, USA
216810 Posts |
Quote:
|
|
|
|
|
|
|
#580 |
|
Sep 2002
17×47 Posts |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58840811 has a factor: 100788975655846818476209 76.416 bits. |
|
|
|
|
|
#581 |
|
Sep 2002
17·47 Posts |
P-1 found a factor in stage #1, B1=545000.
UID: Jwb52z/Clay, M58849337 has a factor: 336520365826449387593167 78.155 bits. |
|
|
|
|
|
#582 |
|
Sep 2002
17×47 Posts |
P-1 found a factor in stage #2, B1=545000, B2=10355000.
UID: Jwb52z/Clay, M58845587 has a factor: 45235574031873267829529 75.260 bits. |
|
|
|
|
|
#583 |
|
6809 > 6502
"""""""""""""""""""
Aug 2003
101×103 Posts
2×4,909 Posts |
M332263333 has a factor: 7564203664111030934537
Assigned LL testing to "ANONYMOUS" on 2011-05-27
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new factor of F11?! | siegert81 | FermatSearch | 2 | 2018-01-24 04:35 |
| A fond farewell | rogue | Lounge | 10 | 2008-11-21 05:25 |
| who can factor 10^100+27? | aaa120 | Factoring | 17 | 2008-11-13 19:23 |
| New factor | fivemack | ElevenSmooth | 4 | 2008-05-07 19:28 |
| Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |