Table Limits

Table Exponent Limits

For quite a while, the limits on each table had been set to 1024 bits. That is, each table's exponent limit had been set such that each full number, ignoring any factors (algebraic or otherwise), was less than 21024. The exception was numbers that have an Aurifeuillian factorization; in such cases it is the individual Aurifeuillian parts (the "L" and "M" numbers) which had been restricted to 1024 bits.

For reasons discussed in the final section of the page on Aurifeuillian factorization, this has led to problems in some tables, where the algebraic factors of the largest Aurifeuillian numbers were not reflected in the table. As shown there, the correct way to handle that was for the Aurifeuillian limit to be made smaller in those tables. Since that wasn't done initially, correcting the problem by lowering this limit would mean throwing out numbers which were already in the tables. Rather than doing this, we have instead elected to raise the exponent limit for non-Aurifeuillian numbers in those tables, to ensure that all algebraic factors are correctly reflected. In addition, if we raised this limit in one table, then for simplicity we also raised the limit in the corresponding table of opposite sign.

For example, we raised the non-Aurifeuillian limit in the 5n+3n table from 441 to 545, ensuring that all of the algebraic factors for Aurieuillean numbers up to 51635+31635 would be in the table. And so we also raised the limit in the 5n-3n table to have the two tables stay in sync.

This increase in limits affects the following tables:

5n-3n
5n+3n
6n-5n
6n+5n
7n-3n
7n+3n
7n-6n
7n+6n
10n-3n
10n+3n
11n-3n
11n+3n
12n-5n
12n+5n
12n-7n
12n+7n

With these changes, the exponent limits for each table are given below. Note that the limit shown in the column for "Aurifeuillian Extension" only affects one of the two tables in that row, whichever one has Aurifeuillian factors (see the page on Aurifeuillian factorization for details).

Tables Exponent
Limit
Aurifeuillian
Extension
3n-2n
3n+2n
646 1938
4n-3n
4n+3n
511 1533
5n-2n
5n+2n
441 1090
5n-3n
5n+3n
545 1635
5n-4n
5n+4n
441 1095
6n-5n
6n+5n
490 1470
7n-2n
7n+2n
364 826
7n-3n
7n+3n
413 1239
7n-4n
7n+4n
364 847
7n-5n
7n+5n
364 1015
7n-6n
7n+6n
406 1218
8n-3n
8n+3n
341 1014
8n-5n
8n+5n
341 850
8n-7n
8n+7n
341 770
9n-2n
9n+2n
323 646
9n-5n
9n+5n
323 805
9n-7n
9n+7n
323 749
9n-8n
9n+8n
323 646
10n-3n
10n+3n
370 1110
10n-7n
10n+7n
308 770
10n-9n
10n+9n
308 770
11n-2n
11n+2n
296 638
11n-3n
11n+3n
319 957
11n-4n
11n+4n
296 649
11n-5n
11n+5n
296 715
11n-6n
11n+6n
296 858
11n-7n
11n+7n
296 693
11n-8n
11n+8n
296 638
11n-9n
11n+9n
296 649
11n-10n
11n+10n
296 770
12n-5n
12n+5n
355 1065
12n-7n
12n+7n
329 987
12n-11n
12n+11n
285 891