Related papers: Short intervals asymptotic formulae for binary pro…

The integers $n=\prod_{i=1}^r p_i^{a_i}$ and $m=\prod_{i=1}^r p_i^{b_i}$ having the same prime factors are called exponentially coprime if $(a_i,b_i)=1$ for every $1\le i\le r$. We estimate the number of pairs of exponentially coprime…

We prove that for every nonnegative integer $m$ there exists an $\varepsilon>0$ such that if $\lambda\in (0,\varepsilon]$ and $x$ is sufficiently large in terms of $m$, then the number of positive integers $n\leq x$ for which the interval…

Let $\mathbb{N}$ and $\mathcal{P}$ be the sets of natural numbers and primes, respectively. Motived by an old problem of Erd\H os and Kalm\'ar, we prove that for almost all $y>1$ the lower asymptotic density of integers of the form…

We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod $q$)},\ p_{n+m} - p_{n}\leq y\}, \] where $p_{n}$ is the $n^{\text{th}}$ prime.

Let $p_{r+1}-1>n \geq p_r-1$, based on a sequence $\{1,2,3\cdots\ M_r(M_r=p_1p_2\cdots p_r)\}$, we compare the density of coprime numbers and establish a correlation between the proportions of coprime numbers in the ranges from 1 to…

The asymptotic solution for the Painleve-2 equation with small parameter is considered. The solution has algebraic behavior before point $t_*$ and fast oscillating behavior after the point $t_*$. In the transition layer the behavior of the…

In this paper we obtain a series of asymptotic formulae in the sum--product phenomena over the prime field $\mathbf{F}_p$. In the proofs we use usual incidence theorems in $\mathbf{F}_p$, as well as the growth result in ${\rm SL}_2…

For a fixed prime $p$, let $e_p(n!)$ denote the order of $p$ in the prime factorization of $n!$. Chen and Liu (2007) asked whether for any fixed $m$, one has $\{e_p(n^2!) \bmod m:\; n\in\mathbb{Z}\}=\mathbb{Z}_m$ and $\{e_p(q!) \bmod m:\; q…

The paper provides a connection between Commutative Algebra and Integer Programming and contains two parts. The first one is devoted to the asymptotic behavior of integer programs with a fixed cost linear functional and the constraint sets…

Let $N$ denotes a sufficiently large even integer, $p$ denotes a prime and $P_{r}$ denotes an integer with at most $r$ prime factors. In this paper, we study the solutions of the equation $N-p=P_3$ and consider two special cases where $p$…

In this paper we present a method for producing asymptotic estimates for the number of integers in a given S having only ``small'' prime factors. The conditions that need to be verified are simpler than those required by other methods, and…

Some mean value theorems in the style of Bombieri-Vinogradov's theorem are discussed. They concern binary and ternary additive problems with primes in arithmetic progressions and short intervals. Nontrivial estimates for some of these mean…

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

A convenient framework for dealing with asymptotic limit problems of probabilistic nature is provided. These problems include questions such as finding the asymptotic proportion of terms of a sequence falling inside a given interval, or the…

This paper gives an explicit version of Selberg's 1943 mean-value estimate for the prime number theorem in intervals under the Riemann hypothesis. Two applications are given: for primes in short intervals, and Goldbach numbers (sums of two…

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 article, we prove an "equivalence" between two higher even moments of primes in short intervals under Riemann Hypothesis. We also provide numerical evidence in support of these asymptotic formulas.

We obtain an asymptotic formula for the number of integer $2\times 2$ matrices that have determinant $\Delta$ and whose absolute values of the entries are at most $H$. The result holds uniformly for a large range of $\Delta$ with respect to…

In 1938 E. T. Bell introduced "The Iterated Exponential Integers". He proved that these numbers may be expressed by polynomials with rational coefficients. However, Bell gave no formulas for any of the coefficients except the trivial one,…

Let $S(n)$ denote the least primary factor in the primary decomposition of the multiplicative group $M_n = (\Bbb Z/n\Bbb Z)^\times$. We give an asymptotic formula, with order of magnitude $x/(\log x)^{1/2}$, for the counting function of…