2017
DOI: 10.1016/j.ffa.2017.05.006
|View full text |Cite
|
Sign up to set email alerts
|

Counting perfect polynomials

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 7 publications
(18 citation statements)
references
References 7 publications
0
17
0
Order By: Relevance
“…While for any, say T , of the trivial even perfect binary polynomials, with deg(T ) > 2, T + 1 is always reducible (indeed, it has x 2 + x + 1 as a prime factor). Moreover, from computations in [3] it is known that the conjecture holds when deg(R) ≤ 200.…”
Section: Our Conjecture Ismentioning
confidence: 99%
See 3 more Smart Citations
“…While for any, say T , of the trivial even perfect binary polynomials, with deg(T ) > 2, T + 1 is always reducible (indeed, it has x 2 + x + 1 as a prime factor). Moreover, from computations in [3] it is known that the conjecture holds when deg(R) ≤ 200.…”
Section: Our Conjecture Ismentioning
confidence: 99%
“…2 n −1 where [6,7,8,9,10], Cengiz et al [3]. On the other hand, the polynomial ABC-theorem, i.e., Mason-Stothers theorem (see [11, pp.…”
Section: Canaday Found the Infinite Family Of Even Perfect Polynomialmentioning
confidence: 99%
See 2 more Smart Citations
“…There is no other perfect polynomial A with ω(A) < 5 (see [4,5,6]). Recently, Cengiz et al [3] proved by extensive computations that there is no other perfect polynomial A with deg(A) ≤ 200.…”
Section: Introductionmentioning
confidence: 99%