Related papers: Distribution of values of general Euler totient fu…
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 discuss in some detail the general problem of computing averages of convergent Euler products, and apply this to examples arising from singular series for the $k$-tuple conjecture and more general problems of polynomial representation of…
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…
The primorial $p\#$ of a prime $p$ is the product of all primes $q\le p$. Let pr$(n)$ denote the largest prime $p$ with $p\# \mid \phi(n)$, where $\phi$ is Euler's totient function. We show that the normal order of pr$(n)$ is $\log\log…
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…
We promote the recent research by Akiyama and Kaneko on the higher-order derivative values $\Phi_n^{(k)}(1)$ of the cyclotomic polynomials. This article focuses on Lehmer's explicit formula of $\Phi_n^{(k)}(1)/\Phi_n(1)$ as a polynomial of…
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…
The Generalized Poisson Distribution (GPD) was introduced by Consul and Jain (1973). However, as remarked by Consul (1989), "It is very difficult to prove by direct summation that the sum of all the probabilities is unity". We give a…
Recently, Bordell\'{e}s, Dai, Heyman, Pan and Shparlinski in \cite{Igor} considered a partial sum involving the Euler totient function and the integer parts $\lfloor x/n\rfloor$ function. Among other things, they obtained reasonably tight…
Erickson defined the fusible numbers as a set $\mathcal F$ of reals generated by repeated application of the function $\frac{x+y+1}{2}$. Erickson, Nivasch, and Xu showed that $\mathcal F$ is well ordered, with order type $\varepsilon_0$.…
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 result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…
In this paper we investigate a certain category of cotangent sums and more specifically the sum $$\sum_{m=1}^{b-1}\cot\left(\frac{\pi m}{b}\right)\sin^{3}\left(2\pi m\frac{a}{b}\right)\:$$ and associate the distribution of its values to a…
In this paper analysis of the concept of {\it associated homogeneous distributions} (generalized functions) is given, and some problems related to these distributions are solved. It is proved that (in the one-dimensional case) there exist…
The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study…
We study the distribution of divisors of Euler's totient function and Carmichael's function. In particular, we estimate how often the values of these functions have "dense" divisors.
We define an extension of the Ramanujan trigonometric function to arbitrary dimensions, and give the Dirichlet series generating function. The extension was first given by Eckford Cohen long ago. This links directly to visible point vector…
The Euler numbers have been widely studied. A signed version of the Euler numbers of even subscript are given by the coefficients of the exponential generating function 1/(1+x^2/2!+x^4/4!+...). Leeming and MacLeod introduced a…
We prove several new variants of the Lambert series factorization theorem established in the first article "Generating special arithmetic functions by Lambert series factorizations" by Merca and Schmidt (2017). Several characteristic…
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…
Let $G_1,\dots, G_n\in \mathbb{F}_p[X_1,\dots,X_m]$ be $n$ polynomials in $m$ variables over the finite field $\mathbb{F}_p$ of $p$ elements. For any sufficiently large prime $p$ and non-trivial bounds for the Weyl sums associated to the…