2019
DOI: 10.26637/mjm0s01/0028
|View full text |Cite
|
Sign up to set email alerts
|

Irreducibility criterion for certain trinomials

Abstract: In this article we study the irreducibility of polynomials of the form x n + ǫ 1 x m + p k ǫ 2 , p being a prime number. We will show that they are irreducible for m = 1. We have also provided the cyclotomic factors and reducibility criterion for trinomials of the formThis corrects few of the existing results of W. Ljuggren's on x n + ǫ 1 x m + ǫ 2 .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 5 publications
0
5
0
Order By: Relevance
“…where n = 1, 2, 3..... Now from the requirement of solving the gauge hierarchy problem, the warp factor at TeV brane acquires the value as A(π) = 36 which produces a large suppression in the right hand side of eqn. (22) through the exponential factor. Since k, m 5 ∼ M , the mass of KK modes (n = 1, 2, 3..) comes at TeV scale.…”
Section: B Massive Kk Modementioning
confidence: 99%
See 2 more Smart Citations
“…where n = 1, 2, 3..... Now from the requirement of solving the gauge hierarchy problem, the warp factor at TeV brane acquires the value as A(π) = 36 which produces a large suppression in the right hand side of eqn. (22) through the exponential factor. Since k, m 5 ∼ M , the mass of KK modes (n = 1, 2, 3..) comes at TeV scale.…”
Section: B Massive Kk Modementioning
confidence: 99%
“…Moreover the mass squared gap (∆m 2 n = m 2 n+1 − m 2 n ) depends linearly on n which is also evident from the mass spectrum in eqn. (22).…”
Section: For Massive Kk Mode -mentioning
confidence: 99%
See 1 more Smart Citation
“…If k ≥ 2 and r = 0, then it is irreducible by Theorem 20. An alternate proof of this particular case can also be found in [65]. For k ≥ 2, r = 1, we will show that Theorem 21.…”
Section: Reducibility Of Xmentioning
confidence: 78%
“…One can check that Ljunggren's result is true only when ǫ 1 = ǫ 2 = 1. We corrected these errors in [65] and proved that…”
Section: Reducibility Of Xmentioning
confidence: 95%