Related papers: The Error Term of the Summatory Euler Phi Function

In this article, we present relations for the Euler totient function $\varphi(n)$ and the number of divisors $\tau(n)$ in terms of finite sums of integer parts of rational numbers or greatest common divisors of pairs of integers. Some of…

Let $\mu(n)$ be the M\"{o}bius function and $e(\alpha)=e^{2\pi i\alpha}$. In this paper, we study upper bounds of the classical sum $$S(x,\alpha):=\sum_{1\leq n\leq x}\mu(n)e(\alpha n).$$ We can improve some classical results of Baker and…

We study the exact extremal orders of compositions $f(g(n))$ of certain arithmetical functions, including the functions $\sigma(n)$, $\phi(n)$, $\sigma^*(n)$ and $\phi^*(n)$, representing the sum of divisors of $n$, Euler's function and…

In this note we consider inequalities involving the error function $\phi$. Our methodes give new proofs of some known inequalities of Komatsu, and of Szarek and Werner, and also produce two families of inequalities that give upper and lower…

The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…

On the sets of $2\pi$-periodic functions $f$, which are defined with a help of $(\psi, \beta)$-integrals of the functions $\varphi$ from $L_{1}$, we establish Lebesgue-type inequalities, in which the uniform norms of deviations of Fourier…

Let $f(n)$ be an arithmetic function with $f(n) \ll n^\alpha$ for some $\alpha\in[0,1)$ and let $\lfloor .\rfloor $ denote the integer part function. In this paper, we evaluate asymptotically the sums $$\sum_{n_{1}n_{2}\leq x}f \left(…

A sharp asymptotic formula for the sum of reciprocals of $\pi(n)$ is derived, where $\pi(x)$ is the number of primes not exceeding $x$. This result improves the previous results of De Koninck--Ivi\'c and L. Panaitopol.

The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…

In this paper, we consider a "compensated" random sum that arises from numerical approximation of stochastic integrations and differential equations. We show that the compensated sum exhibits some surprising cancellations among its…

Let $\phi(n)$ be the Euler-phi function, define $\phi_0(n) = n$ and $\phi_{k+1}(n)=\phi(\phi_{k}(n))$ for all $k\geq 0$. We will determine an asymptotic formula for the set of integers $n$ less than $x$ for which $\phi_k(n)$ is $y$-smooth,…

We deduce an asymptotic formula with error term for the sum $\sum_{n_1,\ldots,n_k \le x} f([n_1,\ldots, n_k])$, where $[n_1,\ldots, n_k]$ stands for the least common multiple of the positive integers $n_1,\ldots, n_k$ ($k\ge 2$) and $f$…

Translation from the Latin original, "Inventio summae cuiusque seriei ex dato termino generali" (1735). E47 in the Enestrom index. In this paper Euler derives the Euler-Maclaurin summation formula, by expressing y(x-1) with the Taylor…

We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…

This short note contains elementary evaluations of some Euler sums.

This study presents explicit evaluations of the series \begin{equation*} \sum_{k=1}^\infty \frac{H_{k/n}^{(p)}}{k^q} \quad \text{and} \quad \sum_{k=1}^\infty \frac{(-1)^k H_{k/2n}^{(p)}}{k^q}, \quad p,q,n \in \mathbb{Z}_{\ge 1},\; q \ne 1,…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

We introduce Euler summability method for sequences of fuzzy numbers and state a Tauberian theorem concerning Euler summability method, of which proof provides an alternative to that of K. Knopp[\"Uber das Eulersche Summierungsverfahren II,…

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 $I(n):=\int_0^1 [x^n+(1-x)^n]^\frac1n dx.$ In this paper, we show that $I(n)= \sum_0^\infty \frac{I_i}{n^i},n\rightarrow \infty$ and we compute $I_i, i =0..5$, obtained by polylog functions and Euler sums. As a corollary, we obtain…