Number: tst250
N=3675041894739039405533259197211548846143110109152323761665377505538520830273
  ( 76 digits)
Divisors found:
 r1=53169119831396634916152282437374262651 (pp38)
 r2=69119855780815625390997974542224894323 (pp38)
Version: GGNFS-0.77.1-20051006-nocona
Total time: 0.49 hours.
Scaled time: 0.70 units (timescale=1.439).
Factorization parameters were as follows:
name: tst250
type: gnfs
n: 3675041894739039405533259197211548846143110109152323761665377505538520830273
m:  236484352978620655
c4: 1175040
c3: 3622248
c2: -24257935345686  
c1: -2473764360148045
c0: 5550344016222364898 
skew: 1000
rlim: 350000
alim: 400000
lpbr: 24
lpba: 24
mfbr: 36
mfba: 36
rlambda: 1.7
alambda: 1.7
qintsize: 10000
q0: 350000


# This polynomial was generated by Chris Card using his implementation
# of the Montgomery/Murphy technique.
# Chris said the skew is 1001. My code scores this 
# polynomial at about:
#  E(F1,F2) = 0.02
Factor base limits: 350000/400000
Large primes per side: 3
Large prime bits: 24/24
Max factor residue bits: 36/36
Sieved algebraic special-q in [350000, 400001)
Primes: RFBsize:29977, AFBsize:34014, largePrimes:740513 encountered
Relations: rels:702258, finalFF:83493
Max relations in full relation-set: 28
Initial matrix: 64068 x 83493 with sparse part having weight 2276547.
Pruned matrix : 50366 x 50750 with weight 1223893.
Total sieving time: 0.45 hours.
Total relation processing time: 0.02 hours.
Matrix solve time: 0.01 hours.
Time per square root: 0.01 hours.
Prototype def-par.txt line would be:
gnfs,75,4,maxs1,maxskew,goodScore,efrac,j0,j1,eStepSize,maxTime,350000,400000,24,24,36,36,1.7,1.7,10000
total time: 0.49 hours.
 --------- CPU info (if available) ----------
              Intel(R) Pentium(R) 4 CPU 3.40GHz stepping 03
Memory: 2055080k/2096640k available (3203k kernel code, 0k reserved, 1799k data, 216k init)
Calibrating delay using timer specific routine.. 6834.84 BogoMIPS (lpj=13669684)
Calibrating delay using timer specific routine.. 6824.64 BogoMIPS (lpj=13649290)
