An easy method for finding many very large prime numbers

Details An easy method for finding many very large prime numbers An easy method for finding many very large prime numbers

2005-07-19

arxiv.org/abs/math/0507401v2

Mathematics

History and Overview

8 pages; translation rewritten

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

An easy method for finding many very large prime numbers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An easy method for finding many very large prime numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An easy method for finding many very large prime numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-491324