![]() |
![]() |
#46 |
Dec 2007
Cleves, Germany
2×5×53 Posts |
![]()
M90012887 has a factor: 439952565941844992833877634700202506740401
![]() k1 = 3*3*5*7*11*19*52177399 k2 = 5*11*71851282747 |
![]() |
![]() |
![]() |
#47 |
Sep 2010
Annapolis, MD, USA
101111012 Posts |
![]() |
![]() |
![]() |
![]() |
#48 |
Dec 2007
Cleves, Germany
2·5·53 Posts |
![]() |
![]() |
![]() |
![]() |
#49 |
Sep 2010
Scandinavia
3·5·41 Posts |
![]() |
![]() |
![]() |
![]() |
#50 |
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
102538 Posts |
![]()
Why not? There's no reason a number can't have two factors that happen to have the same bit length. There's probably about a 1/4900 (70^(-2)) chance that any particular Mersenne number has two factors that are 70 bits long, so it should be rare, but it's possible.
|
![]() |
![]() |
![]() |
#51 | |
Sep 2010
Scandinavia
3×5×41 Posts |
![]() Quote:
I wouldn't have been surprised to see a composite factor found by P-1. |
|
![]() |
![]() |
![]() |
#52 | |
Jun 2003
12F816 Posts |
![]() Quote:
![]() |
|
![]() |
![]() |
![]() |
#53 |
Banned
"Luigi"
Aug 2002
Team Italia
26·3·52 Posts |
![]() |
![]() |
![]() |
![]() |
#54 |
Sep 2010
Scandinavia
3·5·41 Posts |
![]()
Why multiply them, instead of reporting them as they are found?
|
![]() |
![]() |
![]() |
#55 |
Jun 2003
23×607 Posts |
![]() |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
A new factor of F11?! | siegert81 | FermatSearch | 2 | 2018-01-24 04:35 |
AMD goes inane | jasong | jasong | 18 | 2013-11-15 22:54 |
A fond farewell | rogue | Lounge | 10 | 2008-11-21 05:25 |
P56 ECM Factor | wblipp | Factoring | 4 | 2005-04-23 11:41 |
Shortest time to complete a 2^67 trial factor (no factor) | dsouza123 | Software | 12 | 2003-08-21 18:38 |