English
Related papers

Related papers: Fermat's Last Theorem and Catalan's Conjecture in …

200 papers

Fermat's Last Theorem is proved by using the philosophical and mathematical knowledge of 1637 when the French mathematician Pierre de Fermat claimed to have a truly marvelous proof of his conjecture. Our approach consists of setting three…

General Mathematics · Mathematics 2022-04-13 Hector Ivan Nunez

We formalise the proof of the first case of Fermat's Last Theorem for regular primes using the \emph{Lean} theorem prover and its mathematical library \emph{mathlib}. This is an important 19th century result that motivated the development…

Logic in Computer Science · Computer Science 2023-05-23 Alex J. Best , Christopher Birkbeck , Riccardo Brasca , Eric Rodriguez Boidi

The ABC conjecture implies many conjectures and theorems in number theory, including the celebrated Fermat's Last Theorem. Mason-Stothers Theorem is a function field analogue of the ABC conjecture that admits a much more elementary proof…

Logic in Computer Science · Computer Science 2025-09-29 Jineon Baek , Seewoo Lee

Recent results of Freitas, Kraus, Sengun and Siksek, give sufficient criteria for the asymptotic Fermat's Last Theorem to hold over a specific number field. Those works in turn build on many deep theorems in arithmetic geometry. In this…

Number Theory · Mathematics 2019-02-22 Nuno Freitas , Alain Kraus , Samir Siksek

Let $K$ be a totally real field. By the asymptotic Fermat's Last Theorem over $K$ we mean the statement that there is a constant $B_K$ such that for prime exponents $p>B_K$ the only solutions to the Fermat equation $a^p + b^p + c^p = 0$…

Number Theory · Mathematics 2015-08-19 Nuno Freitas , Samir Siksek

Proving proof-size lower bounds for $\mathbf{LK}$, the sequent calculus for classical propositional logic, remains a major open problem in proof complexity. We shed new light on this challenge by isolating the power of structural rules,…

Logic in Computer Science · Computer Science 2026-02-02 Amirhossein Akbar Tabatabai , Raheleh Jalali

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.

General Mathematics · Mathematics 2021-10-13 YangGon Kim , SooGon Kim , BumSeok Jeon , SeungKon Kim , ChangKon Kim

Fermat Last Theorem, which inspired mathematicians during 300 years, is proved by Andrew Wiles. Even among mathematicians there is a narrow circle of specialists, who can read this proof and understand all details. Is it a reason for…

General Mathematics · Mathematics 2007-05-23 Ruslan A. Sharipov

In the present paper we study, in a mathematically non-formal way, the validity of the Fermat's Last Theorem (FLT) by generalizing the usual procedure of extracting the square root of non convenient objects initially introduced by P. A. M.…

General Mathematics · Mathematics 2016-07-14 Martín Arteaga

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

Logic · Mathematics 2025-08-28 Zachiri McKenzie

Let $K$ be a totally real number field. For all prime number $p\geq 5$, let us denote by $F_p$ the Fermat curve of equation $x^p+y^p+z^p=0$. Under the assumption that $2$ is totally ramified in $K$, we establish some results about the set…

Number Theory · Mathematics 2019-03-27 Alain Kraus

Let $p$ be an odd prime number. Using modular arguments, we give an easy testable condition which allows often to prove Fermat's Last Theorem over the quadratic field ${\bf Q}(\sqrt{5})$ for the exponent $p$. It is related to the Wendt's…

Number Theory · Mathematics 2014-10-10 Alain Kraus

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.

General Mathematics · Mathematics 2020-07-22 Miguel Antonio Marano Calzolari

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

Combinatorics · Mathematics 2021-05-25 Keith Frankston , Jeff Kahn , Jinyoung Park

From some works of P. Furtw\"angler and H.S. Vandiver, we put the basis of a new cyclotomic approach to Fermat's last theorem for p>3 and to a stronger version called SFLT, by introducing governing fields of the form Q(exp(2 i pi/q-1)) for…

Number Theory · Mathematics 2011-04-14 Georges Gras , Roland Quême

Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…

General Mathematics · Mathematics 2009-09-14 Shaohua Zhang

We propose a new approach at Fermat's Last Theorem (FLT) solution: for each FLT equation we associate a polynomial of the same degree. The study of the roots of the polynomial allows us to investigate the FLT validity. This technique,…

General Mathematics · Mathematics 2012-11-12 D. De Pedis

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…

General Mathematics · Mathematics 2014-09-26 Anatoly A. Grinberg

This article deals with a conjecture, introduced in [GQ] (hereinafter $SFLT2$), which generalizes the second case of Fermat's Last Theorem: {\it Let $p>3$ be a prime. The diophantine equation $\frac{u^p+v^p}{u+v}=w_1^p$ with $u,v,u+v,…

Number Theory · Mathematics 2013-05-30 Roland Quême

For substructural logics with contraction or weakening admitting cut-free sequent calculi, proof search was analyzed using well-quasi-orders on $\mathbb{N}^d$ (Dickson's lemma), yielding Ackermannian upper bounds via controlled bad-sequence…

Logic in Computer Science · Computer Science 2026-02-24 A. R. Balasubramanian , Vitor Greati , Revantha Ramanayake