![]() |
![]() |
#23 |
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
89×113 Posts |
![]()
What was pulled out again? The prime cofactor of the algebraic factor (2^6979-1)/(2^997-1), a.k.a. Phi7(2^997)? It's there.
Last fiddled with by Batalov on 2014-10-15 at 22:25 |
![]() |
![]() |
![]() |
#24 |
Feb 2013
17×29 Posts |
![]()
Still getting a C41715 here both from yafu-x64's "factor" command and also by running the ecm command also with yafu-x64.
This time having the output to the screen (or monitor) instead of a file. Took a bit of time to get the ============================================= ecm: 0/1 curves on C41715, B1=11K, B2=gmp-ecm default visible. Last fiddled with by storflyt32 on 2014-10-20 at 10:47 |
![]() |
![]() |
![]() |
#25 | |
"Ben"
Feb 2007
22×3×311 Posts |
![]() Quote:
I am sorry that yafu does not work on every conceivable input, but the fact remains that it was not designed to work on numbers like this. Why would you insist that yafu is right when every other piece of software that *was* designed for numbers like this disagree with it? |
|
![]() |
![]() |
![]() |
#26 |
Feb 2013
17×29 Posts |
![]()
Do not know where to post this.
http://factordb.com/index.php?id=1100000000785525326 Lying at the bottom of my checkfacts.txt file, the number fits into the factorize line in the Factor Database. Just clicking the Factorize button, it first became "U" for unknown. Clicking the button again and I was told it was a PRP3759. This time it apparently was not because of me. Whose responsibility is to update what and where and if a given number turns out to be a quite large one, who should be credited with the find or discovery? Last fiddled with by storflyt32 on 2015-06-24 at 07:30 |
![]() |
![]() |
![]() |
#27 | |
"Victor de Hollander"
Aug 2011
the Netherlands
49B16 Posts |
![]() Quote:
On the status page, one core of the 2600k is dedicated to do this: "Checking the smallest number with status unknown <20000 digits" |
|
![]() |
![]() |
![]() |
#28 |
"Frank <^>"
Dec 2004
CDP Janesville
2×1,061 Posts |
![]() ![]() |
![]() |
![]() |
![]() |
#29 |
Feb 2013
1111011012 Posts |
![]()
http://factordb.com/index.php?id=1100000000792308300
The remaining C103 is a very difficult one. Running it using ecm only could possibly work, but would probably take a very long time, depending on the number of curves which are being selected. Most likely the 9704 curves being used by the Yafu software is not enough for this number. Therefore a larger number of curves are needed, increasing the number it takes to complete. |
![]() |
![]() |
![]() |
#30 |
Tribal Bullet
Oct 2004
355510 Posts |
![]()
You don't have an hour to factor this yourself?
|
![]() |
![]() |
![]() |
#31 |
"Frank <^>"
Dec 2004
CDP Janesville
84A16 Posts |
![]() |
![]() |
![]() |
![]() |
#32 |
Feb 2013
7558 Posts |
![]()
I notice the factorization of the remaining C103.
Thank you very much for doing that. Appreciated. |
![]() |
![]() |
![]() |
#33 |
Dec 2012
11716 Posts |
![]()
Here is another interesting one. I have recently stumbled onto this C81 (link). This will be a difficult one to crack. In fact, it will likely take longer than the age of the universe to factor. I have already started trial factoring with my pocket calculator, and will let you all know of any results.
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Can Pollard Rho cycles be used to find a factor? | wwf | Factoring | 26 | 2013-09-30 04:24 |
PFGW can't find a small factor. | Arkadiusz | Software | 7 | 2013-02-18 12:43 |
Chance to find an n-digit factor with ECM | RedGolpe | Factoring | 4 | 2007-03-23 15:24 |
How much ECM does it take to find a given factor? | geoff | Factoring | 5 | 2004-09-29 20:14 |
Where I find the best program to it factor keys? I use AMD. | chrow | Factoring | 5 | 2004-02-19 10:15 |