Number Theory


Mathematics for Incompletely Predictable Problems: Riemann Zeta Function and Sieve of Eratosthenes

Authors: John Yuk Ching Ting

Mathematics for Incompletely Predictable Problems is associated with Incompletely Predictable problems containing Incompletely Predictable entities. Nontrivial zeros and two types of Gram points in Riemann zeta function together with prime and composite numbers from Sieve of Eratosthenes are Incompletely Predictable entities. Valid and complete mathematical arguments for first key step of converting this function into its continuous format version and second key step of applying Information-Complexity conservation to this Sieve are provided. Direct spin-offs from first step consist of proving Riemann hypothesis (and explaining both types of Gram points) and second step consist of proving Polignac's and Twin prime conjectures.

Comments: 41 Pages. Rigorous proofs for Riemann hypothesis (and explaining the two types of Gram points) and Polignac's and Twin prime conjectures.

Download: PDF

Submission history

[v1] 2019-11-05 14:55:47
[v2] 2019-11-09 14:28:05
[v3] 2019-11-11 03:44:55
[v4] 2019-11-15 16:23:48
[v5] 2019-11-18 19:16:28

Unique-IP document downloads: 9 times is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. will not be responsible for any consequences of actions that result from any form of use of any documents on this website.

Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.

comments powered by Disqus