Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3). |
Topics | Help • Register • News • History • How to • Sequences statistics • Template prototypes |
Difference between revisions of "Cunningham project"
(infobox projects) |
(navbox) |
||
Line 65: | Line 65: | ||
*[http://www.ams.org/online_bks/conm22/ Online version of the third edition of the book] | *[http://www.ams.org/online_bks/conm22/ Online version of the third edition of the book] | ||
*[[Wikipedia:Cunningham_project|Cunningham project]] | *[[Wikipedia:Cunningham_project|Cunningham project]] | ||
− | {{ | + | {{Navbox Projects}} |
[[Category:Cunningham project| ]] | [[Category:Cunningham project| ]] |
Revision as of 11:37, 7 March 2019
Contents
[hide]The aim of this project is to find the complete factorization of numbers of the form
The project started in 1925, when Allan Cunningham and Herbert Woodall published a book of tables about this subject. Many people contributed to it and it is considered the oldest continuously ongoing activity in computational number theory.
At this moment three editions of the book about the Cunningham project have been published.
Current limits of the exponents of the Cunningham tables are:
Base | 2 | 3 | 5 | 6 | 7 | 10 | 11 | 12 |
Limit | 1200 | 600 | 450 | 400 | 400 | 400 | 300 | 300 |
Properties of Cunningham factors
In the Cunningham tables, we eliminate two types of factors before factoring the remaining cofactor. The first type is algebraic factor, which are derived from a lower exponent. The second type is aurifeuillian factor, in which the whole number can be split into two parts directly, for certain combination of values of
Algebraic factorizations
It is trivial from elementary algebra that
for any value of
only when
Also that,
.
Thus, it turns out that both
Aurifeuillian factorizations
Consider the identity
where
This factorization was discovered for one value by Aurifeuille and the general form was subsequently given by Lucas. Here are the Aurifeuillian factorizations for the other bases.
where where where where where where where
So, there exist an Aurifeuillian factorization for base
Other factors
Once the algebraic and Aurifeuillian factors are removed, the other factors of
For Mersenne numbers of the form
Cunningham numbers of the form
Only the first five Fermat numbers, k = 0, 1, 2, 3, 4 corresponding to 3, 5, 17, 257 and 65537 are known to be prime. All Fermat numbers from k = 5 to k = 32 are known to be composite. Fermat numbers till k = 11 are fully factorized.
Does there exist any squares of primes that divide Mersenne numbers of the form
See also
External links
- Cunningham project Web site
- Brent-Montgomery-te Riele table Web site (extension to larger bases).
- Cunningham tables at MersenneForum
- Online version of the third edition of the book
- Cunningham project
Ongoing |
|
Terminated |