Yes, the main page. Some of them are disproportionally easier than future 3+/- candidates, for sure.

Page 122 is not going to stay empty for a single day, from what I hear.

[QUOTE=Batalov;264335]Yes, the main page. Some of them are disproportionally easier than future 3+/- candidates, for sure.

Page 122 is not going to stay empty for a single day, from what I hear.[/QUOTE]
I was just waiting for the extensions to be added to PaulZ's
Cunningham.in, so as to be able to submit yesterday's p57
to the ECMNET cgi. Uhm; inquiring minds will want to know,
so that's 5,469m p57*c210. -Bruce

[QUOTE=R.D. Silverman;264332]Never mind. I see that Sam added the base 5 extensions to the actual
tables.

The mystery is why he did so when the base 3 extensions which have been
(presumably) around for a lot longer have NOT been added.

And what about base 6? Table 6- has only 3 composites left.[/QUOTE]I suggested to Sam a while back that he should just extend all the tables to an arbitrary limit of either 1024 bits or 1200 bits (the latter taken from the current limit on the base-2 tables). The bit length would measure either the size of a^n or of any Auriffeuilian factors.

This proposal would, IMO, tend to arrange for all the tables to run short at roughly the same time, whereupon they could all be extended by another constant number of bits. It's what I've done with the homogeneous Cunninghams twice now.

Sam didn't take up the idea, which is his prerogative.

Paul

NFS@Home has completed 5,419-.
[PASTEBIN]eyBrT0EA[/PASTEBIN]

5,1085L is done.

[PASTEBIN]cZNyrKZE[/PASTEBIN]

5,449- is done.

[url]http://factordb.com/index.php?query=5%5E449-1[/url]