3LM Table discussion

[Batalov]

Phew!
There's a full update to the 3LM extension tables. (See post #2-4, merged.)
Also, added a live link to the 'massaged' FactorDB (which is still unaware of 3LM Aurifeuillian factors; had to punch them in).

Notice that it provides some nice entry level jobs for anyone.
For example: 3,1275M is difficulty only 162 (with a quartic, though).

PM me for poly, if needed. In short, it is
c4: 1
c3: 3
c2: -6
c1: -18
c0: -9
with Y1 = 3^42 and Y0 = -(3^85+1), ok? Will provide help with lims. Just ask.

Several easiest numbers are accessible to anyone armed even with a PentiumIII.

[Mini-Geek]

I might run 3,1275M. I'm PMing Batalov for details.

[R.D. Silverman]

Originally Posted by Batalov

Phew!
There's a full update to the 3LM extension tables. (See post #2-4, merged.)
Also, added a live link to the 'massaged' FactorDB (which is still unaware of 3LM Aurifeuillian factors; had to punch them in).

Notice that it provides some nice entry level jobs for anyone.
For example: 3,1275M is difficulty only 162 (with a quartic, though).

PM me for poly, if needed. In short, it is
c4: 1
c3: 3
c2: -6
c1: -18
c0: -9
with Y1 = 3^42 and Y0 = -(3^85+1), ok? Will provide help with lims. Just ask.

Several easiest numbers are accessible to anyone armed even with a PentiumIII.

I wish that you had not done this. Now, people will want to pick the
low hanging fruit from the extensions, rather than work on other,
unfinished tables.

[Mini-Geek]

Originally Posted by R.D. Silverman

I wish that you had not done this. Now, people will want to pick the
low hanging fruit from the extensions, rather than work on other,
unfinished tables.

Ah, but you're assuming that if someone wasn't working on this, they would be working on unfinished tables. Well, I for one wouldn't. They're just too big for my small resources.

[R.D. Silverman]

Originally Posted by Mini-Geek

Ah, but you're assuming that if someone wasn't working on this, they would be working on unfinished tables. Well, I for one wouldn't. They're just too big for my small resources.

To completion? Certainly. But NFS@Home can always use contributors.

[Andi47]

Originally Posted by Mini-Geek

Ah, but you're assuming that if someone wasn't working on this, they would be working on unfinished tables. Well, I for one wouldn't. They're just too big for my small resources.

For mine too - the c153 from 2,1766M, which I did, barely fitted into my ressources. With my ressources I *can* pick some low-hanging fruit from the extended table, but on the unfinished (non-extended) tables I don't see a fruit hanging low enough to fit into my resources (especially RAM for postprocessing).

[bdodson]

Originally Posted by Batalov

Phew!
There's a full update to the 3LM extension tables. (See post #2-4, merged.)
Also, added a live link to the 'massaged' FactorDB (... had to punch them in).

OK, I'm puzzled about this post (and the follow-ups). We're in a
sub-thread of the Cunningham Tables, on the 3+ list. There's nothing
on Sam's page about an extention/update to the 3LM tables. If the
update in question is an update to FactorDB, then please move these
posts to somewhere appropriate for FactorDB tables.

Regards, bdodson

Notice that it provides some nice entry level jobs for anyone.
For example: 3,1275M is difficulty only 162 (with a quartic, though).

Several easiest numbers are accessible to anyone armed even with a PentiumIII.

There's no shortage of entry level factoring projects. Let me
rephrase that; there's _FAR_ from a shortage of ...

(and a PS: was that an endorsement of NFS@Home in that post
of Bob's? I'd encourage anyone interested in factoring Cunningham
numbers, especially ones with increasing snfs difficulties; to have
a look at the "Status of Numbers" link on NFS@Home --- the
prospective November completions are on track to pass the October
rate; bunches of most Wanted numbers from the page 112 list
(still not yet online).

and a PPS: the bdodson contribution over there is primarily from cpu's
that weren't in the x86-64 condor pools being used for C/D, W+D,
B+D numbers, and the most recent W+mersenneforum+D number;
to the contrary, NFS@Home added a nice chunk of sieving for M941
off the books of the boinc effort.)

[R.D. Silverman]

Originally Posted by R.D. Silverman

To completion? Certainly. But NFS@Home can always use contributors.

Let me also note that there are quite a few Fibonacci/Lucas numbers
available via SNFS for people with limited respources. See Blair
Kelly's web pages. SNFS Quintics will work quite well for these.

[R.D. Silverman]

Originally Posted by R.D. Silverman

Let me also note that there are quite a few Fibonacci/Lucas numbers
available via SNFS for people with limited respources. See Blair
Kelly's web pages. SNFS Quintics will work quite well for these.

Here is the URl

http://home.att.net/~blair.kelly/mathematics/fibonacci/

[R.D. Silverman]

Originally Posted by R.D. Silverman

Here is the URl

http://home.att.net/~blair.kelly/mathematics/fibonacci/

The first hole in the Lucas table has SNFS difficulty 213.

[jyb]

Originally Posted by bdodson

OK, I'm puzzled about this post (and the follow-ups). We're in a
sub-thread of the Cunningham Tables, on the 3+ list. There's nothing
on Sam's page about an extention/update to the 3LM tables.

???

http://homes.cerias.purdue.edu/~ssw/cun/3LM

Doesn't that qualify as "Sam's page"?