Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Making Prime Numbers
Replies: 2   Last Post: Apr 23, 2013 4:43 PM

 Messages: [ Previous | Next ]
 dan73 Posts: 468 From: ct Registered: 6/14/08
Re: Making Prime Numbers
Posted: Apr 23, 2013 4:43 PM

>I've been reading a few posts and doing some research >and I'd like to propose the following:

>For any integer x, where x is not of the form an+4, >where a is a multiple of 3 and n is a member of the >natural #s (including o), the trinomial x^2+x+1 will >produce prime numbers.

Then all these x's that cannot be used are all 1(mod 3)
and all the remaining x's will not produce all primes but
will have many composites among the primes.
So all x's that qualify ((a) not a multiple of 3 for (a)n)
but not necessarily prime are all the 0(mod 3) and all the 2(mod 3).
So the formula x^2+x+1 are for x is either a 0(mod 3) or
a 2(mod 3) and will produce a results that is a 1(mod 3)
and not by a long shot they are all prime.

If I am interpreting this correctly, what is your point?

Dan

Date Subject Author
12/28/12 Ken Abbott
4/23/13 Karthik Yegnesh
4/23/13 dan73