English
Related papers

Related papers: On the Least Common Multiple of Polynomial Sequenc…

200 papers

Let $f$ be a polynomial $f$ of degree $d\ge 2$ with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the values of the polynomial at the first $N$ integers satisfies…

Number Theory · Mathematics 2020-01-29 James Maynard , Zeev Rudnick

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$ one has $$\log\left[\mathrm{lcm}(f(1),f(2),\ldots f(N))\right]\sim(d-1)N\log N$$ as $N \to \infty$. He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-01-07 Alexei Entin , Sean Landsberg

Cilleruelo conjectured that if $f\in\mathbb{Z}[x]$ of degree $d\ge 2$ is irreducible over the rationals, then $\log\operatorname{lcm}(f(1),\ldots,f(N))\sim(d-1)N\log N$ as $N\to\infty$. He proved it for the case $d = 2$. Very recently,…

Number Theory · Mathematics 2019-11-06 Ashwin Sah

Cilleruelo conjectured that for an irreducible polynomial $f \in \mathbb{Z}[X]$ of degree $d \geq 2$, denoting $$L_f(N)=\mathrm{lcm}(f(1),f(2),\ldots f(N))$$ one has $$\log L_f(n)\sim(d-1)N\log N.$$ He proved it in the case $d=2$ but it…

Number Theory · Mathematics 2025-09-18 Alexei Entin

A conjecture due to Cilleruelo states that for an irreducible polynomial $f$ with integer coefficients of degree $d\geq 2$, the least common multiple $L_f(N)$ of the sequence $f(1), f(2), \dots, f(N)$ has asymptotic growth $\log L_f(N)\sim…

Number Theory · Mathematics 2019-04-16 Zeév Rudnick , Sa'ar Zehavi

We make progress on a conjecture of Cilleruelo on the growth of the least common multiple of consecutive values of an irreducible polynomial $f$ on the additional hypothesis that the polynomial be even. This strengthens earlier work of…

Number Theory · Mathematics 2024-01-12 Marc Technau

For $ f\in\mathbb{Z}[X] $ an irreducible polynomial of degree $ n $, the Cilleruelo's conjecture states that$$\log(\mbox{lcm}(f(1),\dots,f(M)))\sim(n-1)M\log M$$as $ M\rightarrow+\infty $, where $ \mbox{lcm}(f(1),\dots,f(M)) $ is the least…

Number Theory · Mathematics 2024-02-07 Ilaria Viglino

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

Number Theory · Mathematics 2017-05-17 A. J. Irving

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

Number Theory · Mathematics 2026-04-17 Alice Bazzanella , Carlo Sanna

Let $P(x) \in \mathbb{Z}[x]$ be a polynomial. We give an easy and new proof of the fact that the set of primes $p$ such that $p \mid P(n)$, for some $n \in \mathbb{Z}$, is infinite. We also get analog of this result for some special…

History and Overview · Mathematics 2022-02-03 Devendra Prasad

Let $f(x) = \sum\limits _{i=0}^{n} a_i x^i $ be a polynomial with coefficients from the ring $\mathbb{Z}$ of integers satisfying either $(i)$ $0 < a_0 \leq a_{1} \leq \cdots \leq a_{k-1} < a_{k} < a_{k+1} \leq \cdots \leq a_n$ for some $k$,…

Commutative Algebra · Mathematics 2016-12-07 Anuj Jakhar , Neeraj Sangwan

Let $g(x)$ be a fixed non-constant complex polynomial. It was conjectured by Schinzel that if $g(h(x))$ has boundedly many terms, then $h(x)\in \C[x]$ must also have boundedly many terms. Solving an older conjecture raised by R\'enyi and by…

Number Theory · Mathematics 2015-05-13 Umberto Zannier

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Number Theory · Mathematics 2018-09-05 Fusun Akman

We denote $\mathcal{P}$ = $\{P(x)|$ $P(n) \mid n!$ for infinitely many $n\}$. This article identifies some polynomials that belong to $\mathcal{P}$. Additionally, we also denote $P^+(m)$ as the largest prime factor of $m$. Then, a…

Number Theory · Mathematics 2025-03-12 Thanh Nguyen Cung , Son Duong Hong

For a polynomial $f(x)\in\mathbb Z[x]$ without non-trivial linear relations among roots, we propose a conjecture on the distribution of the least root $r_p$ ($r_p\in\mathbb Z,\,0\le r_p<p)$ of $f(x)\equiv0\bmod p$ where $p$ runs over the…

Number Theory · Mathematics 2017-06-13 Yoshiyuki Kitaoka

For a function field $K$ and fixed polynomial $F\in K[x]$ and varying $f\in F$ (under certain restrictions) we give a lower bound for the degree of the greatest prime divisor of $F(f)$ in terms of the height of $f$, establishing a strong…

Number Theory · Mathematics 2013-08-15 Alexei Entin

A number of authors have proven explicit versions of Lehmer's conjecture for polynomials whose coefficients are all congruent to 1 modulo m. We prove a similar result for polynomials f(X) that are divisible in (Z/mZ)[X] by a polynomial of…

Number Theory · Mathematics 2010-08-24 Joseph H. Silverman

We consider polynomials of the form t^n-1 and determine when members of this family have a divisor of every degree in Z[t]. With F(x) defined to be the number of such integers up to x, we prove the existence of two positive constants c_1…

Number Theory · Mathematics 2011-11-24 Lola Thompson

Given a separable nonconstant polynomial $f(x)$ with integer coefficients, we consider the set $S$ consisting of the squarefree parts of all the rational values of $f(x)$, and study its behavior modulo primes. Fixing a prime $p$, we…

Number Theory · Mathematics 2014-07-21 David Krumm

We consider a certain left action by the monoid $SL_2(\mathbf{N}_0)$ on the set of divisor pairs $\mathcal{D}_f := \{ (m, n) \in \mathbf{N}_0 \times \mathbf{N}_0 : m \lvert f(n) \}$ where $f \in \mathbf{Z}[x]$ is a polynomial with integer…

Number Theory · Mathematics 2024-05-07 Anton Shakov
‹ Prev 1 2 3 10 Next ›