Related papers: Divisors of the Euler and Carmichael functions
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…
We investigate two arithmetic functions naturally occurring in the study of the Euler and Carmichael quotients. The functions are related to the frequency of vanishing of the Euler and Carmichael quotients. We obtain several results…
New unconditional estimates of the divisor and totient functions are contributed to the literature. These results are consistent with the Riemann hypothesis and seem to solve the Nicolas inequality for all sufficiently large integers.
The upper bound and the lower bound of average numbers of divisors of Euler Phi function and Carmichael Lambda function are obtained by Luca and Pomerance (see \cite{LP}). We improve the lower bound and provide a heuristic argument which…
Two inequalities involving the Euler totient function and the sum of the $k$-th powers of the divisors of balancing numbers are explored.
Our paper is devoted to several problems from the field of modified divisors: namely exponential and infinitary divisors. We study the behaviour of modified divisors, sum-of-divisors and totient functions. Main results concern with the…
Consider the operator $E$ on arithmetic functions such that $Ef$ is the multiplicative arithmetic function defined by $(Ef)(p^a) = f(a)$ for every prime power $p^a$. We investigate the behaviour of $E^m\tau_k$, where $\tau_k$ is a…
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…
Let $\phi(n)$denote Euler's phi function. We study the distribution of the numbers $gcd(n,\phi(n))$ and their divisors. Our results generalize previous results of Erd\H{o}s and Pollack.
In this article we study certain properties of the image of Euler's totient function; we also consider the structure of the preimage of certain elements of the image of this function.
Asymptotic properties of certain arithmetic functions involving exponential divisors are investigated.
We investigate the behavior of the divisor function in both short intervals and in arithmetic progressions. The latter problem was recently studied by \'E. Fouvry, S. Ganguly, E. Kowalski, and Ph. Michel. We prove a complementary result to…
Let $\mathcal{D}_{n} \subset \mathbb{N}$ denote the set of the $\tau(n)$ divisors of $n$. We study the function $$ D_{n}(X,Y):=|\{d \in \mathcal{D}_{n}:\ X \le d \le X+Y\}| $$ for $Y \le X$.
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…
In this article, we study the distribution of values of Dirichlet $L$-functions, the distribution of values of the random models for Dirichlet $L$-functions, and the discrepancy between these two kinds of distributions. For each question,…
We compare the asymptotic behavior of Carmichael's lambda function composed with Euler's totient function to the asymptotic behavior of Carmichael's lambda function composed with itself. We establish the normal order of the logarithm of the…
In this paper we introduce the concept of \emph{multivector functionals.} We study some possible kinds of derivative operators that can act in interesting ways on these objects such as, e.g., the $A$-directional derivative and the…
Euler discovered recurrence for divisor sum functions as a consequence of the pentagonal numbers theorem. With similar idea and also motivated by Ewell's work in 1977, we prove new recurrences for certain divisor sum functions and…
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…
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.