Related papers: Somewhat smooth numbers in short intervals

The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…

In this work we show that based on a conjecture for the pair correlation of integers representable as sums of two squares, which was first suggested by Connors and Keating and reformulated here, the second moment of the distribution of the…

We introduce a variant of the large sieve and give an example of its use in a sieving problem. Take the interval [N] = {1,...,N} and, for each odd prime p <= N^{1/2}, remove or ``sieve out'' by all n whose reduction mod p lies in some…

We introduce a method to estimate sums of oscillating functions on finite abelian groups over intervals or (generalized) arithmetic progressions, when the size of the interval is such that the completing techniques of Fourier analysis are…

The interval numbers is the set of compact intervals of $\mathbb{R}$ with addition and multiplication operation, which are very useful for solving calculations where there are intervals of error or uncertainty, however, it lacks an…

We obtain new mean value theorems for exponential sums with very smooth numbers, which provide a power saving against the trivial bound in region where previous bounds do not apply.

This paper is concerned with the relationship of $y$-smooth integers and de Bruijn's approximation $\Lambda(x,y)$. Under the Riemann hypothesis, Saias proved that the count of $y$-smooth integers up to $x$, $\Psi(x,y)$, is asymptotic to…

We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992).…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

We prove Bombieri--Vinogradov and Barban--Davenport--Halberstam type theorems for the y-smooth numbers less than x, on the range log^{K}x \leq y \leq x. This improves on the range \exp{log^{2/3 + \epsilon}x} \leq y \leq x that was…

A numerical procedure and its MAPLE implementation capable of rigorously, albeit in a brute-force manner, proving specific strict one-variable inequalities in specific finite intervals is described. The procedure is useful, for instance, to…

We obtain new bounds of exponential sums modulo a prime $p$ with sparse polynomials $a_0x^{n_0} + \cdots + a_{\nu}x^{n_\nu}$. The bounds depend on various greatest common divisors of exponents $n_0, \ldots, n_\nu$ and their differences. In…

In this paper, we develop a method of evaluating general exponential sums with rational amplitude functions for multiple variables which complements works by T. Cochrane and Z. Zheng on the single variable case. As an application, for…

Let $s$, $\ell$ be two integers such that $2\le s\le \ell-1$, $\ell\ge 3$. We prove that a suitable asymptotic formula for the average number of representations of integers $n=\sum_{i=1}^{s} p_{i}^{\ell}$, where $p_i$, $i=1,\dotsc,s$, are…

When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…

We generalise Zhang's and Pintz recent results on bounded prime gaps to give a lower bound for the the number of prime pairs bounded by 6*10^7 in the short interval $[x,x+x (\log x)^{-A}]$. Our result follows only by analysing Zhang's proof…

We prove an analogue of the Prime Number Theorem for short intervals on a smooth projective geometrically irreducible curve of arbitrary genus over a finite field. A short interval "of size E" in this setting is any additive translate of…

We show that the $Kn$--smooth part of $a^n-1$ for an integer $a>1$ is $a^{o(n)}$ for most positive integers $n$.

This note corrects the paper \cite{ex}, where lattice sequences having exponentially large kissing numbers were constructed. However it was noted in \cite{dif} that the arguments in that paper are not sufficient. Here we correct the…

In this paper we introduce the notion of the $P$-sequences and apply their properties in studying representability of real numbers. Another application of $P$-sequences we find in generating the Prouhet-Tarry-Escott pairs.