An easy method for finding many very large prime numbers
| dc.creator | Euler, Leonhard | |
| dc.date | 2005-07-19 | |
| dc.date | 2008-08-23 | |
| dc.date.accessioned | 2026-07-07T09:57:46Z | |
| dc.date.available | 2026-07-07T09:57:46Z | |
| dc.description | Translated from the Latin original "Facillima methodus plurimos numeros primos praemagnos inveniendi" (1778). E718 in the Enestrom index. If m is a number of the form 4k+1 and is a sum of two relatively prime squares, then it is prime if and only if it is not the sum of two other squares. In this paper Euler wants to generalize this criterion. He looks at when 232aa+1 represents a prime number. He uses his "numeri idonei" (suitable numbers, convenient numbers, idoneal numbers). | |
| dc.description | 8 pages; translation rewritten | |
| dc.identifier | https://arxiv.org/abs/math/0507401 | |
| dc.identifier | http://arxiv.org/abs/math/0507401 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167469 | |
| dc.subject | History and Overview | |
| dc.subject | Number Theory | |
| dc.subject | 01A50; 11E16; 11E41; 11Y11 | |
| dc.title | An easy method for finding many very large prime numbers | |
| dc.type | text |