easy-snfs.txt -- updated 23 September 2007.

These are AFAIK the easiest few Cunningham project composites for SNFS:

n        size  f(x)                                   g(x)           difficulty
-------  ----  -------------------------------------  -------------  ----------
2,1962M  c173  x^6-12x^4+4x^3+36x^2-24x-8             2^54x-2^109-1  196.87 (*)
2,1582L  c162  x^6+2x^5-10x^4-20x^3+16x^2+32x+8       2^56x-2^113-1  204.10 (*)
10,309-  c166  100x^6+10x^3+1		              x-10^34        206.00
 7,366+  c151  x^6-7x^3+49		              x-7^41         207.89
 5,447-  c207  x^6+5x^3+25		              x-5^50         209.69
10,312+  c160  x^6-10x^3+100		              x-10^35        210.00


(*) = Reserved.