Polynomial products modulo primes and applications

DOI10.1007/S00605-019-01359-6zbMATH Open1446.11030arXiv1810.06310OpenAlexW2996882382WikidataQ126411838 ScholiaQ126411838MaRDI QIDQ2297587FDOQ2297587

Oleksiy Klurman, Marc Munsch

Publication date: 20 February 2020

Published in: Monatshefte für Mathematik (Search for Journal in Brave)

Abstract: For any polynomial $P(x)inmathbbZ[x],$ we study arithmetic dynamical systems generated by $displaystyle{F}_P(n)=pro{d}_{klen}P(n)(extmodp),$ $nge1.$ We apply this to improve the lower bound on the number of distinct quadratic fields of the form $mathbbQ(sqrt{F}_P(n))$ in short intervals $MlenleM+H$ previously due to Cilleruelo, Luca, Quir'{o}s and Shparlinski. As a second application, we estimate the average number of missing values of $F_P(n)(extmodp)$ for special families of polynomials, generalizing previous work of Banks, Garaev, Luca, Schinzel, Shparlinski and others.

Full work available at URL: https://arxiv.org/abs/1810.06310

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

zbMATH Keywords

Diophantine equationsperfect powerspolynomialsdistribution of sequences modulo \(p\)dynamical system modulo \(p\)prime ideals of number fields

Mathematics Subject Classification ID

Sequences (mod (m)) (11B50) Polynomials (irreducibility, etc.) (11R09) Quadratic extensions (11R11) Counting solutions of Diophantine equations (11D45) Distribution of prime ideals (11R44)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The product of consecutive integers is never a power
• Perfect powers from products of consecutive terms in arithmetic progression
• On the diophantine equation $n(n+1)...(n+k-1) = bx^l$
• On the Diophantine Equation n(n + d) · · · (n + (k − 1)d) = by^l
• The equation n(n+d) ⋅⋅⋅(n+(k-1)d)=by²with ω(d)≤6 or d≤10¹⁰
• Some effective cases of the Brauer-Siegel theorem
• Squares in \((1^2+1)\dots(n^2+1)\)
• A note on the products \((1^\mu +1)(2^\mu +1)\dots (n^\mu +1)\)
• On the products \((1^\ell +1)(2^\ell +1)\cdots (n^\ell +1)\)
• Neither (4k 2 + 1) nor (2k(k – 1) + 1) is a Perfect Square
• Powerful numbers in \((1^k +1)(2^k+1) \cdots (n^k +1)\)
• Irreducibility criteria of Schur-type and Pólya-type
• Distribution of factorials modulo \(p\)
• Title not available (Why is that?)
• A note on \(n!\) modulo \(p\)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Criteria for the irreducibility of polynomials
• On squares in polynomial products
• 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)
• Permutations in Abelian groups and the sequence \(n!\pmod p\).
• Title not available (Why is that?)
• Squares in (12 + m 2) ⋯ (n 2 + m 2)
• Powers in \(\prod_{k=1}^n (ak^{2^l\cdot3^m}+b)\)
• Title not available (Why is that?)
• Dynamical systems of non-algebraic origin: fixed points and orbit lengths

Cited In (4)

• Primes, products and polynomials
• Algorithm for studying polynomial maps and reductions modulo prime number
• Results on multiples of primitive polynomials and their products over GF(2)
• Multiplicative polynomials and Fermat's little theorem for non-primes

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)