Skip to main content
deleted 9 characters in body
Source Link
Stanley Yao Xiao
  • 26.9k
  • 7
  • 49
  • 143

My question concerns the sums of two reducible polynomials with bounded coefficients. In particular, for every $d \geq 2$ does there exist an absolute constanta number $C > 0$$C(d) > 0$ such that for any two nonco-proportionalprime reducible polynomials $f,g \in \mathbb{Z}[x]$ of the same degree $d \geq 2$$d$ there exist integers $u,v$ such that $|u|, |v| \leq C$$|u|, |v| \leq C(d)$ and $uf(x) + vg(x)$ is irreducible?

My question concerns the sums of two reducible polynomials with bounded coefficients. In particular, does there exist an absolute constant $C > 0$ such that for any two non-proportional reducible polynomials $f,g \in \mathbb{Z}[x]$ of the same degree $d \geq 2$ there exist integers $u,v$ such that $|u|, |v| \leq C$ and $uf(x) + vg(x)$ is irreducible?

My question concerns the sums of two reducible polynomials with bounded coefficients. In particular, for every $d \geq 2$ does there exist a number $C(d) > 0$ such that for any two co-prime reducible polynomials $f,g \in \mathbb{Z}[x]$ of degree $d$ there exist integers $u,v$ such that $|u|, |v| \leq C(d)$ and $uf(x) + vg(x)$ is irreducible?

Source Link
Stanley Yao Xiao
  • 26.9k
  • 7
  • 49
  • 143

Linear combinations of reducible polynomials

My question concerns the sums of two reducible polynomials with bounded coefficients. In particular, does there exist an absolute constant $C > 0$ such that for any two non-proportional reducible polynomials $f,g \in \mathbb{Z}[x]$ of the same degree $d \geq 2$ there exist integers $u,v$ such that $|u|, |v| \leq C$ and $uf(x) + vg(x)$ is irreducible?