Related papers: An asymptotic formula with power-saving error term…

Let k be a fixed integer. We study the asymptotic formula of R(H, r, k), which is the number of positive integer solutions x, y, z greater than or equal to 1 and less than or equal to H such that the polynomial x^2+y^2+z^2+k is r-free. We…

The Brent-McMillan algorithm is the fastest known procedure for the high-precision computation of Euler's constant $\gamma$ and is based on the modified Bessel functions $I_0(2x)$ and $K_0(2x)$. An error estimate for this algorithm relies…

It is not difficult to find an asymptotic formula for the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree. In the present paper we improve the estimate for the error term in this formula using the…

We establish, utilizing the Hardy-Littlewood Circle Method, an asymptotic formula for the number of pairs of primes whose differences lie in the image of a fixed polynomial. We also include a generalization of this result where differences…

Consider a strongly $b$-multiplicative sequence and a prime $p$. Studying its $p$-rarefaction consists in characterizing the asymptotic behaviour of the sums of the first terms indexed by the multiples of $p$. The integer values of the…

We give a simple inequality that compares the laws of two random variables taking values in a convex subset of a normed vector space. By combining this with Arratia's coupling, recently refined by Koukoulopoulos and the author, we obtain a…

Exponential sums with monomials are highly related to many interesting problems in number theory and well studied by many literatures. In this paper, we consider the exponential sums with polynomials and prove a new upper bound. As an…

The asymptotic formula of the number of integral points in non-compact symmetric homogeneous spaces of semi-simple simply connected algebraic groups is given by the average of the product of the number of local solutions twisted by the…

We introduce a new method to bound bilinear (Type II) sums of Kloosterman sums with composite moduli $c$, using Fourier analysis on $\mathrm{SL}_2(\mathbb{Z}/c\mathbb{Z})$ and an amplification argument with non-abelian characters. For sums…

We count mxn non-negative integer matrices (contingency tables) with prescribed row and column sums (margins). For a wide class of smooth margins we establish a computationally efficient asymptotic formula approximating the number of…

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…

This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper…

For any $k>1$, we find the asymptotics of the counting function of $k$-th power-free elements in an additive arithmetic semigroup with exponential growth of the abstract prime counting function. This paper continues the authors' earlier…

Let $d(n)$ be the Dirichlet divisor function and $\Delta(x)$ denote the error term of the sum $\sum_{n\leqslant x}d(n)$ for a large real variable $x$. In this paper we focus on the sum $\sum_{p\leqslant x}\Delta^2(p)$, where $p$ runs over…

Let $p$ be a prime and $n$ a positive integer such that $\sqrt{\frac p2} + 1 \leq n \leq \sqrt{p}$. For any arithmetic progression $A$ of length $n$ in $\mathbb{F}_p$, we establish an asymptotic formula for the number of directions…

Let k, r > 1 be two integers. We prove an asymptotic formula for the number of k-free values of the r variables polynomial t_1...t_r - 1 over the integral points of [1, x]^r.

Asymptotic formulae are established for the number of natural numbers $m$ with largest square-free divisor not exceeding $m^{\vartheta}$, for any fixed positive parameter $\vartheta$. Related counting functions are also considered.

We combine a sieve method together with good uniformity estimates to prove a secondary term for the asymptotic estimate of $S_3\times A$ extensions over $\mathbb{Q}$ when $A$ is an odd abelian group with minimal prime divisor greater than…

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…

In this paper, we exhibit an asymptotic formula for the number of representations of a large integer as a sum of a fixed power of Piatetski-Shapiro primes, thereby establishing a variant of Waring-Goldbach problem with primes from a sparse…