Related papers: Collatz conjecture becomes theorem
We explore the consequences of layering a Lambek proof system over an arbitrary (constraint) logic. A simple model-theoretic semantics for our hybrid language is provided for which a particularly simple combination of Lambek's and the proof…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
In 20th century mathematics, the field of topology, which concerns the properties of geometric objects under continuous transformation, has proved surprisingly useful in application to the study of discrete mathematics, such as…
Following suggestions of T. H. Koornwinder, we give a new proof of Kummer's theorem involving Zeilberger's algorithm, the WZ method and asymptotic estimates. In the first section, we recall a classical proof given by L. J. Slater. The…
In this paper, we investigate a class of Collatz-like problems associated with weakly and strongly admissible triplets of integers. This framework extends the classical Collatz mapping, providing a systematic method for generating triplets…
We present an elementary proof of Fermat's Last Theorem. No ancillary results are used, not even the most basic ones. The proof directly leads to a contradiction of the Fermat equation in the set of integers.
We describe an algorithm which verifies whether linear algebraic cycles of the Fermat variety generate the lattice of Hodge cycles. A computer implementation of this confirms the integral Hodge conjecture for quartic and quintic Fermat…
"Goldbach's Conjecture" proven by analysis of how all combinations of the odd primes, summed in pairs, generates all of the even numbers.
In sequent calculi, cut elimination is a property that guarantees that any provable formula can be proven analytically. For example, Gentzen's classical and intuitionistic calculi LK and LJ enjoy cut elimination. The property is less…
Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm…
The Collatz problem is one of many names (the Collatz Problem, the Syracuse Problem, the Hailstone Problem, the 3x+1 problem). Most commonly, however, the problem goes by either the 3x+1 problem or the Collatz problem. In addition to having…
The Collatz problem with $3x+k$ is revisited. Positive and negative limit cycles are given up to k=9997 starting with $x_0=-2\cdot10^7...+2\cdot10^7$. A simple relation between the probability distribution for the Syracuse iterates for…
Bell's theorem is a fundamental result in quantum mechanics: it discriminates between quantum mechanics and all theories where probabilities in measurement results arise from the ignorance of pre-existing local properties. We give an…
We extend the Koszul duality theory of associative algebras to algebras over an operad. Recall that in the classical case, this Koszul duality theory relies on an important chain complex: the Koszul complex. We show that the cotangent…
In a recent historical overview, Cristian S. Calude, Elena Calude, and Solomon Marcus identify eight stages in the development of the concept of a mathematical proof in support of an ambitious conjecture: we can express classical…
We extend Elitzur's theorem to systems with symmetries intermediate between global and local. In general, our theorem formalizes the idea of {\it dimensional reduction}. We apply the results of this generalization to many systems that are…
This paper is concerned with the algebraic K-theory of locally convex algebras stabilized by operator ideals, and its comparison with topological K-theory. We show that the obstruction for the comparison map between algebraic and…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
Bell's theorem is reformulated and proved in the pure mathematical terms of automata theory, avoiding any physical or ontological notions. It is stated that no pair of finite probabilistic sequential machines can reproduce in its output the…
We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata operating on infinite objects. Let F be any set functor that preserves…