Related papers: A Concise and Direct Proof of "Fermat's Last Theor…
The purpose of this note is to discuss a few lines appearing in the work of late Fantappi\`e. They concern the proof of rigidity of a specific real semisimple Lie algebra: ${\mathfrak O}(4,1)$. Our intention is to discuss to what extent…
The paper gives a unified and simple proof of both theorems and Cousin's theorem.
Let F be a totally real number field of odd degree. We prove several purely local criteria for the asymptotic Fermat's Last Theorem to hold over F, and also for the non-existence of solutions to the unit equation over F. For example, if 2…
Two centuries ago, Sophie Germain began to work on her grand plan to prove the theorem of Fermat, the famous conjecture that $x^n + y^n = z^n$ is impossible for nonzero integral values of $x$, $y$, and $z$, when $n > 2$. At that time, this…
This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…
In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…
The first case of Fermat's Last Theorem for a prime exponent $p$ can sometimes be proved using the existence of local obstructions. In 1823, Sophie Germain has obtained an important result in this direction by establishing that, if $2p+1$…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…
Matrix rigidity is a notion put forth by Valiant as a means for proving arithmetic circuit lower bounds. A matrix is rigid if it is far, in Hamming distance, from any low rank matrix. Despite decades of efforts, no explicit matrix rigid…
The divisibility restrictions in the famous equation a n+bn=cn in Fermat Last Theorem (FLT, 1637) is analyzed how it selects out many triples to be Fermat triple (i.e. solutions) if n greater than 2, decreasing the cardinality of Fermat…
We give a generalization of Fujisawa's theorem in [F]. Our proof of the generalized theorem is purely algebraic and it is simpler than his proof.
Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…
The SOM algorithm is very astonishing. On the one hand, it is very simple to write down and to simulate, its practical properties are clear and easy to observe. But, on the other hand, its theoretical properties still remain without proof…
In fuzzy group theory many versions of the well-known Lagrange's theorem have been studied. The aim of this article is to investigate the converse of one of those results. This leads to an interesting characterization of finite cyclic…
In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
Since the diagonal lemma plays a key role in the proof of the main limitative theorems of logic, its proof could shed light on the very essence of these fundamental theorems. Yet the lemma is often characterized as one of those important…
We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David…
In this paper we obtain bounds for integer solutions of quadratic polynomials in two variables that represent a natural number. Also we get some results on twin prime numbers. In addition, we use linear functionals to prove some results of…