![]() |
![]() |
#1 |
Dec 2008
138 Posts |
![]()
Recently I certificated some prime numbers from factordb database using primo and observed big differences in time required to certificate. Below are my best / worst iterations so far:
Best: N=(340^340*97+1)/19157183 Code:
[5] Type=3 Gain=138 Index=1.4 D=-4 H/G=1/1 Code:
[1] Type=4 Gain=45 Index=8.83768 D=-7344232 H/G=616/8 Last fiddled with by klajok on 2011-07-21 at 08:24 Reason: typo |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Primo version 4 certificates | danaj | FactorDB | 11 | 2016-11-24 01:59 |
Fun with the Lucky Numbers of Euler | ewmayer | Probability & Probabilistic Number Theory | 0 | 2015-10-18 01:37 |
What are the Primality Tests ( not factoring! ) for Fermat Numbers? | Erasmus | Math | 46 | 2014-08-08 20:05 |
PRIMALITY PROOF for Wagstaff numbers! | AntonVrba | Math | 96 | 2009-02-25 10:37 |
Two Primality tests for Fermat numbers | T.Rex | Math | 2 | 2004-09-11 07:26 |