Mixing
Show that there is a polynomial such that P(n) is not prime [closed]
Clash Royale CLAN TAG#URR8PPP
up vote
0
down vote
favorite
Let m and n be a integer. Show that for all values of n there is a polynomial such that P(n) equals toma prime number. For instance for the polynomial $$x^2+1$$ for x=1 the result is equal to 2. Question is finding a polynomal that is not equals to a prime number for all values of x.
polynomials irreducible-polynomials
asked Jul 18 at 8:05
Demir Eken
304
closed as unclear what you're asking by John Ma, Jyrki Lahtonen, Shailesh, Mostafa Ayaz, Christopher Jul 18 at 12:36
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
add a comment |Â
up vote
0
down vote
favorite
Let m and n be a integer. Show that for all values of n there is a polynomial such that P(n) equals toma prime number. For instance for the polynomial $$x^2+1$$ for x=1 the result is equal to 2. Question is finding a polynomal that is not equals to a prime number for all values of x.
polynomials irreducible-polynomials
asked Jul 18 at 8:05
Demir Eken
304
closed as unclear what you're asking by John Ma, Jyrki Lahtonen, Shailesh, Mostafa Ayaz, Christopher Jul 18 at 12:36
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25
add a comment |Â
up vote
0
down vote
favorite
up vote
0
down vote
favorite
Let m and n be a integer. Show that for all values of n there is a polynomial such that P(n) equals toma prime number. For instance for the polynomial $$x^2+1$$ for x=1 the result is equal to 2. Question is finding a polynomal that is not equals to a prime number for all values of x.
polynomials irreducible-polynomials
asked Jul 18 at 8:05
Demir Eken
304
Let m and n be a integer. Show that for all values of n there is a polynomial such that P(n) equals toma prime number. For instance for the polynomial $$x^2+1$$ for x=1 the result is equal to 2. Question is finding a polynomal that is not equals to a prime number for all values of x.
polynomials irreducible-polynomials
asked Jul 18 at 8:05
Demir Eken
304
asked Jul 18 at 8:05
Demir Eken
304
asked Jul 18 at 8:05
Demir Eken
304
asked Jul 18 at 8:05
Demir Eken
304
304
closed as unclear what you're asking by John Ma, Jyrki Lahtonen, Shailesh, Mostafa Ayaz, Christopher Jul 18 at 12:36
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
closed as unclear what you're asking by John Ma, Jyrki Lahtonen, Shailesh, Mostafa Ayaz, Christopher Jul 18 at 12:36
Please clarify your specific problem or add additional details to highlight exactly what you need. As it's currently written, it’s hard to tell exactly what you're asking. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25
add a comment |Â
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25
add a comment |Â
1 Answer
1
active
oldest
votes
up vote
0
down vote
accepted
Assuming that the question is the following - Is there a polynomial $P(x)$ such that for any integer $n$, $P(n)$ is not prime? - yes, there are very simple examples: $P(x)=4x$ or $P(x)=x^2$ would both do the job.
answered Jul 18 at 9:44
archipelagic
1083
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
0
down vote
accepted
Assuming that the question is the following - Is there a polynomial $P(x)$ such that for any integer $n$, $P(n)$ is not prime? - yes, there are very simple examples: $P(x)=4x$ or $P(x)=x^2$ would both do the job.
answered Jul 18 at 9:44
archipelagic
1083
add a comment |Â
up vote
0
down vote
accepted
Assuming that the question is the following - Is there a polynomial $P(x)$ such that for any integer $n$, $P(n)$ is not prime? - yes, there are very simple examples: $P(x)=4x$ or $P(x)=x^2$ would both do the job.
answered Jul 18 at 9:44
archipelagic
1083
add a comment |Â
up vote
0
down vote
accepted
up vote
0
down vote
accepted
Assuming that the question is the following - Is there a polynomial $P(x)$ such that for any integer $n$, $P(n)$ is not prime? - yes, there are very simple examples: $P(x)=4x$ or $P(x)=x^2$ would both do the job.
answered Jul 18 at 9:44
archipelagic
1083
Assuming that the question is the following - Is there a polynomial $P(x)$ such that for any integer $n$, $P(n)$ is not prime? - yes, there are very simple examples: $P(x)=4x$ or $P(x)=x^2$ would both do the job.
answered Jul 18 at 9:44
archipelagic
1083
answered Jul 18 at 9:44
archipelagic
1083
answered Jul 18 at 9:44
archipelagic
1083
answered Jul 18 at 9:44
archipelagic
1083
1083
add a comment |Â
add a comment |Â
What is the purpose of $m$? Do ask if for each $n$ there exists a polynomial $P$ such that $P(n)$ is not prime or if there exists a polynomial $P$ such that $P(n)$ is not prime for all $n$?
– Paul Frost
Jul 18 at 9:18
it has no purpose it is extra
– Demir Eken
Jul 18 at 9:22
$p(x) = x^2$ never produces prime numbers.
– Paul Frost
Jul 18 at 9:25