Related papers: Prime number theorem for regular Toeplitz subshift…

New exceptional (i.e. non-repeating) prime number multiplets are given and formulated in terms of arithmetic progressions, along with laws governing them. Accompanying repeating prime number multiplets are pointed out. Prime number…

In this article, we investigate how Euler might have been led to conjecture the Prime Number Theorem, based on what he knew. We also speculate on why he did not do so.

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

We prove the following Return Times Theorem along the sequence of prime times, the first extension of the Return Times Theorem to arithmetic sequences: For every probability space, $(\Omega,\nu)$, equipped with a measure-preserving…

We establish a Liouville type theorem for the fractional Lane-Emden system: \begin{eqnarray*} \left\{\begin{array}{l@{\quad }l} (-\Delta)^\alpha u=v^q&{\rm in}\,\,\R^N,\\ (-\Delta)^\alpha v=u^p&{\rm in}\,\,\R^N, \end{array} \right.…

We study good (i.e., semisimple) reductions of semisimple rigid tensor categories modulo primes. A prime p is called good for a semisimple rigid tensor category C if such a reduction exists (otherwise, it is called bad). It is clear that a…

The Riemann hypothesis states that all nontrivial zeros of the zeta function lie on the critical line $\Re(s)=1/2$. Hilbert and P\'olya suggested a possible approach to prove it, based on spectral theory. Within this context, some authors…

Due to the distribution of primes among integers, we establish an upper bound for the probability $\mathbb{P}_n$ that the Goldbach conjecture fails. Assuming the conjecture holds true for all even number less than $2N$, we prove this…

We obtain an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly expanding rational maps without any smoothness…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

In the second paper [LZ24b] of this series, we obtained an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly…

This research presents the results of a study on the existence and frequency distribution of the shell primes defined herein as prime numbers that result from the calculation of the "half-shell" of an p-dimensional entity of the form…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

For each positive integer $r$, let $S_r$ denote the $r^{th}$ Schemmel totient function, a multiplicative arithmetic function defined by \[S_r(p^{\alpha})=\begin{cases} 0, & \mbox{if } p\leq r; \\ p^{\alpha-1}(p-r), & \mbox{if } p>r…

We make an analytical proof for Lehmer's totient conjecture. Lehmer conjectured that there is no solution for the congruence equation $n-1\equiv 0~(mod~\phi(n))$ with composite integers,$n$, where $\phi(n)$ denotes Euler's totient function.…

Let E be an elliptic curve over Q. In 1988, Koblitz conjectured a precise asymptotic for the number of primes p up to x such that the order of the group of points of E over the finite field F_p is prime. This is an analogue of the Hardy and…

We fix a gap in our proof of an upper bound for the number of positive integers $n\le x$ for which the Euler function $\varphi(n)$ has all prime factors at most $y$. While doing this we obtain a stronger, likely best-possible result.

Fixing a nontrivial automorphism of a number field K, we associate to ideals in K an invariant (with values in {0,1,-1}) that we call the "spin" and for which the associated L-function does not possess Euler products. We are nevertheless…

Euler states without proof statements about the form of prime divisors of numbers of the form aa+Nbb. See Ed Sandifer's How Euler Did It, ``Factors of Forms'', December 2005 at http://www.maa.org/news/howeulerdidit.html for a summary of the…