Search

We prove a totally explicit bound for short sums of certain non-negative arithmetic functions satisfying a general growth condition, and apply this result to derive two explicit estimates for the Erd\H{o}s-Hooley $\Delta$-function in short intervals., Comment: 20 pages; comments are welcome

We investigate various sparse sets that satisfy the prime number theorem. The sparsest of these sets, $\{\lfloor x/n^t \rfloor:n \le x\}$, has density approaching $1/x$ as $t$ approaches infinity.

In this note, we extend to a composite modulo a recent result of Chan (2016) dealing with mean values of the product of an integer and its multiplicative inverse modulo a prime number., Comment: 8 pages. Comments and suggestions are welcome

In this note, we provide an explicit upper bound for $h_K \mathcal{R}_K d_K^{-1/2}$ which depends on an effective constant in the error term of the Ideal Theorem., Comment: 7 pages. Comments are welcome

We unify in a large class of additive functions the results obtained in the first part of this work. The proof rests on series involving the Riemann zeta function and certain sums of primes which may have their own interest., Comment: 19 pages; comments are appreciated and welcome

We obtain asymptotic formulas for the sums $\sum_{n_1,\ldots,n_k\le x} f((n_1,\ldots,n_k))$ and $ \sum_{n_1,\ldots,n_k\le x} f([n_1,\ldots,n_k])$ involving the gcd and lcm of the integers $n_1,\ldots,n_k$, where $f$ belongs to certain classes of additive arithmetic functions. In particular, we consider the generalized omega function $\Omega_{\ell}(n)= \sum_{p^\nu \mid\mid n} \nu^{\ell}$ investigated by Duncan (1962) and Hassani (2018), and the functions $A(n)=\sum_{p^\nu \mid\mid n} \nu p$, $A^*(n)= \sum_{p \mid n} p$, $B(n)=A(n)-A^*(n)$ studied by Alladi and Erd\H{o}s (1977). As a key auxiliary result we use an inclusion-exclusion-type identity., Comment: 22 pages

We study sums of the shape $\sum_{n \leqslant x} f \left( \lfloor x/n \rfloor \right)$ where $f$ is either the von Mangoldt function or the Dirichlet-Piltz divisor functions. We improve previous estimates when $f = \Lambda$ and $f = \tau$, and provide new results when $f = \tau_r$ with $r \geqslant 3$, breaking the $\frac{1}{2}$-barrier in each case. The functions $f=\mu^2$, $f=2^\omega$ and $f=\omega$ are also investigated., Comment: 16 pages. In this version, the function omega has been added. Comments are welcome

This paper is a corrigendum to the article 'On the ideal theorem for number fields`. The main result of this paper proves to be untrue and is replaced by an estimate of a weighted sum with an improved error term.

We first study the mean value of certain restricted divisor sums involving the Chowla-Walum sums, improving in particular a recent estimate given by Iannucci. The aim of the second part of this work is the generalization of the previous study, by restricting the range of the divisors in the studied divisor sums, extending the Chowla-Walum conjecture, proving a small part of this extended conjecture and generalizing the asymptotic formulas previously obtained in the first part., Comment: 6 pages. Comments are welcome

We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be expressed as sums of Stirling numbers of the second kind. This implies in particular that $1$ is an eigenvalue with algebraic multiplicity greater than that of Redheffer's matrix., Comment: 6 pages; comments are wellcome

In this note, an upper bound for the sum of fractional parts of certain smooth functions is established. Such sums arise naturally in numerous problems of analytic number theory. The main feature is here an improvement of the main term due to the use of Weyl's bound for exponential sums and a device used by Popov., Comment: 5 pages

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the reciprocals of integers., Comment: This version incorporate the improvement of the upper bound of Theorem 2.1 in v.1, given by Lixia Dai and Hao Pan in arXiv:1809.10381. Consecutively, Lixia Dai and Hao Pan are now co-authors

Using elementary means, we prove several identities involving the M\"obius function, generalizing in the multidimensional case well-known formulas coming from convolution arguments., Comment: 10 pages

Under the Riemann Hypothesis, we improve the error term in the asymptotic formula related to the counting lattice problem studied in a first part of this work. The improvement comes from the use of Weyl's bound for exponential sums of polynomials and a device due to Popov allowing us to get an improved main term in the sums of certain fractional parts of polynomials., Comment: 6 pages

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with at most one exception. We also show that $\mathfrak{P}_n$ is large, has many prime factors exceeding $\sqrt{n}$, with the largest one exceeding $n^{20/37}$. We establish Kellner's conjecture, which says that the number of prime factors exceeding $\sqrt{n}$ grows asymptotically as $\kappa \sqrt{n}/\log n$ for some constant $\kappa$ with $\kappa=2$. Further, we compare the sizes of $\mathfrak{P}_n$ and $\mathfrak{P}_{n+1}$, leading to the somewhat surprising conclusion that although $\mathfrak{P}_n$ tends to infinity with $n$, the inequality $\mathfrak{P}_n>\mathfrak{P}_{n+1}$ is more frequent than its reverse., Comment: 25 pages

The aim of this note is a proof of a recent conjecture of Kellner concerning the number of distinct prime factors of a particular product of primes. The proof uses profound results from analytic number theory, such as Granville-Ramar\'{e}'s estimate of an exponential sum over primes., Comment: 4 pages

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo $q$, then $\left( \lambda_q \star \mathbf{1} \right) (n)$ could be close to the number of divisors of $n$. This is the aim of this work to compare the mean value of the function $\lambda_q \star \mathbf{1}$ to the well known average order of $\tau$. The proof reveals that the results depend heavily on the value of $\left( \frac{2}{q} \right)$. A bound for short sums in the case $q=5$ is also given, using profound results from the theory of integer points close to certain smooth curves., Comment: 9 pages

Using recent results from the theory of integer points close to smooth curves, we give an asymptotic formula for the distribution of values of a class of integer-valued prime-independent multiplicative functions., Comment: 8 pages

Using estimates on Hooley's $\Delta$-function and a short interval version of the celebrated Dirichlet hyperbola principle, we derive an asymptotic formula for a class of arithmetic functions over short segments. Numerous examples are also given., Comment: 13 pages