Related papers: Fermat's Last Theorem and its another Proof

The Bertrand's theorem can be formulated as the solution of an inverse problem for a classical unidimensional motion. We show that the solutions of these problems, if restricted to a given class, can be obtained by solving a numerical…

We will be presenting two theorems in this paper. The first theorem, which is a new result, is about the non-existence of integer solutions of the cubic diophantine equation. In the proof of this theorem we have used some known results from…

A proof is given of Rosenthal's \(\ell_1\) theorem.

In this note, we present a simple directed graph proof of Sharkovsky's theorem.

Parikh's theorem is a fundamental result of the formal language's theory. There had been published many proofs and many papers claimed to provide a simplified proof, but most of them are long and still complicated. We provide the proof that…

This paper proposes a totally constructive approach for the proof of Hilbert's theorem on ternary quartic forms. The main contribution is the ladder technique, with which the Hilbert's theorem is proved vividly.

The import of Bell's Theorem is elucidated. The theorem's proof is illustrated both heuristically and in mathematical detail in a pedagogical fashion. In the same fashion, it is shown that the proof is correct mathematically, but it doesn't…

We give a proof of the o-minimal version of the Whitney Extension Theorem simplified as compared to the original ones. A new simplifying ingredient is a definable variant of Urysohn's lemma for class $\mathcal{C}^q$ (see Section 3).

We provide compelling evidence that all Fermat primes were already known to Fermat.

The original proof of the Sharkovsky theorem is presented in full detail. The proof should be accessible to readers with basic Real Analysis background. Although nowadays there are several alternative proofs of this classical result, we…

This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and…

We construct a computable, computably categorical field of infinite transcendence degree over the rational numbers, using the Fermat polynomials and assorted results from algebraic geometry. We also show that this field has an intrinsically…

Conditions for Bayesian posterior robustness have been examined in recent literature. However, many of the proofs seem to be long and complicated. In this paper, we first summarize some basic lemmas that have been applied implicitly or…

This paper develops a framework of algebra whereby every Diophantine equation is made quickly accessible by a study of the corresponding row entries in an array of numbers which we call the Newtonian triangles. We then apply this framework…

We give an elementary and constructive proof for a theorem of de Smit et Lenstra. Note: In version 1, was missing the proof that "completely secant" implies "1-secant"

We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…

We show that a simple and straightforward rational approximation to the Thomas--Fermi equation provides the slope at origin with unprecedented accuracy. We compare present approach with other available ones.

We give a simple proof of the exponential de Finetti theorem due to Renner. Like Renner's proof, ours combines the post-selection de Finetti theorem, the Gentle Measurement lemma, and the Chernoff bound, but avoids virtually all…

In comparison with the previous version of this paper, the Introduction is slightly changed and some minor typos are deleted. All results are unchanged.

We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…