Authors: John Ting
Mathematics for Incompletely Predictable Problems makes all mathematical arguments valid and complete in [previous] Paper 1 (based on first key step of converting Riemann zeta function into its continuous format version) and [current] Paper 2 (based on second key step of applying Information-Complexity conservation to Sieve of Eratosthenes). Nontrivial zeros and two types of Gram points calculated using this function plus prime and composite numbers computed using this Sieve are defined as Incompletely Predictable entities. Euler product formula alternatively and exactly represents Riemann zeta function but utilizes product over prime numbers (instead of summation over natural numbers). Hence prime numbers are encoded in this function demonstrating deep connection between them. Direct spin-offs from first step consist of proving Riemann hypothesis and explaining manifested properties of both Gram points, and from second step consist of proving Polignac's and Twin prime conjectures. These mentioned open problems are defined as Incompletely Predictable problems.
Comments: 15 Pages. Proofs for Polignac's and Twin Prime conjectures
[v1] 2019-09-29 17:17:10
Unique-IP document downloads: 11 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.