On Lucas's test for the primality of Mersenne's numbers. (Q2611593): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1112/jlms/s1-10.2.162 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2050364522 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 00:32, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On Lucas's test for the primality of Mersenne's numbers. |
scientific article |
Statements
On Lucas's test for the primality of Mersenne's numbers. (English)
0 references
1935
0 references
Verf. gibt einen neuen, einfacheren Beweis seines Kriteriums von 1930 [Ann. Math. (2) 31, 419--448 (1930; JFM 56.0874.04)] für die Unzerlegbarkeit der Zahlen \(2^n-1\), indem er die Lucasschen Funktionen der Zahlen \(1 \pm \sqrt{3}\) betrachtet. -- Nachdem die Zerlegbarkeit für \(n = 241\) entschieden ist, bleiben unter 260 nur sechs Werte \(n \geq 157\) unentschieden.
0 references
primality test
0 references
Mersenne numbers
0 references
Lucas test
0 references