Guest wrote: I discover a correction below:
Keywords: Prime Number Theorem (PNT), the sound Riemann Hypothesis (RH) and the Riemann Prime-Counting Function, the sound Goldbach Conjecture (GC), the sound Polignac Conjecture (PC), the sound Prime Parity Law (PPL), and the purpose of prime numbers -- PRIME WORK (PW).
(I discovered a mistake or typo in the statement below, and I corrected it.)
Prime Number Theorem (PNT) is true if and only if the Goldbach Conjecture (GC) and the Polignac Conjecture (PC) are true.
PRIME WORK (PW):
(1) There are infinitely many more positive integers (even or odd) than there are prime numbers, or prime numbers have a zero density relative to the positive integers according to the Prime Number Theorem (PNT).
(2) Prime numbers generate the positive even integers so efficiently according to the Prime Number Theorem (PNT) that gaps between two consecutive prime numbers increase in size without bound if and only if the Goldbach Conjecture (GC) and the Polignac Conjecture (PC) are true.
(3) Prime Parity Law: (PPL)
π( e = m*g = 1 + [tex]p_{2n }[/tex] ) = 2 * π( g = 1 + [tex]p_{n }[/tex] ) = 2n
where π(*) is the prime-counting function;
[tex]p_{n }[/tex] > 2 and [tex]p_{2n }[/tex] are odd prime numbers;
2 < m ≤ 3
where one is unit prime; and as g → ∞, m → 2.
*****
"Pure mathematics is, in its way, the poetry of logical ideas. One seeks the most general ideas of operation which will bring together in simple, logical and unified form the largest possible circle of formal relationships. In this effort toward logical beauty, spiritual formulas are discovered necessarily for the deeper penetration into the laws of nature." -- Albert Einstein.
*****
Reference links:
Goldbach Conjecture, https://en.wikipedia.org/wiki/Goldbach%27s_conjecture;
Polignac Conjecture, https://en.wikipedia.org/wiki/Polignac%27s_conjecture.
David Cole
aka primework123
*****
Users browsing this forum: No registered users and 0 guests