Related papers: On the Lehmer Numbers, II
A work by Nicolas has shown that if it can be proven that a certain inequality holds for all $n$, the Riemann hypothesis is true. This inequality is associated with the Mertens theorem, and hence the Euler totient at $\prod_{k=1}^n p_k$,…
In 1987, Dan Gordon defined an elliptic curve analogue to Carmichael numbers known as elliptic Carmichael numbers. In this paper, we prove that there are infinitely many elliptic Carmichael numbers. In doing so, we resolve in the…
Lehmer's 1947 conjecture on whether $\tau(n)$ vanishes is still unresolved. In this context, it is natural to consider variants of Lehmer's conjecture. We determine many integers that cannot be values of $\tau(n)$. For example, among the…
One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…
Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…
It is known that there are infinitely many solutions to the inequality \phi(30n+1)<\phi(30n), where \phi is the familiar Euler totient function. However, there are no solutions with n<20,000,000, and computing a solution would seem to…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
Recently, there has been some interest in values of arithmetical functions on members of special sequences, such as Euler's totient function $\phi$ on factorials, linear recurrences, etc. In this article, we investigate, for given positive…
Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…
The Frobenius number of relatively prime positive integers $a_1, \ldots, a_n$ is the largest integer that is not a nononegative integer combination of the $a_i.$ Given positive integers $a_1, \ldots, a_n$ with $n \ge 2,$ the set of…
We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of…
A primorial prime is a prime number of the form $p_n\# \pm 1$ where $p_n\#$ denotes the product of all primes less than or equal to $p_{n}$, the $n$-th prime. We show that the probability along the lines of Mertens' Theorem that either…
In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…
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.
In the spirit of Lehmer's unresolved speculation on the nonvanishing of Ramanujan's tau-function, it is natural to ask whether a fixed integer is a value of $\tau(n)$ or is a Fourier coefficient $a_f(n)$ of any given newform $f(z)$. We…
Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the…
The strong probable primality test is an important practical tool for discovering prime numbers. Its effectiveness derives from the following fact: for any odd composite number $n$, if a base $a$ is chosen at random, the algorithm is…
In this article, we investigate sparse subsets of the natural numbers and study the sparseness of some sets associated with the Euler's totient function $\phi$ via the property of `Banach Density'. These sets related to the totient function…
In this paper we present a new proof of the following 2010 result of Dubickas, Novikas, and Siurys: Let $(a,b)\in \mathbb{Z}^2$ and let $(x_n)_{n\ge 0}$ be the sequence defined by some initial values $x_0$ and $x_1$ and the second order…