![]() |
Yes. :rolleyes:
This was in % of log(factored(N^2-1))/logN (not really good science, I know); I am sure that I've seen this notation before, and of course no one [I]really[/I] factors N[SUP]2[/SUP]-1, but instead this is a shorthand for having either one factored well with a bit of help from the other. Quite a good help every once in a while for CHG proofs, but then they take twice as long run-time (i.e. if you do a one-sided CHG proof, with the other strictly declared to be "1", then one pass completes the proof*). ______________ *Well, "2" works too, because clearly both N-1 and N+1 are even. The CHG script removes the gcd(F,G) from the smaller factored part and it internally becomes "1". |
For a while now, if you would
1) enter a previously unknown PRP into the database, 2) assign for PRP check, and then when it returns PRP, 3) click [Primality] green arrow => "This number is already in queue for N+1-test." Well, there is nothing for most of them to do in that queue, but they forever get stuck in it. (N-1, N+1 percent factored don't get calculated, but I can do it myself, of course.) |
Another case, proving [url]http://factorization.ath.cx/index.php?id=1100000000492296686[/url] (3092 digits) prime will enable a N-1 proof that [url]http://factorization.ath.cx/index.php?id=1100000000439186617[/url], (10708^3061-1)/10707, (12331 digits) is prime.
(10708^3061-1)/10707-1 is already 21.463% factored, proving the PRP will add another 25% which is well over 33%. The algebraic factors of N-1 were already in factordb when I looked it it. Chris |
Another, rather large, case:
Proving [url]http://factorization.ath.cx/index.php?id=1100000000775414783[/url] (6846 digits) will enable a N-1 proof for [url]http://factorization.ath.cx/index.php?id=1100000000509255506[/url], (4847393^2048+1)/2 (13692 digits). And thanks to whoever did the last one. Chris |
And another...
Proving [url]http://factorization.ath.cx/index.php?id=1100000000775425506[/url] (6314 digits) will enable a N-1 proof that [url]http://factorization.ath.cx/index.php?id=1100000000257562584[/url], (3^28916+1)/82 (13795 digits) is prime. Chris |
The 6314 is not even 2-PRP :no:
|
Sorry, factordb definitely showed it as PRP when I made the post. But I'd just added the algebraic factors so factordb hadn't had long to check it. I've had this happen before now.
It now shows as factored, which is certainly conclusive proof it's not prime. Chris |
Could we agree to use factordb.com in links?
Not only [URL="http://factorization.ath.cx/index.php?id=1100000000775425506"]http://factorization.ath.cx[/URL] is cumbersome to type, but it is blocked from many addresses. And it only points to [URL]http://factordb.com[/URL] iirc. |
Another (even larger) case:
Proving [URL]http://factordb.com/index.php?id=1100000000648678682[/URL] (8166 digits) will enable a N-1 proof that [URL]http://factordb.com/index.php?id=1100000000319104766[/URL] (15466 digits, (2^51376*3+1)/7, is prime. I didn't add the algebraic factors this time, the smaller PRP has been in factordb since March 2014, so it's not likely to turn out to be composite. Chris PS. Why does factordb have two URLs, factordb.com and factorization.ath.cx? I assume the server isn't on Christmas Island. And are they the only two? |
It started from that .cx URL, but then Markus secured and maintained his own site.
[url]http://whois.domaintools.com/factordb.com[/url] |
[QUOTE=chris2be8;400738]Proving [URL]http://factordb.com/index.php?id=1100000000648678682[/URL] (8166 digits) will enable a N-1 proof that [URL]http://factordb.com/index.php?id=1100000000319104766[/URL] (15466 digits, (2^51376*3+1)/7, is prime.[/QUOTE]
I'd like to try this one if no one else has started on it. |
| All times are UTC. The time now is 21:04. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.