Hi,
Finally had some time to setup a new hard disk, install 64 bit ubuntu and Primo 4.1.1.
My first certified Prime has 4351dd:
[url]http://factordb.com/index.php?id=1100000000824783248[/url]

Question:
* How do you determine the optimum Sieve-Bit parameter?
[url]http://www.ellipsa.eu/public/primo/primo.html#Timings[/url]

Thank you in advance

Another pair where proving the smaller [url]http://factorization.ath.cx/index.php?id=1100000000832912748[/url] will enable a N-1 proof for the larger [url]http://factorization.ath.cx/index.php?id=1100000000832685935[/url] ((34^251-1)^2-2)/23

The smaller was created when I added the algebraic factors of ((34^251-1)^2-2)/23-1 since that's ((34^251-1)^2-25)/23 so splits into (34^251-6)(34^251+4).

Chris

Thanks to whoever proved the last pair.

And here's another pair. Proving [URL]http://factorization.ath.cx/index.php?id=1100000000836244837[/URL] (386 digits) will enable a N-1 proof for (23369^283-1)/23368, [URL]http://factorization.ath.cx/index.php?id=1100000000835634181[/URL] (1232 digits).

Chris

And another, proving [url]http://factorization.ath.cx/index.php?id=1100000000836244978[/url] (401) digits will enable a N-1 proof for (26437^283-1)/26436, [url]http://factorization.ath.cx/index.php?id=1100000000835634435[/url] (1248 digits).

Chris

And another.

Proving [url]http://factorization.ath.cx/index.php?id=1100000000836280514&open=prime[/url] (520 digits) prime will enable a N-1 proof for (24767^373-1)/24766 [url]http://factorization.ath.cx/index.php?id=1100000000835636422[/url] (1635 digits).

Chris

And again.

Proving [url]http://factorization.ath.cx/index.php?id=1100000000836283883[/url] (594 digits) will enable a N-1 proof for (13901^439-1)/13900 [url]http://factorization.ath.cx/index.php?id=1100000000835637312[/url] (1815 digits).

Chris

And another pair.

Proving [url]http://factorization.ath.cx/index.php?id=1100000000836303593[/url] (628 digits) will enable a N-1 proof for (22853^457-1)/22852 [url]http://factorization.ath.cx/index.php?id=1100000000835639140[/url] (1988 digits).

Chris

[QUOTE=chris2be8;432437]And another pair.

Proving [URL]http://factorization.ath.cx/index.php?id=1100000000836303593[/URL] (628 digits) will enable a N-1 proof for (22853^457-1)/22852 [URL]http://factorization.ath.cx/index.php?id=1100000000835639140[/URL] (1988 digits).

Chris[/QUOTE]

Did a combined N+1/N-1 proof on the p628.

And again...

Proving [url]http://factorization.ath.cx/index.php?id=1100000000836304391[/url] (503 digits) will enable a N-1 proof that (22943^463-1)/22942 [url]http://factorization.ath.cx/index.php?id=1100000000835639239[/url] (2015 digits) is prime.

Chris

[QUOTE=chris2be8;432415]And again.

Proving [url]http://factorization.ath.cx/index.php?id=1100000000836283883[/url] (594 digits) will enable a N-1 proof for (13901^439-1)/13900 [url]http://factorization.ath.cx/index.php?id=1100000000835637312[/url] (1815 digits).

Chris[/QUOTE]

All done except this one. Proving the smaller one did not enable the proof button for the larger one.

That's odd. [url]http://factorization.ath.cx/index.php?id=1100000000835637312&open=prime[/url] now says it's proven by N-1. I've sometimes seen factordb take a little while to recognize updates, that might have happened here.

Thanks for proving all the smaller ones anyway.

Chris