Question

Upper bounds for the number of factors of a polynomial over $\mathbb{Z}$

score 91 · Answer 1 · 2019-09-02 21:50:13

91

Views

Upper bounds for the number of factors of a polynomial over $\mathbb{Z}$

Published on 02 Sep 2019 - 21:50

score 245 · Answer 2 · 2019-09-05 05:10:42

245

Views

Irreducible polynomial over rationals with exactly two complex roots

Published on 05 Sep 2019 - 5:10

score 128 · Answer 3 · 2026-03-25 16:46:33

128

Views

Is $\bar{x}$ a primitive element in $\mathbb{F}_p[x]/(P(x))$

Published on 25 Mar 2026 - 16:46

score 700 · Answer 4 · 2019-09-09 21:35:28

700

Views

$X^5 + 1$ into irreducible factors over $\mathbb{Q}$ and $\mathbb{Z}_5$

Published on 09 Sep 2019 - 21:35

score 99 · Answer 5 · 2026-03-25 07:43:01

99

Views

Possible to identify a quadratic polynomial using only $\sigma_0(f(x))$?

Published on 25 Mar 2026 - 7:43

score 20 · Answer 6 · 2019-09-13 11:46:43

20

Views

Maximum number of factors in a relatively coprime sequence?

Published on 13 Sep 2019 - 11:46

score 36 · Answer 7 · 2026-03-25 23:37:21

36

Views

Irreducibility of the polynomial

Published on 25 Mar 2026 - 23:37

score 37 · Answer 8 · 2019-09-14 11:11:57

37

Views

For which rings $R$ can the number of irreducible factors of degree at least one of $f\in R[X]$ be bounded in terms of $\deg f$?

Published on 14 Sep 2019 - 11:11

score 104 · Answer 9 · 2019-09-14 14:39:13

104

Views

Proof for irreducibility of $x^p - x + a$ over $\mathbb{GF}(p)$

Published on 14 Sep 2019 - 14:39

score 82 · Answer 10 · 2026-03-25 17:26:09

82

Views

Irreducibility criterions for polynomials over $\mathbb{Z}$ or $\mathbb{Q}$

Published on 25 Mar 2026 - 17:26

score 64 · Answer 11 · 2019-09-19 17:39:47

64

Views

Being $f,g\in k[x,y]$ irreducible polynomials, there is $a,b\in k[x,y]$ and $c(x)\neq 0$ s.t. $af+bg=c(x)$

Published on 19 Sep 2019 - 17:39

score 114 · Answer 12 · 2019-09-20 06:51:44

114

Views

Finding $f\in\mathbb{Q}[x]$ such that $f(\sqrt{2}+\sqrt{3})=\sqrt{2}$ and $\deg(f)\leq 3$. What's wrong with my approach?

Published on 20 Sep 2019 - 6:51

score 186 · Answer 13 · 2026-03-27 03:19:02

186

Views

Eisenstein criteria in k(t)[X]

Published on 27 Mar 2026 - 3:19

score 40 · Answer 14 · 2019-09-24 15:04:28

40

Views

Prove the factorization of a polynomial over $(\Bbb Z/p\Bbb Z)[X]$

Published on 24 Sep 2019 - 15:04

score 993 · Answer 15 · 2019-09-25 20:19:29

993

Views

Prove that the polynomial $p(x) = x^4 - 5x^3 + 3x - 2$ is irreducible over $\Bbb Q[X]$

Published on 25 Sep 2019 - 20:19

List Question

Upper bounds for the number of factors of a polynomial over $\mathbb{Z}$

Irreducible polynomial over rationals with exactly two complex roots

Is $\bar{x}$ a primitive element in $\mathbb{F}_p[x]/(P(x))$

$X^5 + 1$ into irreducible factors over $\mathbb{Q}$ and $\mathbb{Z}_5$

Possible to identify a quadratic polynomial using only $\sigma_0(f(x))$?

Maximum number of factors in a relatively coprime sequence?

Irreducibility of the polynomial

For which rings $R$ can the number of irreducible factors of degree at least one of $f\in R[X]$ be bounded in terms of $\deg f$?

Proof for irreducibility of $x^p - x + a$ over $\mathbb{GF}(p)$

Irreducibility criterions for polynomials over $\mathbb{Z}$ or $\mathbb{Q}$

Being $f,g\in k[x,y]$ irreducible polynomials, there is $a,b\in k[x,y]$ and $c(x)\neq 0$ s.t. $af+bg=c(x)$

Finding $f\in\mathbb{Q}[x]$ such that $f(\sqrt{2}+\sqrt{3})=\sqrt{2}$ and $\deg(f)\leq 3$. What's wrong with my approach?

Eisenstein criteria in k(t)[X]

Prove the factorization of a polynomial over $(\Bbb Z/p\Bbb Z)[X]$

Prove that the polynomial $p(x) = x^4 - 5x^3 + 3x - 2$ is irreducible over $\Bbb Q[X]$

Trending Questions

Popular # Hahtags

Popular Questions