Related papers: Generalizing the Lehmer's totient problem

Motivated by studies in accelerator physics this paper computes the asymptotic behavior of the series $\displaystyle \sum_{k=1}^N \varphi(k) I_N\left(\frac{1}{k}\right)$, where $\varphi(k)$ is Euler's Totient function and $\displaystyle…

For every odd prime $p$ and every integer $n\geq 12$ there is a Heisenberg group of order $p^{5n/4+O(1)}$ that has $p^{n^2/24+O(n)}$ pairwise nonisomorphic quotients of order $p^{n}$. Yet, these quotients are virtually indistinguishable.…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

In this article we construct a compact Riemannian manifold of high dimension on which the time dependent Euler equations are Turing complete. More precisely, the halting of any Turing machine with a given input is equivalent to a certain…

In this article we prove that equation $\phi(x)=n$, for a fixed $n$, admits a finite number of solutions, we find the general form of these solutions, and we show that: if $x_0$ is a unique solution of this equation then $x_0$ is a product…

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.

A natural number $n$ is called a repdigit if all its digits are same. In this paper, we prove that Euler totient function of no Pell number is a repdigit with at least two digits. This study is also extended to certain subclass of…

This is the geometric part of two papers on the cohomology of Kaehler groups. Using non-Abelian Hodge theory we show that if a finitely presented group with an unbounded complex linear morphism is the fundamental group of a compact Kaehler…

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…

In this paper, vacuum and singularity formation are considered for compressible Euler equations with time-dependent damping. For $1<\gamma\leq 3$, by constructing some new control functions ingeniously, we obtain the lower bounds estimates…

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 $N$ be a sufficiently large, odd integer. We prove an asymptotic formula for the number of representations of $N$ as the sum of three primes, one of which is smaller than a given $U$. By inserting the currently best zero-density…

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

In 1963, Edward Spence published a proof of the following With $\phi$ being Euler totient function, if $n>1$ is an integer, and if \begin{equation*} 0<a_1<\cdots<a_{\phi(n)}<n, \end{equation*} are the positive integers less than $n$,…

A natural variant of Lehmer's conjecture that the Ramanujan $\tau$-function never vanishes asks whether, for any given integer $\alpha$, there exist any $n \in \mathbb{Z}^+$ such that $\tau(n) = \alpha$. A series of recent papers excludes…

We consider several problems about pseudoprimes. First, we look at the issue of their distribution in residue classes. There is a literature on this topic in the case that the residue class is coprime to the modulus. Here we provide some…

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 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

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…

Determining whether a given integer is prime or composite is a basic task in number theory. We present a primality test based on quantum order finding and the converse of Fermat's theorem. For an integer $N$, the test tries to find an…