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 (or its proxy Dirichlet eta function) together with prime and composite numbers from Sieve of Eratosthenes are Incompletely Predictable entities. Correct 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 result in direct spin-offs from first key step consisting of proving Riemann hypothesis (and explaining two types of Gram points), and second key step consisting of proving Polignac's and Twin prime conjectures. We justify our Reverse-Engineered proofs and explanations.
Comments: 50 Pages. Reverse-engineered Rigorous proofs for Riemann hypothesis (and explaining the two types of Gram points) and Polignac's and Twin prime conjectures.
[v1] 2019-12-03 20:13:14
[v2] 2019-12-05 00:46:19
[v3] 2019-12-07 20:47:47
[v4] 2019-12-11 04:14:28
[v5] 2019-12-12 06:34:16
[v6] 2019-12-12 22:52:47
[v7] 2019-12-14 05:05:34
[v8] 2019-12-15 20:00:34
[v9] 2019-12-16 21:54:51
[vA] 2019-12-19 16:01:59
Unique-IP document downloads: 21 times
Vixra.org 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. Vixra.org 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.