3^124+1 =  145557834293068928043467566190278008218249525830565939618482
        = 2 * 72778917146534464021733783095139004109124762915282969809241
----------------------------------------------------------
bash-2.05$ ./ecm 10000000 <x59
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 72778917146534464021733783095139004109124762915282969809241 (59 digits)
Using B1=10000000, B2=3890888820, polynomial x^60, sigma=1100587233
Step 1 took 2277883ms for 130559473 muls, 3 gcdexts
********** Factor found in step 1: 41
Found probable prime factor of 2 digits: 41
Composite cofactor 1775095540159377171261799587686317173393286900372755361201 has 58 digits
---------------------------------------------------------
bash-2.05$ ecm 225000000 <x58
GMP-ECM 4c, by P. Zimmermann (Inria), 16 Dec 1999, with contributions from
T. Granlund, P. Leyland, C. Curry, A. Stuebinger, G. Woltman, JC. Meyrignac,
A. Yamasaki, and the invaluable help from P.L. Montgomery.
Input number is 1775095540159377171261799587686317173393286900372755361201 (58 digits)
Using B1=225000000, B2=316850584050, polynomial x^1, sigma=348408247
Step 1 took 8064727ms for -1340035794 muls, 3 gcdexts
Step 2 took 4239147ms for 1290896058 muls, 574210 gcdexts
********** Factor found in step 2: 81516726600079249
Found probable prime factor of 17 digits: 81516726600079249
Probable prime cofactor 21775844224805408923066692226998392022049 has 41 digits
--------------------------------------------------------
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
%                                                          %
%                           ECPP                           %
%                                                          %
%                  by Fran\c{c}ois MORAIN                  %
%                  morain@inria.inria.fr                   %
%                      Version V3.4.1                      %
%                                                          %
%           "3 is prime, 5 is prime, 7 is prime            %
%              so every odd number is prime"               %
%                                                          %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
Working on 81516726600079249
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=5000
% N_0=81516726600079249
% next D is 0
% Cofactor after sieve is a probable prime
% D[[0]]=-1
% Factor= 61^1
% Factor= 31^1
% Factor= 17^1
% Factor= 3^2
% Factor= 2^4
% End of depth 0 at 0.057389 s

% Pmax=5000
% N_1=17609368811
% next D is 0
% Cofactor after sieve is a probable prime
% D[[1]]=-1
% Factor= 331^1
% Factor= 83^1
% Factor= 11^1
% Factor= 5^1
% Factor= 2^1
% End of depth 1 at 0.072995 s

% Pmax=5000
% N_2=5827
% next D is 0
% Factorization completed using sieve only
% D[[2]]=-1
% Factor= 971^1
% Factor= 3^1
% Factor= 2^1
% Cofactor is 1
% End of depth 2 at 0.094705 s

% Pmax=5000
% N_3=971
% next D is 0
% Factorization completed using sieve only
% D[[3]]=-1
% Factor= 97^1
% Factor= 5^1
% Factor= 2^1
% Cofactor is 1

% Time for building is 0.083468 s

% Starting phase 2: proving
% Starting proving job for step 0
% N_0 is prime
% Time for proof[0] is 0.001699 s

% Starting proving job for step 1
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_1 is prime
% Time for proof[1] is 0.004183 s

% Starting proving job for step 2
% N_2 is prime
% Time for proof[2] is 0.000371 s

% Starting proving job for step 3
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_3 is prime
% Time for proof[3] is 0.000880 s
% Time for building is 0.083468 s
% Time for proving  is 0.000330 s
% Total time is        0.083905 s
This number is prime
% Time for this number is 0.103170s

Working on 21775844224805408923066692226998392022049
% Performing a quick compositeness test
% This number might be prime
% Entering ECPP
% Starting phase 1: building the sequence of primes
% Pmax=7000
% N_0=21775844224805408923066692226998392022049
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 3
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 4
% Cofactor after sieve is a probable prime
% D[[0]]=4
% A[[0]]=99856129041642385186
% B[[0]]=138863359450972973280
% m[[0]]=21775844224805408922966836097956749636864
% Factor= 53^1
% Factor= 2^8
% End of depth 0 at 0.344158 s

% Pmax=7000
% N_1=1604941349115964690666777424672519873
% next D is 0
% Cofactor after sieve is a probable prime
% D[[1]]=-1
% Factor= 1373^1
% Factor= 41^1
% Factor= 2^6
% End of depth 1 at 0.386681 s

% Pmax=7000
% N_2=445476499386015104749585157311
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% Cofactor after sieve is a probable prime
% D[[2]]=1
% Factor= 1217^1
% Factor= 109^1
% Factor= 2^6
% End of depth 2 at 0.419855 s

% Pmax=5000
% N_3=52472015732071540121311
% next D is 0
% Cofactor after sieve is a probable prime
% D[[3]]=-1
% Factor= 5^1
% Factor= 3^2
% Factor= 2^1
% End of depth 3 at 0.447914 s

% Pmax=5000
% N_4=583022397023017112459
% next D is 0
% itmax=0 ngcd=0 b1=0 b2=0
% itmax=0 ngcd=0 b1=0 b2=0
% next D is 7
% Cofactor after sieve is a probable prime
% D[[4]]=7
% A[[4]]=4738187612
% B[[4]]=18164483266
% m[[4]]=583022397018278924848
% Factor= 1481^1
% Factor= 149^1
% Factor= 2^4
% End of depth 4 at 0.489714 s

% Pmax=5000
% N_5=165129219843487
% next D is 0
% Cofactor after sieve is a probable prime
% D[[5]]=-1
% Factor= 139^1
% Factor= 3^1
% Factor= 2^1
% End of depth 5 at 0.514328 s

% Pmax=5000
% N_6=197996666479
% next D is 0
% Cofactor after sieve is a probable prime
% D[[6]]=-1
% Factor= 2243^1
% Factor= 17^1
% Factor= 13^1
% Factor= 3^1
% Factor= 2^1
% End of depth 6 at 0.527422 s

% Pmax=5000
% N_7=66571
% next D is 0
% Factorization completed using sieve only
% D[[7]]=-1
% Factor= 317^1
% Factor= 7^1
% Factor= 5^1
% Factor= 3^1
% Factor= 2^1
% Cofactor is 1
% End of depth 7 at 0.540793 s

% Pmax=5000
% N_8=317
% next D is 0
% Factorization completed using sieve only
% D[[8]]=-1
% Factor= 79^1
% Factor= 2^2
% Cofactor is 1

% Time for building is 0.407055 s

% Starting phase 2: proving
% Starting proving job for step 0
% Entering the D=4 business
% E found
% Suggested twist(4)=1
% N_0 is prime
% Time for proof[0] is 0.221306 s

% Starting proving job for step 1
% N_1 is prime
% Time for proof[1] is 0.007067 s

% Starting proving job for step 2
% N_2 is prime
% Time for proof[2] is 0.122372 s

% Starting proving job for step 3
% N_3 is prime
% Time for proof[3] is 0.003286 s

% Starting proving job for step 4
% File /home/his/ECPP/Ecpp/Data/Weber/h1g1.cwdx does not exist
% tpber=0.000128s
% j has been computed
% E found
% Suggested twist(7)=-1
% N_4 is prime
% Time for proof[4] is 0.059638 s

% Starting proving job for step 5
% N_5 is prime
% Time for proof[5] is 0.001472 s

% Starting proving job for step 6
% Using complete factorization theorem
% b=1
% Nonresidue is 6
% N_6 is prime
% Time for proof[6] is 0.007086 s

% Starting proving job for step 7
% N_7 is prime
% Time for proof[7] is 0.000480 s

% Starting proving job for step 8
% Using complete factorization theorem
% N_8 is prime
% Time for proof[8] is 0.000683 s
% Time for building is 0.407055 s
% Time for proving  is 0.425805 s
% Total time is        0.832986 s
This number is prime
% Time for this number is 0.871055s

% ==> Total time for the computations is 0.975348s