Covering systems with large moduli associated with reducible shifts of integer polynomials
From MaRDI portal
(Redirected from Publication:6136603)
Recommendations
- On the nearest irreducible lacunary neighbour to an integer polynomial
- scientific article; zbMATH DE number 1995865
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- Is every polynomial with integer coefficients near an irreducible polynomial?
- A polynomial investigation inspired by work of Schinzel and Sierpiński
Cites work
- A covering system whose smallest modulus is 40
- Approximate formulas for some functions of prime numbers
- Computational experiences on the distances of polynomials to irreducible polynomials
- Erdős covering systems
- scientific article; zbMATH DE number 2186395 (Why is no real title available?)
- scientific article; zbMATH DE number 1182952 (Why is no real title available?)
- scientific article; zbMATH DE number 1995865 (Why is no real title available?)
- scientific article; zbMATH DE number 7640035 (Why is no real title available?)
- On a polynomial conjecture of Pál Turán
- On an irreducibility theorem of A. Schinzel associated with coverings of the integers
- On the irreducibility of neighbouring polynomials
- On the nearest irreducible lacunary neighbour to an integer polynomial
- Reducibility of lacunary polynomials II
- Reducibility of polynomials and covering systems of congruences
- Sieving by large integers and covering systems of congruences
- Solution of the minimum modulus problem for covering systems
- The distance to an irreducible polynomial. II
- The Erdős-Selfridge problem with square-free moduli
- Unsolved problems in number theory
Cited in
(2)
This page was built for publication: Covering systems with large moduli associated with reducible shifts of integer polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6136603)
