Related papers: An Unimaginative Proof of Fermat's Two Squares The…
The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…
We give a proof of Fermat's little theorem which does not use nor arithmetic(Euclidean algorithm) neither algebra (group theory), but it rather employs the field of the formal power series Q((x)). The note is an example of a mathematical…
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
Every odd prime number p can be written in exactly (p + 1)/2 ways as a sum ab+cd of two ordered products ab and cd such that min(a, b) > max(c, d). An easy corollary is a proof of Fermat's Theorem expressing primes in 1 + 4N as sums of two…
The recently developed proof of Fermat's Last Theorem is very lengthy and difficult, so much so as to be beyond all but a small body of specialists. While certainly of value in the developments that resulted, that proof could not be, nor…
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.
This article provides a simple proof of the quadratic formula, which also produces an efficient and natural method for solving general quadratic equations. The derivation is computationally light and conceptually natural, and has the…
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
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…
An alternative form of Fermats equation[1] is proposed. It represents a portion of the identity that includes three terms of Fermats original equation. This alternative form permits an elementary and compact proof of the first case of…
An elementary proof of Bertrand's theorem is given by examining the radial orbit equation, without needing to solve complicated equations or integrals.
We show that an elementary proof of Fermat's Last Theorem (FLT) exists. Our paper also extends the scope of FLT from integers to all rational numbers.
It is an original method based on systems of prameters represented by reals which obey to an infinite descent (convergent sequences). We define calculus of quotients and they conduct quickly to a consequent result. Our own scepticism made…
Using Fermat's two squares theorem and properties of cyclotomic polynomials, we prove assertions about when numbers of the form $a^{n}+1$ can be expressed as the sum of two integer squares. We prove that $a^n + 1$ is the sum of two squares…
We take the perspective of an advanced high school student trying to understand the proof of Fermat's Last Theorem for the first time. We collect definitions and statements needed to summarise how Fermat's Last Theorem was first proved in…
In this note, we present a simple directed graph proof of Sharkovsky's theorem.
In this short article we do not prove Fermat's last theorem. We show that the number 2 is an exceptional number in this theorem.
We present an astonishingly simple and elegant proof of the celebrated Basel problem.
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…
We present a proof of Moessner's theorem by double induction, using only basic rules of arithmetic. No prerequisite knowledge is assumed. Familiarity with summation is advised.