Polynomials with factors of the form ( x q – a ) with roots modulo every integer

DOI10.1080/00927872.2024.2362332MaRDI QIDQ6600758

Bhawesh Mishra

Publication date: 10 September 2024

Published in: Communications in Algebra (Search for Journal in Brave)

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Congruences; primitive roots; residue systems (11A07)

Cites Work

• Title not available (Why is that?)
• Intersective polynomials and the polynomial Szemerédi theorem
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Van der Corput's difference theorem
• Covering Numbers in Linear Algebra
• On difference sets of sequences of integers. I
• On difference sets of sequences of integers. III
• Elementary Number Theory
• Polynomials Consisting of Quadratic Factors with Roots Modulo Any Positive Integer
• Products of quadratic polynomials with roots modulo any integer

This page was built for publication: Polynomials with factors of the form ( x ^q – a ) with roots modulo every integer

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