Related papers: The variance of the Euler totient function
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…
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…
In this paper, we study some typical arithmetic properties of Euler's totient function of polynomials over finite fields. Especially, we study polynomial analogues of some classical conjectures about Euler's totient function, such as…
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…
Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…
We present an algorithm to invert the Euler function $\phi(m)$. The algorithm, for a given $n \geq 1$, in polynomial time ``on average'', finds the set $\Psi(n)$ of all solutions $m$ to $\phi(m) = n$. In fact, in the worst case, $\Psi(n)$…
In this article we give a result obtained of an experimental way for the Euler totient function.
The image of Euler's totient function is composed of the number 1 and even numbers. However, many even numbers are not in the image. We consider the problem of finding those even numbers which are in the image and those which are not. If an…
The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…
Motivated by an application of semigroup variants to the discrete log problem in groups and related cryptographic applications, we introduce a new kind of totient function, related to both Euler's function and a generalisation of Euler's…
Let $P(x)$ be an irreducible quadratic polynomial in $\mathbb{Z}[x]$. We show that for almost all $n$, $P(n)$ does not lie in the range of Euler's totient function.
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…
We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…
Finding the mean square averages of the Dirichlet $L$-functions over Dirichlet characters $\chi$ of same parity is an active problem in number theory. Here we explicitly evaluate such averages of $L(3,\chi)$ and $L(4,\chi)$ using certain…
We propose a lower estimation for computing quantity of the inverses of Euler's function. We answer the question about the multiplicity of $m$ in the equation $\varphi(x) = m$ \cite{Ford}. An analytic expression for exact multiplicity of $m…
Theorem 1 Let F:N-->R stand for any function which a) $F$ monotonically weakly increases; b) $F$ tends to infinity; and c) such that $q/F(q)$ tends to infinity. Let Z_F(q) equal the number of divisors of q less than sqrt{F(q)} minus the…
We believe that Euler constant is not just the "renormalized" value of the Riemann zeta function in 1. In a sense that we shall clarify it is in fact the normal and natural value of zeta of 1. In this paper we first propose a limit…
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…
In this paper, we consider the function field analogue of the Lehmer's totient problem. Let $p(x)\in\mathbb{F}_q[x]$ and $\varphi(q,p(x))$ be the Euler's totient function of $p(x)$ over $\mathbb{F}_q[x],$ where $\mathbb{F}_q$ is a finite…
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]$…