Related papers: Prime number theorem for regular Toeplitz subshift…
The Euler's totient function $ \varphi(n) $ counts the positive integers up to a given integer $ n$ that are relatively prime to $ n $. We solve a problem due to Lehmer that there is no composite number $ n $ such that $ \varphi(n)\mid n-1…
We give a simple Tauberian proof of the Prime Number Theorem using only elementary real analysis. Hence, the analytic continuation of Riemann's zeta function $\zeta$ and its non-vanishing value on the whole line $\{z\in {\mathbb…
We give here a new proof of a Tauberian Theorem of complex Laplace transform using the Theory of measure and theory of function with bounded variations. However we deduce the simple proof of Prime Number Theorem.
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 obtain an analogue of the prime number theorem for a class of branched covering maps on the $2$-sphere called expanding Thurston maps $f$, which are topological models of some rational maps without any smoothness or holomorphicity…
An important unsolved question in number theory is the Lehmer's totient problem that asks whether there exists any composite number $n$ such that $\varphi(n)\mid n-1$, where $\varphi$ is the Euler's totient function. It is known that if any…
A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…
Nicolas criterion for the Riemann Hypothesis is based on an inequality that Euler totient function must satisfy at primorial numbers. A natural approach to derive this inequality would be to prove that a specific sequence related to that…
In this note we examine Littlewood's proof of the prime number theorem. We show that this can be extended to provide an equivalence between the prime number theorem and the non-vanishing of Riemann's zeta-function on the one-line. Our…
We consider a class of smooth mixing flows $T^{\alpha,\gamma}$ on $\mathbb{T}^2$ with one degenerated fixed point $x_0\in \mathbb{T}^2$ of power type $\gamma\in (-1,0)$. We prove that for a $G_\delta$ dense set of $\alpha\in \mathbb{T}$, a…
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…
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…
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…
A prime geodesic theorem is proven for singular geodesics in quotients of SL(4). This is a case where regularity assumptions of previous papers fail. As a consequence, the analysis becomes much more involved. For applications in number…
The aim of this article is to investigate how various Riemann Hypotheses would follow only from properties of the prime numbers. To this end, we consider two classes of $L$-functions, namely, non-principal Dirichlet and those based on cusp…
In 1737 Leonard Euler gave what we often now think of as a new proof, based on infinite series, of Euclid's theorem that there are infinitely many prime numbers. Our short paper uses a simple modification of Euler's argument to obtain new…
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…
We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…
1. There is no existing any quadratic interval $\eta_{n}:=(n^{2},(n+1)^{2}],$ which contains less than 2 prime numbers. The number of prime numbers within $\eta_{n}$ goes averagely linear with n to infinity. 2. The exact law of the number…
Although Sarnak's conjecture holds for compact group rotations (irrational rotations, odometers), it is not even known whether it holds for all Jewett-Krieger models of such rotations. In this paper we show that it does, as long as the…