English
Related papers

Related papers: On Summatory Totient Functions

200 papers

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

Number Theory · Mathematics 2026-03-09 Artyom Radomskii

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

Number Theory · Mathematics 2024-06-07 Christian Axler

Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ its $k$-fold iterate. In this note, we improve the upper bound for the number of positive $n\leqslant x$ such that $\phi_{k+1}(n)\geqslant cn$. Comparing with the upper bound which…

Number Theory · Mathematics 2025-07-03 Pei Gao , Qiyu Yang

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2022-10-03 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

Number Theory · Mathematics 2023-06-29 Mikhail R. Gabdullin , Vitalii V. Iudelevich , Florian Luca

In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} \phi\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{\phi([x/n])}{[x/n]}$$ where $[x]$…

Number Theory · Mathematics 2019-09-11 Shane Chern

Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…

General Mathematics · Mathematics 2021-01-07 E. En-naoui

In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been…

Systems and Control · Electrical Eng. & Systems 2024-08-23 Adrian Wiltz , Dimos V. Dimarogonas

Uniform upper bounds and the asymptotic expansion with an explicit remainder term are established for the Macdonald function $K_{i\tau}(x)$. The results can be applied, for instance, to study the summability of the divergent…

Classical Analysis and ODEs · Mathematics 2022-11-08 S. Yakubovich

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Number Theory · Mathematics 2015-06-26 R. de la Breteche , T. D. Browning

A sharper estimate for the summatory Euler phi function $\sum_{n \leq x} \varphi(n)$ is presented in this work. It improves the established estimate in the current mathematical literature. In addition, an estimate for its reciprocal…

General Mathematics · Mathematics 2017-07-27 N. A. Carella

Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…

General Mathematics · Mathematics 2026-01-05 Xiang Li , Allison Pacelli

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The asymptotic formula for the new finite sum over the primes $ \sum_{p\leq…

General Mathematics · Mathematics 2021-07-02 N. A. Carella

Let phi(n) denote the Euler totient function. We study the analytic part associated with the summatory function of sigma_1(n) and obtain explicit bounds under the Riemann Hypothesis. In particular, we establish an upper bound of order…

Number Theory · Mathematics 2026-01-19 Hideto Iwata

We show that for some $k\le 3570$ and all $k$ with $442720643463713815200|k$, the equation $\phi(n)=\phi(n+k)$ has infinitely many solutions $n$, where $\phi$ is Euler's totient function. We also show that for a positive proportion of all…

Number Theory · Mathematics 2022-07-05 Kevin Ford

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…

Number Theory · Mathematics 2019-01-03 Olivier Bordellès

Given a multiplicative function $f$, we let $S(x,f)=\sum_{n\leq x}f(n)$ be the associated partial sum. In this note, we show that lower bounds on partial sums of divisor-bounded functions result in lower bounds on the partial sums…

Number Theory · Mathematics 2024-05-02 Claire Frechette , Mathilde Gerbelli-Gauthier , Alia Hamieh , Naomi Tanabe

Let us denote by $\tau(n)$ and $\si(n)$ the number and the sum of the divisors of $n$ and by $\vfi$ Euler's function. We give effective upper bounds for $\frac{n}{\vfi(n)}$ in terms of $\vfi(n)$, and for $\frac{\si(n)}{n}$ in terms of…

Number Theory · Mathematics 2008-12-18 Jean-Louis Nicolas

The orders of magnitudes of the summatory Liouville function L(x), and the summatory Mobius function M(x), are unconditionally proven to be of the forms L(x) = O(x^.5)), and M(x) = O(x^.5) respectively. Furthermore, applications of these…

General Mathematics · Mathematics 2012-12-18 N. A. Carella

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$,…

Number Theory · Mathematics 2020-11-26 Olivier Bordellès
‹ Prev 1 2 3 10 Next ›