Please report any factorizations you find to me by email and inform me of which algorithm you used to find them. Additional information is also welcome: this may include NFS polynomials, factor base and large prime bounds and the size of the matrix or, for ECM, the number of curves run and the B1, B2 and sigma values for the successful curve. Most if not all of this information can be cut and pasted from the output of the factoring software used.
These are the ten Most Wanted Numbers
The first five holes in each table are
The smallest composite remaining to be factored has 150 digits. There are 32 composites with fewer than 160 digits and 99 with at least 1000 digits.
For those wishing to factor with the SNFS algorithm, this table contains the a and n values sorted by SNFS-difficulty (defined here as log10 (n.an) ) for those unfactored numbers which have SNFS-difficulty under 220. There are 81 entries in this table, some of which may have been reserved.
The ECMNet server running at 83.217:167.177:8194 is now loaded with the GCW composites which have at least 300 digits. The others are now available for independent work. Please note that this server is still version 2.x and does not work with V3.0 clients.
The following numbers have been reserved. They have been removed from the ECMNet server. Please mail me if you would like to reserve some numbers for yourself.
|2,701+||C185||Jo Yeong Uk||2013-04-28|