Number: tst250
N=3675041894739039405533259197211548846143110109152323761665377505538520830273
  ( 76 digits)
Divisors found:
 r1=53169119831396634916152282437374262651 (pp38)
 r2=69119855780815625390997974542224894323 (pp38)
Version: GGNFS-0.76.4
Total time: 0.88 hours.
Scaled time: 0.49 units (timescale=0.553).
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
Sieved special-q in [350000, 410001)
Relations: rels:765551, finalFF:98037
Initial matrix: 64068 x 98037 with sparse part having weight 3134595.
Pruned matrix : 51685 x 52069 with weight 1253689.
Total sieving time: 0.79 hours.
Total relation processing time: 0.04 hours.
Matrix solve time: 0.04 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.88 hours.
 --------- CPU info (if available) ----------
CPU: AMD mobile AMD Athlon(tm) XP2800+ stepping 00
Memory: 449348k/457664k available (2537k kernel code, 7568k reserved, 649k data, 168k init, 0k highmem)
Calibrating delay loop... 4210.68 BogoMIPS
x86info v1.12b.  Dave Jones 2001-2003
Feedback to <davej@redhat.com>.

Found 1 CPU
--------------------------------------------------------------------------
Family: 6 Model: 10 Stepping: 0
CPU Model : Mobile Athlon XP (Barton)
2.1Ghz processor (estimate).

