Polynomial products modulo primes and applications
From MaRDI portal
Publication:2297587
Abstract: For any polynomial we study arithmetic dynamical systems generated by We apply this to improve the lower bound on the number of distinct quadratic fields of the form in short intervals previously due to Cilleruelo, Luca, Quir'{o}s and Shparlinski. As a second application, we estimate the average number of missing values of for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and others.
Recommendations
- Primes, products and polynomials
- On polynomials with roots modulo almost all primes
- Polynomials and Primes in Generalized Arithmetic Progressions
- scientific article; zbMATH DE number 1281911
- Suborder polynomials modulo primes
- Factoring polynomials modulo special primes
- Polynomial products by means of generalized number theoretic transforms
- Multiplicative polynomials and Fermat's little theorem for non-primes
- Roots of polynomials modulo prime powers
- Iterations of integer polynomial maps modulo primes
Cites work
- scientific article; zbMATH DE number 1703931 (Why is no real title available?)
- scientific article; zbMATH DE number 5846313 (Why is no real title available?)
- scientific article; zbMATH DE number 4162985 (Why is no real title available?)
- scientific article; zbMATH DE number 5711496 (Why is no real title available?)
- scientific article; zbMATH DE number 3563269 (Why is no real title available?)
- scientific article; zbMATH DE number 1471385 (Why is no real title available?)
- scientific article; zbMATH DE number 2195395 (Why is no real title available?)
- A note on \(n!\) modulo \(p\)
- A note on the products \((1^\mu +1)(2^\mu +1)\dots (n^\mu +1)\)
- Criteria for the irreducibility of polynomials
- Distribution of factorials modulo \(p\)
- Dynamical systems of non-algebraic origin: fixed points and orbit lengths
- Irreducibility criteria of Schur-type and Pólya-type
- Neither (4k 2 + 1) nor (2k(k – 1) + 1) is a Perfect Square
- On squares in polynomial products
- On the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = byl
- On the diophantine equation $n(n+1)...(n+k-1) = bx^l$
- On the products \((1^\ell +1)(2^\ell +1)\cdots (n^\ell +1)\)
- Perfect powers from products of consecutive terms in arithmetic progression
- Permutations in Abelian groups and the sequence \(n!\pmod p\).
- Powerful numbers in \((1^k +1)(2^k+1) \cdots (n^k +1)\)
- Powers in \(\prod_{k=1}^n (ak^{2^l\cdot3^m}+b)\)
- Some effective cases of the Brauer-Siegel theorem
- Squares in \((1^2 + m^2) \dots (n^2 + m^2)\)
- Squares in \((1^2+1)\dots(n^2+1)\)
- Sur un problème de M. Erdős
- Sur une question d'Erdős et Schinzel. II. (On a question of Erdős and Schinzel. II)
- The equation n(n+d) ⋅⋅⋅(n+(k-1)d)=by2with ω(d)≤6 or d≤1010
- The product of consecutive integers is never a power
Cited in
(6)- Primes, products and polynomials
- Algorithm for studying polynomial maps and reductions modulo prime number
- Multiplicative polynomials and Fermat's little theorem for non-primes
- Power values of certain quadratic polynomials
- Results on multiples of primitive polynomials and their products over GF(2)
- On squares in polynomial products
This page was built for publication: Polynomial products modulo primes and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297587)