mersenneforum.org

mersenneforum.org (https://www.mersenneforum.org/index.php)
-   Aliquot Sequences (https://www.mersenneforum.org/forumdisplay.php?f=90)
-   -   Reserved for MF - Sequence 4788 (https://www.mersenneforum.org/showthread.php?t=11615)

dekcarki 2009-12-30 18:26

Using B1=3000000, B2=5706890290, polynomial Dickson(6), sigma=1530872857
Step 1 took 39279ms
Step 2 took 15158ms
********** Factor found in step 2: 91954313213315372804640364402916669
Found probable prime factor of 35 digits: 91954313213315372804640364402916669
Probable prime cofactor 225653454632250912355819749800394215303262812368642804348375684664354501593585125058011274595549690867289505339828574041099734323 has 129 digits


Next: c143 = 24974657531872376085838030641699839995405167943859266286028403658435682652095566362402178295861538671288908969271773700577295839144850244114869

EdH 2009-12-30 19:13

[quote=dekcarki;200335]
. . .
********** Factor found in step 2: 91954313213315372804640364402916669
Found probable prime factor of 35 digits: 91954313213315372804640364402916669
Probable prime cofactor 225653454632250912355819749800394215303262812368642804348375684664354501593585125058011274595549690867289505339828574041099734323 has 129 digits
. . .
[/quote]

Pardon my ignorance (I'm trying to work on that)...

If a "probable" prime is found, how do we decide it is indeed prime? Do we submit it to the db and it verifies for us?

Mini-Geek 2009-12-30 19:36

[quote=EdH;200340]Pardon my ignorance (I'm trying to work on that)...

If a "probable" prime is found, how do we decide it is indeed prime? Do we submit it to the db and it verifies for us?[/quote]
Yep, that's a good way to do it. If you want to verify it locally, the easiest way is to use PARI/gp's isprime function.
[url]http://pari.math.u-bordeaux.fr/[/url]

petrw1 2009-12-30 20:37

[QUOTE=EdH;200340]Pardon my ignorance (I'm trying to work on that)...

If a "probable" prime is found, how do we decide it is indeed prime? Do we submit it to the db and it verifies for us?[/QUOTE]

Don't shoot the messenger but ....

Factoris says

Verification of primality
Yes, 91954313213315372804640364402916669 passes the rigorous primality test, therefore is really a prime.

And Dario Alpern's site says.

225 653454 632250 912355 819749 800394 215303 262812 368642 804348 375684
664354 501593 585125 058011 274595 549690 867289 505339 828574 041099 734323
is prime

10metreh 2009-12-30 21:00

170@1e6 on the c143, no factor.

dekcarki 2009-12-30 21:03

1400 done @ 3e6, no factor

1000 more in queue

R. Gerbicz 2009-12-30 21:13

I've done 650 curves at B1=1e6 (on two cores).

Andi47 2009-12-30 21:16

249@3e6, no factor. Switching to 11e6.

EdH 2009-12-30 21:17

[quote=petrw1;200349]Don't shoot the messenger but ....[/quote]

Why would I assault someone bearing good news?:smile:

Thank you for the replies.

If the db testing is sufficient I would prefer that method to extra work here.

If I can get ggnfs fully functioning on my linux machines, I might like to try helping out with this particular sub-project. I can use gmp-ecm on my linux machines. Maybe I should familiarize myself better with that program first...

henryzz 2009-12-30 21:24

BTW i have switched my p-1 efforts to the c143
B1 of 1e10 is already done

dekcarki 2009-12-30 21:52

ecm@3e6: 1880 + 249 (Andi47) = 2129 curves

will switch to 43e6


All times are UTC. The time now is 23:07.

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.