Polynomials with roots modulo every integer
From MaRDI portal
Publication:4890219
Recommendations
- Integer polynomials with roots mod \(p\) for all primes \(p\)
- Polynomials with roots mod \(p\) for all primes \(p\)
- Polynomials consisting of quadratic factors with roots modulo any positive integer
- Roots of polynomials modulo prime powers
- Irreducible polynomials with many roots of equal modulus
- Polynomials with a root close to an integer
- Polynomials with values which are powers of integers.
- On polynomials with roots modulo almost all primes
- Root sets of polynomials modulo prime powers
Cites work
- scientific article; zbMATH DE number 3650682 (Why is no real title available?)
- scientific article; zbMATH DE number 4051754 (Why is no real title available?)
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 47154 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 3440485 (Why is no real title available?)
- scientific article; zbMATH DE number 3233758 (Why is no real title available?)
- scientific article; zbMATH DE number 3349977 (Why is no real title available?)
- A bound for the least prime ideal in the Chebotarev density theorem
- Construction and estimation of bases in function fields
- Die Primteilerdichte von ganzzahligen Polynomen.
- Die Primteilerdichte von ganzzahligen Polynomen. I.
- Die Primteilerdichte von ganzzahligen Polynomen. III.
- Explicit Bounds for Primality Testing and Related Problems
- On difference sets of sequences of integers. I
- On difference sets of sequences of integers. III
- On polynomial-factorial diophantine equations
- On the equation \(P(x)=n!\) and a question of Erdős
- Sets of primes determined by systems of polynomial congruences
- Solving diophantine problems modulo every prime
- Solving diophantine problems over all residue class fields of a number field and all finite fields
- Unsolved problems in number theory
- Van der Corput's difference theorem
Cited in
(30)- Polynomials over ring of integers of global fields that have roots modulo every finite indexed subgroup
- Polynomials with roots in ℚ_{𝕡} for all 𝕡
- Geometry and arithmetic of verbal dynamical systems on simple groups (with an appendix by Nathan Jones)
- Normal coverings of finite symmetric and alternating groups.
- On a generalization of the recurrence defining the number of derangements
- The Classification of Integral Domains in Which the Relation of Being an Ideal Is Transitive
- A statistical relation of roots of a polynomial in different local fields. III
- Intersective polynomials and the polynomial Szemerédi theorem
- Intersective polynomials arising from sums of powers
- Polynomials with factors of the form ( x q – a ) with roots modulo every integer
- scientific article; zbMATH DE number 7561763 (Why is no real title available?)
- Galois groups over rational function fields and explicit Hilbert irreducibility
- On polynomials with roots modulo almost all primes
- Integer polynomials with roots mod \(p\) for all primes \(p\)
- Two remarks on the inverse Galois problem for intersective polynomials
- Multiple ergodic averages for three polynomials and applications
- scientific article; zbMATH DE number 3192085 (Why is no real title available?)
- On polynomial-factorial diophantine equations
- Minimally intersective polynomials with arbitrarily long factorization
- Problems and Results on Intersective Sets
- Squarefree parts of polynomial values
- Intersective polynomials and Diophantine approximation. II
- On squares in polynomial products
- Finite primitive permutation groups containing a permutation having at most four cycles
- On Galois realizations of the 2-coverable symmetric and alternating groups
- Polynomials consisting of quadratic factors with roots modulo any positive integer
- Compositions of n satisfying some coprimality conditions
- Polynomials with roots mod \(p\) for all primes \(p\)
- Intersective polynomials and the primes
- On the arithmetic of polynomials with coefficients in Mordell-Weil type groups
This page was built for publication: Polynomials with roots modulo every integer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4890219)
