Computational experiences on the distances of polynomials to irreducible polynomials

DOI10.1090/S0025-5718-97-00801-6zbMath0854.11014MaRDI QIDQ5691019

Lajos Hajdu, Attila Bérczes

Publication date: 9 January 1997

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

monic polynomialsproblem of Turandistance to irreducible polynomials

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Polynomials over finite fields (11T06) Polynomials (irreducibility, etc.) (11R09) Computational number theory (11Y99)

Related Items (6)

The distance to an irreducible polynomial, II ⋮ On an application of the $abc$-theorem for polynomials to the squarefree neighbour problem ⋮ Covering systems with large moduli associated with reducible shifts of integer polynomials ⋮ The distance to square-free polynomials ⋮ On the nearest irreducible lacunary neighbour to an integer polynomial ⋮ The distance to a squarefree polynomial over $\mathbb F_2[x$]

This page was built for publication: Computational experiences on the distances of polynomials to irreducible polynomials