On the least common multiple of polynomial sequences at prime arguments
From MaRDI portal
Publication:5865459
DOI10.1142/S1793042122500622zbMath1498.11196arXiv2106.06782OpenAlexW3172296006WikidataQ114071838 ScholiaQ114071838MaRDI QIDQ5865459
Publication date: 9 June 2022
Published in: International Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.06782
Primes represented by polynomials; other multiplicative structures of polynomial values (11N32) Primes (11A41)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Uniform lower bound for the least common multiple of a polynomial sequence
- Quadratic polynomials at prime arguments
- Théorème de Brun-Titchmarsh; application au théorème de Fermat
- The least common multiple of a sequence of products of linear polynomials
- Arithmetic exponent pairs for algebraic trace functions and applications
- An improved bound on the least common multiple of polynomial sequences
- The large sieve
- A lower bound on the LCM of polynomial sequences
- The least common multiple of a quadratic sequence
- On the number of primes p for which p+a has a large prime factor
- On the Brun-Titchmarsh theorem
- On shifted primes with large prime factors and their products