On the least common multiple of polynomial sequences at prime arguments

DOI10.1142/S1793042122500622MaRDI QIDQ5865459zbMATH OpenOpenAlexWikidataFDO

Authors Ayan Nath, Abhishek Jha

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

zbMATH Keywords

primespolynomialgreatest prime divisorleast common multiple

Mathematics Subject Classification ID

Primes (11A41) Primes represented by polynomials; other multiplicative structures of polynomial values (11N32)

Abstract: Cilleruelo conjectured that if $finmathbbZ[x]$ is an irreducible polynomial of degree $dge2$ then, $logoperatornamelcmf(n)midn<xsim(d-1)xlogx.$ In this article, we investigate the analogue of prime arguments, namely, $operatornamelcmf(p)midp<x$ where $p$ denotes a prime and obtain non-trivial lower bounds on it. Further, we also show some results regarding the greatest prime divisor of $f(p).$

Recommendations

• A lower bound on the least common multiple of polynomial sequences
• An improved bound on the least common multiple of polynomial sequences
• Least common multiple of polynomial sequences
• On Cilleruelo's conjecture for the least common multiple of polynomial sequences
• The least common multiple of a quadratic sequence

Cites work

• A lower bound on the least common multiple of polynomial sequences
• An improved bound on the least common multiple of polynomial sequences
• Arithmetic exponent pairs for algebraic trace functions and applications
• Least common multiple of polynomial sequences
• Lectures on \(N_X(p)\)
• On shifted primes with large prime factors and their products
• On the Brun-Titchmarsh theorem
• On the number of primes p for which p+a has a large prime factor
• Prime-detecting sieves
• Quadratic polynomials at prime arguments
• The large sieve
• The least common multiple of a quadratic sequence
• The least common multiple of a sequence of products of linear polynomials
• Théorème de Brun-Titchmarsh; application au théorème de Fermat
• Uniform lower bound for the least common multiple of a polynomial sequence

Cited in

(9)

• scientific article; zbMATH DE number 5525675 (Why is no real title available?)
• On the least common multiple of shifted powers
• On the number of divisors of the least common multiples of shifted prime powers
• A lower bound on the least common multiple of polynomial sequences
• On Cilleruelo's conjecture for the least common multiple of polynomial sequences
• An improved bound on the least common multiple of polynomial sequences
• On the use of the least common multiple to build a prime-generating recurrence
• Almost-prime polynomials at prime arguments
• Uniform lower bound for the least common multiple of a polynomial sequence

This page was built for publication: On the least common multiple of polynomial sequences at prime arguments

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