Skip to main content
Became Hot Network Question
added 13 characters in body
Source Link

I would like to ask the following question:

Is it possible to find two non-constant polynomials $p(x), q(x)$ with integer coefficients, such that $\gcd(p(n), q(m))=1$ for every $(n, m)\in \mathbb{N}^2$?

If such $p(x), q(x)$ exist, we will call them "completely" coprime, since all of their values will be coprime.
Obviously $p(x), q(x)$ must not have the same root, but this does not seem to help. The problem seems to be quite simple and I suspect that the answer is no, but I was unable to prove this.

I would like to ask the following question:

Is it possible to find two polynomials $p(x), q(x)$ with integer coefficients, such that $\gcd(p(n), q(m))=1$ for every $(n, m)\in \mathbb{N}^2$?

If such $p(x), q(x)$ exist, we will call them "completely" coprime, since all of their values will be coprime.
Obviously $p(x), q(x)$ must not have the same root, but this does not seem to help. The problem seems to be quite simple and I suspect that the answer is no, but I was unable to prove this.

I would like to ask the following question:

Is it possible to find two non-constant polynomials $p(x), q(x)$ with integer coefficients, such that $\gcd(p(n), q(m))=1$ for every $(n, m)\in \mathbb{N}^2$?

If such $p(x), q(x)$ exist, we will call them "completely" coprime, since all of their values will be coprime.
Obviously $p(x), q(x)$ must not have the same root, but this does not seem to help. The problem seems to be quite simple and I suspect that the answer is no, but I was unable to prove this.

Source Link

Two polynomials which are "completely" coprime

I would like to ask the following question:

Is it possible to find two polynomials $p(x), q(x)$ with integer coefficients, such that $\gcd(p(n), q(m))=1$ for every $(n, m)\in \mathbb{N}^2$?

If such $p(x), q(x)$ exist, we will call them "completely" coprime, since all of their values will be coprime.
Obviously $p(x), q(x)$ must not have the same root, but this does not seem to help. The problem seems to be quite simple and I suspect that the answer is no, but I was unable to prove this.