This paper presents in the ninth improved and extended edition a deeper understanding of the quantification of mathematical infinity. Concept of cardinality as well as concepts of open and closed sets are overcome, and the measure problem is solved. The...
More
This paper presents in the ninth improved and extended edition a deeper understanding of the quantification of mathematical infinity. Concept of cardinality as well as concepts of open and closed sets are overcome, and the measure problem is solved. The number of algebraic numbers is determined. In the field of linear programming, the well-known exponential simplex algorithm with a perturbation method for overcoming the problem of multiple vertices is confronted with the polynomial centre method. Roth's theorem, abc conjecture as well as the generalised Riemann hypothesis are disproved, Goldbach's strong conjecture and Collatz conjecture are proved. The tightened prime number theorem and the equality of the complexity classes P and NP are elementarily proved.
Less
