Re: Polynomials and Prime Numbers
- From: "JoeS" <jhs@xxxxxxxxxxxxxx>
- Date: 28 Feb 2006 05:34:12 -0800
Maury Barbato wrote:
Maury Barbato wrote:
Hello,
I read the following result. There's no rational
polynomial P(x) wich generates all the primes
(we say that a rational polynomial P(x) generates a
prime p, if for some n in Z, we have P(n)=p).
Do you know a simple proof of this result?
Thank you for your attention.
Hi, Maury:
This seems trivially false as P(x) = x would then
"generate" prime p when P(p) = p.
Perhaps you have a more restrictive condition
in mind?
regards, chip
What a stupid I am!!!
Surely, the author meant that P(x) generates only primes
for x in Z! So the right formulation is:
There's no rational polynomial P(x) such that P(z) is
prime for every z in Z, and, for every prime p, there's
some z in Z such that P(z)=p.
Forgive my embarrassing slip!
Actually, just the statement "There's no rational polynomial P(x) such
that P(z) is
prime for every z in Z" is true, with the proviso that P(x) is not a
constant. Here's a hint. Prove that
P(x + y*P(x)) is divisible by P(x) for every pair of integers x
and y.
.
- Follow-Ups:
- Re: Polynomials and Prime Numbers
- From: Maury Barbato
- Re: Polynomials and Prime Numbers
- From: Pubkeybreaker
- Re: Polynomials and Prime Numbers
- References:
- Re: Polynomials and Prime Numbers
- From: Chip Eastham
- Re: Polynomials and Prime Numbers
- From: Maury Barbato
- Re: Polynomials and Prime Numbers
- Prev by Date: Re: Proability Question
- Next by Date: Re: Integer-Valued Polynomials
- Previous by thread: Re: Polynomials and Prime Numbers
- Next by thread: Re: Polynomials and Prime Numbers
- Index(es):
Relevant Pages
|
|