Related papers: Somewhat smooth numbers in short intervals

An integer $n$ is called practical if every $m\le n$ can be written as a sum of distinct divisors of $n$. We show that the number of practical numbers below $x$ is asymptotic to $c x/\log x$, as conjectured by Margenstern. We also give an…

Given good knowledge on the even moments, we derive asymptotic formulas for $\lambda$-th moments of primes in short intervals and prove "equivalence" result on odd moments. We also provide numerical evidence in support of these results.

We prove a theorem about approximation to an irrational number by rational numbers whose denominator n is free of prime factors bigger than a power of log n. We strengthen the result in version 1 by using an exponential sum over smooth…

We give asymptotic estimates for the mean number of divisors of integers without small prime factors, integers with bounded ratios of consecutive divisors, and for practical numbers. In the last case, this confirms a conjecture of…

In this work, we develop Extraction Theorems for classes of geometric objects with small extraction numbers. These classes include intervals, axis-parallel segments, axis-parallel rays, and octants. We investigate these classes of objects…

We present the real interpolation with variable exponent and we prove the basic properties in analogy to the classical real interpolation. More precisely, we prove that under some additional conditions, this method can be reduced to the…

Let $E_k$ be the set of positive integers having exactly $k$ prime factors. We show that almost all intervals $[x,x+\log^{1+\varepsilon} x]$ contain $E_3$ numbers, and almost all intervals $[x,x+\log^{3.51} x]$ contain $E_2$ numbers. By…

We use short divisor sums to approximate prime tuples and moments for primes in short intervals. By connecting these results to classical moment problems we are able to prove that a positive proportion of consecutive primes are within a…

We prove that almost any pair of real numbers a,b, satisfies the following inhomogeneous uniform version of Littlewood's conjecture: (*) forall x,y in R, liminf_{|n|\to\infty} |n|<na - x> <nb - y> = 0, where <-> denotes the distance from…

In this paper, we study how short an interval $[x, x + x^\theta]$ contains an integer of the form $n_1 n_2 n_3$ and $m_1 m_2 m_3 m_4$ with $n_1 \approx n_2 \approx n_3$ and $m_1 \approx m_2 \approx m_3 \approx m_4$. The new idea is to adopt…

Let $\epsilon > 0$ be sufficiently small and let $0 < \eta < 1/522$. We show that if $X$ is large enough in terms of $\epsilon$ then for any squarefree integer $q \leq X^{196/261-\epsilon}$ that is $X^{\eta}$-smooth one can obtain an…

Let $k\ge 1$ be an integer. We prove that a suitable asymptotic formula for the average number of representations of integers $n=p_{1}^{k}+p_{2}^{2}+p_{3}^{2}$, where $p_1,p_2,p_3$ are prime numbers, holds in intervals shorter than the ones…

95 years ago Hoheisel proved the existence of primes in the sub-linear interval \[ \left[x, x+x^{1-{1\over 33000}}\right] \qquad \hbox{for $x$ sufficiently large}. \] This was improved by Heilbronn, proving existence of primes in the…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

An asymptotic formula is given for the number of y-smooth numbers up to x in a Beatty sequence corresponding to an irrational number of finite type.

We show conditions on $k$ such that any number $x$ in the interval $[0, k/2]$ can be represented in the form $x_1^{a_1} x_2^{a_2} + x_3^{a_3} x_4^{a_4} + \cdots + x_{k-1}^{a_{k-1}} x_k^{a_k}$, where the exponents $a_{2i-1}$ and $a_{2i}$ are…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

In this paper we prove the mean values of some multiplicative functions connected with the divisor function on the short interval of summation.