Related papers: Euler Totient Function And The Largest Integer Fun…

After the work of Bordell\`{e}s, Dai, Heyman, Pan and Shparlinki (2018) and Heyman (2019), several authors studied the averages of arithmetic functions over the sequence $[x/n]$ and the integers of the form $[x/n]$. In this paper, we give…

Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…

It is shown that every sufficiently large even integer is a sum of two primes and exactly 13 powers of 2. Under the Generalized Rieman Hypothesis one can replace 13 by 7. Unlike previous work on this problem, the proof avoids numerical…

We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…

Let $\gcd(m,n)$ denote the greatest common divisor of the positive integers $m$ and $n$, and let $\mu$ represent the M\" obius function. For any real number $x>5$, we define the summatory function of the M\" obius function involving the…

Given relatively prime positive integers, $a_1,\ldots,a_n$, the Frobenius number is the largest integer with no representations of the form $a_1x_1+\cdots+a_nx_n$ with nonnegative integers $x_i$. This classical value has recently been…

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…

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'…

The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

Let $p$ be a prime number. For a positive integer $n$ and a real number $\xi$, let $\lambda_n (\xi)$ denote the supremum of the real numbers $\lambda$ for which there are infinitely many integer tuples $(x_0, x_1, \ldots , x_n)$ such that…

Let $3\leqslant k\leqslant9$ be a fixed integer, $p$ be a prime and $d(n)$ denote the Dirichlet divisor function. We use $\Delta(x)$ to denote the error term in the asymptotic formula of the summatory function of $d(n)$. The aim of this…

The Dirichlet lambda function $\lambda(s)$ is defined for $\mathrm{Re}(s) > 1$ by \[ \lambda(s) = \sum_{n=0}^{\infty} \frac{1}{(2n+1)^s}. \] This function was initially studied by Euler on the real line, where he denoted it by $N(s)$. In…

This work gives a general approach to the determination of the asymptotic behavior of the sums of functions of primes based on the distribution of primes. It refines the estimate of the remainder term of the asymptotic expansion of the sums…

We define the $k$-dimensional generalized Euler function $\varphi_k(n)$ as the number of ordered $k$-tuples $(a_1,\ldots,a_k)\in {\Bbb N}^k$ such that $1\le a_1,\ldots,a_k\le n$ and both the product $a_1\cdots a_k$ and the sum $a_1+\cdots…

Let $x$ be a real number satisfying $x \geq 2$. For any positive integer $n$, we define $s(n)$ as the smallest non-negative integer such that $n + s(n)$ is a perfect square. In this paper, we derive an asymptotic formula for the sum…

Let $p \in (0, \infty)$ be a constant and let $\{\xi_n\} \subset L^p(\Omega, {\mathcal F}, \P)$ be a sequence of random variables. For any integers $m, n \ge 0$, denote $S_{m, n} = \sum_{k=m}^{m + n} \xi_k$. It is proved that, if there…

A natural number $n$ is called semi-prime if it is a product of two primes or a square of a prime. We denote $\mathbb{P}_2$ the set of all semi-primes. Our goal is to prove that for fixed integer number $a$ and sufficiently large $x$ the…

In this expository note, we revisit several classical arithmetic functions - namely Euler's totient function, the divisor sum functions and Dedekind's $\psi$-function - within a unifying algebraic framework that highlights their connections…

We show that the sum function of the M\"{o}bius function of a Beurling number system must satisfy the asymptotic bound $M(x)=o(x)$ if it satisfies the prime number theorem and its prime distribution function arises from a monotone…