Mathematics for Incompletely Predictable Problems: Spin-Offs from Applying Information-Complexity Conservation to Sieve of Eratostheness
John Yuk Ching Ting · viXra · 2019
Mathematics for Incompletely Predictable Problems makes all mathematical arguments valid and complete in our previous paper (based on first key step of converting Riemann zeta function into its continuous format version) and this current paper (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 perfectly 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.