We estimate the number of integers up to $x$ whose $y$-friable component exceeds $z$. Uniformly for $\max\{2,\log z\}\leqslant y\leqslant z\leqslant x/2$, we determine the logarithm of this counting function up to an error $O(\log z/\log y)$. This sharpens an estimate arising from a problem in Ford's sieve methods lecture notes. The proof combines classical friable-number estimates with an elementary argument for the lower bound.
We show that there exists $c>0$ such that any subset of $\{1,\ldots,N\}$ having size $\gg N / \exp( (\log\log\log N)^c )$ contains a nontrivial pattern of the form $x,x+y,x+2y,x+y^3$. It is the first configuration of complexity strictly greater than $0$, other than refinements of arithmetic progressions, for which quan...
Bartłomiej Bychawski, B. Głowacki, Ivan Spyrydonov· 0 citations
Let $q_n$ denote the $n$th product of two distinct primes. By completing a square in Sono's sieve and solving the resulting one-dimensional variational problem, we prove unconditionally that, for every $\varepsilon>0$ and all sufficiently large integers $\rho$, \[ \liminf_{n\to\infty}(q_{n+\rho}-q_n) \leq \exp\left((\p...
In this short note, we point out that the recent lower bounds for off-diagonal Ramsey numbers $r(s,t)$ with fixed $s\ge 5$, together with the recent proof of the Ajtai--Erd\H{o}s--Koml\'os--Szemer\'edi independence conjecture, imply \[ r(4,t)=\frac{t^3}{(\log t)^{2+o(1)}}. \] This note is solely for informal circulatio...
Let $S_{\chi}(N)= \sum_{n\leq N} \chi(n)$, where $\chi$ is a Dirichlet character modulo a prime $p$. For integral $r\geq 2$, Burgess gave bounds of the shape $S_{\chi}(N) \ll N^{1-1/r} p^{(r+1)/(4r^{2})} \log p$. The factor of $\log p$ was reduced by several authors. We show that it can be removed completely.
We prove that for any $s\ge 2$ and polynomials $f_{1}(x),\dots,f_{s-1}(x)\in \mathbb{R}[x]$ satisfying a certain equidistribution condition, the natural density of the numbers $n\in \mathbb{N}$ such that $n,\lfloor f_{1}(n)\rfloor,\dots,\lfloor f_{s-1}(n)\rfloor$ are mutually coprime is $1/\zeta(s)$. This generalises a...
For a positive integer $n\ge 2$, we look at the number of solutions of the Diophantine equation $$ n(x_1+\cdots+x_n)=x_1\cdots x_n. $$ Denoting by $f(n)$ this number we show that $\liminf_{n\to\infty} \log f(n)/\log n=0$.
F. Luca, I. Pink, Csaba Sándor· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.