Related papers: Arithmetic Functions of Balancing Numbers
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…
An unconditional inequality of the totient function is contributed to the literature. This result is associated with various problems about the distribution of prime numbers.
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 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.
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…
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…
We deal with various Diophantine equations involving the Euler totient function and various sequences of numbers, including factorials, powers, and Fibonacci sequences.
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…
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…
At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer…
By using the elementary symmetric polynomials and some results of number theory, we solve the well known problem of Lehmer on Euler's totient function. As application, we obtain a new characterization of prime numbers.
We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the p-adic valuation, the number-of-divisors function, the sum-of-divisors…
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.
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…
We generalize certain totient functions using elementary symmetric polynomials and derive explicit product forms for the totient functions involving the second elementary symmetric sum. This work follows from the work of Toth [The Ramanujan…
In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…
In this paper we give an attempt to extend some arithmetic properties such as multiplicativity, convolution products to the setting of operators theory. We provide a significant examples which are of interest in number theory. We also give…
Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of…
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.
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]$…