scientific article; zbMATH DE number 1182952

MaRDI QIDQ3837784zbMATH OpenFDO

Authors Attila Bérczes, Lajos Hajdu

Publication date 26 May 1999

zbMATH Keywords

irreducible polynomialsTurán problem

Mathematics Subject Classification ID

Polynomials in number theory (11C08)

Recommendations

• The distance to an irreducible polynomial. II
• Is every polynomial with integer coefficients near an irreducible polynomial?
• On the irreducibility of neighbouring polynomials
• On a polynomial conjecture of Pál Turán

Cited in

(12)

• Is every polynomial with integer coefficients near an irreducible polynomial?
• The distance to an irreducible polynomial. II
• On a polynomial conjecture of Pál Turán
• The number of non-zero coefficients of a polynomial -- solved and unsolved problems
• Norms of factors of polynomials
• The distance to square-free polynomials
• Combinatorial computations on an extension of a problem by Pál Turán
• On an application of the abc-theorem for polynomials to the squarefree neighbour problem
• On the nearest irreducible lacunary neighbour to an integer polynomial
• Covering systems with large moduli associated with reducible shifts of integer polynomials
• Towards Turán's polynomial conjecture
• The Brun-Hooley sieve for \(\mathbb{F}_2[X]\) and squarefree shifts of integer polynomials

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3837784)