Related papers: Monotone non-decreasing sequences of the Euler tot…

In this paper we study the variance of the Euler totient function (normalized to $\varphi(n)/n$) in the integers $\mathbb{Z}$ and in the polynomial ring $\mathbb{F}_q[T]$ over a finite field $\mathbb{F}_q$. It turns out that in…

We propose a generic algorithm for computing the inverses of a multiplicative function under the assumption that the set of inverses is finite. More generally, our algorithm can compute certain functions of the inverses, such as their power…

Monotonicity properties of the ratio $$ \log \frac{f(x+a_1)\cdots f(x+a_n)}{f(x+b_1)\cdots f(x+b_n)}, $$ where $f$ is an entire function are investigated. Earlier results for Euler's gamma function and other entire functions of genus 1 are…

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…

Let phi(n) be Euler's totient function and let sigma(n) be the sum of the positive divisors of n. We show that most phi-values (integers in the range of phi) are not sigma-values and vice versa.

Paul Erdos and Carl Pomerance have proofs on an asymptotic upper bound on the number of preimages of Euler's totient function $\phi$ and the sum-of-divisors functions $\sigma$. In this paper, we will extend the upper bound to the number of…

Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…

Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^\gamma \log\log N_x < \dfrac{N_x}{\varphi(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $\gamma$ is the…

The purpose of this article is two-folds. Firstly, we establish two sufficient conditions under which the sequence $\{f(n)\pmod{m}: n\geq1\}$ is non-periodic, where $f(n)$ is an arithmetic function. As consequences, we deduce that the…

It is proved that if $T$ is sufficiently large, then uniformly for all positive integers $\ell \leqslant (\log T) / (\log_2 T)$, we have \begin{equation*} \max_{T\leqslant t\leqslant 2T}\left|\zeta^{(\ell)}\Big(1+it\Big)\right| \geqslant…

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

The Mertens function, $M(x) := \sum_{n \leq x} \mu(n)$, is defined as the summatory function of the classical M\"obius function. The Dirichlet inverse function $g(n) := (\omega+1)^{-1}(n)$ is defined in terms of the shifted strongly…

In this note, we prove that for all $x \in (0 , 1)$, we have: $$ \log\Gamma(x) = \frac{1}{2} \log\pi + \pi \boldsymbol{\eta} \left(\frac{1}{2} - x\right) - \frac{1}{2} \log\sin(\pi x) + \frac{1}{\pi} \sum_{n = 1}^{\infty} \frac{\log n}{n}…

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

We prove that for all constants $a\in\N$, $b\in\Z$, $c,d\in\R$, $c\neq 0$, the fractions $\phi(an+b)/(cn+d)$ lie dense in the interval $]0,D]$ (respectively $[D,0[$ if $c<0$), where $D=a\phi(\gcd(a,b))/(c\gcd(a,b))$. This interval is the…

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

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an…

Assuming the validity of Dickson's conjecture, we show that the set $\mathcal{V}$ of values of the Euler's totient function $\varphi$ contains arbitrarily large arithmetic progressions with common difference 4. This leads to the question of…

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…