Related papers: Scale Free Analysis and the Prime Number Theorem

This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…

This paper extends the Pythagorean Theorem to positive and negative real exponents to take the form a^n + b^n = c^n and makes use of the definition gamma = b/a >= 1. For the case of n in the set of positive real numbers, n greater than or…

We show that there are an infinite number of Riemann zeros on the critical line, enumerated by the positive integers $n=1,2,\dotsc$, whose ordinates can be obtained as the solution of a new transcendental equation that depends only on $n$.…

Unlike some other formal systems, the proof system Metamath has no built-in concept of "decimal number" in the sense that arbitrary digit strings are not recognized by the system without prior definition. We present a system of theorems and…

Let x be a quadratic irrational and let P be the set of prime numbers. We show the existence of an infinite subset S of P such that the statistics of the period of the continued fraction expansions along the sequence {px: p\in S} approach…

This article considers the error term of the primes counting function. It applies some recent results on the densities of prime numbers in short intervals to derive an improvement of the error term from subexponential size to fractional…

This note discusses the existence of prime numbers in short intervals. An unconditional elementary argument seems to prove the existence of primes in the short intervals [x, x + y], where y >= x^(1/2)(log x)^e, e > 0, and a sufficiently…

Alpoge and Granville (separately) gave novel proofs that the primes are infinite that use Ramsey Theory. In particular, they use Van der Waerden's Theorem and some number theory. We prove the primes are infinite using an easier theorem from…

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

We introduce a new weight and corresponding metric over finite extension fields for asymmetric error correction. The weight distinguishes between elements from the base field and the ones outside of it, which is motivated by asymmetric…

In this article, we study the Euler's factorial series $F_p(t)=\sum_{n=0}^\infty n!t^n$ in $p$-adic domain under the Generalized Riemann Hypothesis. First, we show that if we consider primes in $k\varphi(m)/(k+1)$ residue classes in the…

We present a new, elementary, dynamical proof of the prime number theorem.

In his paper "On the Number of Primes Less Than a Given Magnitude", Bernhard Riemann introduced a prime counting function F(x) which counts the number of primes under x. Riemann obtained an analytic expression for F(x) by evaluating an…

A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…

We survey the classical results on the prime number theorem

It is shown that in two-state quantum theory, a generic quantum state can be described by a non-computable real number. In terms of this, the criterion for measurement outcome is simply and deterministically defined. This demonstration is…

Many classical ring-theoretic results state that an ideal that is maximal with respect to satisfying a special property must be prime. We present a "Prime Ideal Principle" that gives a uniform method of proving such facts, generalizing the…

While the prime numbers have been subject to mathematical inquiry since the ancient Greeks, the accumulated effort of understanding these numbers has - as Marcus du Sautoy recently phrased it - 'not revealed the origins of what makes the…

This article provides a proof of the famous \textit{Prime Number Theorem} by establishing an analogous statement of the same in terms of the second \textit{Chebyshev Function} $\psi(x)$. We shall be extensively using complex analytic…

In these notes, we refine Mitsui's Prime Number Theorem from 1957, which for a number field $K$ predicts how many prime elements there are in bounded convex sets in $K \otimes_{\mathbf Q} \mathbf R$, by incorporating potential Siegel zeros…