Related papers: Some remarks on the $[x/n]$-sequence

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

We show that the moving arithmetic average is closely connected to a Gauss-Seidel type fixed point method studied by Bauschke, Wang and Wylie, and which was observed to converge only numerically. Our analysis establishes a rigorous proof of…

Let phi denote Euler's phi function. For a fixed odd prime we give an asymptotic series expansion in the sense of Poincare for the number E_q(x) of n<=x such that q does not divide phi(n). Thereby we improve on a recent theorem of B.K.…

In the first part of the present work we consider periodically or quasiperiodically forced systems of the form $(d/dt)x = \epsilon f(x,t \omega )$, where $\epsilon\ll 1$, $\omega\in\mathbb{R}^d$ is a nonresonant vector of frequencies and…

We prove an asymptotic formula for the fourth power mean of Dirichlet L-functions averaged over primitive characters to modulus q and over t\in [0,T] which is particularly effective when q \ge T. In this range the correct order of magnitude…

The objective of this paper is to obtain asymptotic results for shifted sums of multiplicative functions of the form $g \ast 1$, where the function $g$ satisfies the Ramanujan conjecture and has conjectured upper bounds on square moments of…

By a suitable shifting-the-mean parametrization at the Dirichlet series level and Delange's Tauberian theorems, we show that the number of factors in random ordered factorizations of integers is asymptotically normally distributed.

We present an asymptotic expansion formula of an estimator for the drift coefficient of the fractional Ornstein-Uhlenbeck process. As the machinery, we apply the general expansion scheme for Wiener functionals recently developed by the…

We obtain several asymptotic estimates for the sums of the restricted divisor function $$ \tau_{M,N}(k) = #\{1 \le m \le M, \ 1\le n \le N: mn = k\} $$ over short arithmetic progressions, which improve some results of J. Truelsen. Such…

In this paper analyzes \textit{The Erd\H{o}s-Straus conjecture} asserts that $f$$(n)$ $>$ 0 for every $n$ $\geq$ 2, where $f(n)$ indicates the number of solutions to the Diophantine Equation…

In this article, we will use elementary number theory techniques to investigate a sequence of integers defined by a sifting process called the lucky numbers. Ulam introduced lucky numbers as a sieve-based analogue of prime numbers. We…

By using the $q$-analogue of van der Corput's method we study the divisor function in an arithmetic progression to modulus $q$. We show that the expected asymptotic formula holds for a larger range of $q$ than was previously known, provided…

Lehmer conjectured that Ramanujan's tau-function never vanishes. In a related direction, a folklore conjecture asserts that infinitely many primes arise as absolute values of Ramanujan's tau-function. Recently, Xiong showed that these prime…

We study the arithmetic analogue of maximal functions on diagonal hypersurfaces. This paper is a natural step following the papers of \cite{Magyar_dyadic}, \cite{Magyar_ergodic} and \cite{MSW}. We combine more precise knowledge of…

At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…

Let $N_1(m)=\max\{n \colon \phi(n) \leq m\}$ and $N_1 = \{N_1(m) \colon m \in \phi(\mathbb{N})\}$ where $\phi(n)$ denotes the Euler's totient function. Masser and Shiu \cite{masser} call the elements of $N_1$ as `sparsely totient numbers'…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

In this article, we prove an asymptotic formula for the mean value of long smoothed Dirichlet polynomials with divisor coefficients. Our result has a main term that includes all lower order terms and a power saving error term. This is…

The aim of the paper is to study the limit distributions and the asymptotic behavior of summation arithmetic functions. A probabilistic approach based on the use of the axioms of probability theory is used for these purposes. Sufficient…

Recently, Harrington, Litman, and Wong [Bulletin of the Australian Mathematical Society, 2024; arXiv:2303.06534] proved that every arithmetic progression contains infinitely many base-$b$ Niven numbers, for any fixed $b\ge 2$. We use a…