English
Related papers

Related papers: A Concise and Direct Proof of "Fermat's Last Theor…

200 papers

We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…

History and Overview · Mathematics 2007-05-23 Mark B. Villarino

In this paper, we begin the study of the Fermat equation $x^n+y^n=z^n$ over real biquadratic fields. In particular, we prove that there are no non-trivial solutions to the Fermat equation over $\mathbb{Q}(\sqrt{2},\sqrt{3})$ for $n\geq 4$.

Number Theory · Mathematics 2025-02-26 Maleeha Khawaja , Frazer Jarvis

In a recent talk of Robbert Fokkink, some conjectures related to the infinite Tribonacci word were stated by the speaker and the audience. In this note we show how to prove (or disprove) the claims easily in a "purely mechanical" fashion,…

Combinatorics · Mathematics 2022-10-11 Jeffrey Shallit

We give a sufficient and necessary condition for a p-adic integer to have p-th root in the ring of p-adic integers. The same condition holds clearly for residues modulo p^k. We give a proof that Fermat's last theorem is false for p-adic…

Number Theory · Mathematics 2007-08-17 Alfonso Di Bartolo , Giovanni Falcone

Several recent results bring into focus the superintuitionistic nature of most notions of proof-theoretic validity, but little work has been done evaluating the consequences of these results. Proof-theoretic validity claims to offer a…

Logic · Mathematics 2023-05-17 Will Stafford

In a recent paper, Freitas and Siksek proved an asypmtotic version of Fermat's Last Theorem for many totally real fields. We prove an extension of their result to generalized Fermat equations of the form $A x^p+B y^p+ C z^p=0$, where $A$,…

Number Theory · Mathematics 2015-05-25 Heline Deconinck

We give a modern account of Agafonov's original proof of his eponymous theorem. The original proof was only reported in Russian in a journal not widely available, and the work most commonly cited in western literature is instead the English…

Discrete Mathematics · Computer Science 2022-01-21 Thomas Seiller , Jakob Simonsen

The purpose of this short note is to present a simplified proof of Serre's modularity conjecture using the strong modularity lifting results currently available. This second version includes extra details on definitions and proofs than the…

Number Theory · Mathematics 2022-05-04 Luis Victor Dieulefait , Ariel Martín Pacetti

The proofs first generated by automated theorem provers are far from optimal by any measure of simplicity. In this paper I describe a technique for simplifying automated proofs. Hopefully this discussion will stimulate interest in the…

Logic in Computer Science · Computer Science 2021-01-19 Michael Kinyon

It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…

Logic in Computer Science · Computer Science 2017-01-11 Jean Gallier

The no-supervenience theorem limits the capacity of physicalist theories to provide a comprehensive account of human consciousness. The proof of the theorem is difficult to formalize because it relies on both alethic and epistemic notions…

Neurons and Cognition · Quantitative Biology 2024-11-13 Cathy M Reason

Wiles' proof of Fermat's last theorem initiated a powerful new approach towards the resolution of certain Diophantine equations over $\mathbb{Q}$. Numerous novel obstacles arise when extending this approach to the resolution of Diophantine…

Number Theory · Mathematics 2024-01-09 Maleeha Khawaja , Samir Siksek

Mathematical proofs should be paired with formal proofs, whenever feasible.

History and Overview · Mathematics 2019-04-15 Christoph Benzmüller

Proofs that a smooth morphism is flat available in the literature are long and difficult. We give a short proof of this fact.

Algebraic Geometry · Mathematics 2016-02-15 Jesús Conde-Lago

Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…

Number Theory · Mathematics 2016-01-20 Nuno Freitas , Samir Siksek

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…

History and Overview · Mathematics 2019-12-17 Po-Shen Loh

The Modular Group provides simple proofs of Fermat's representations: X^2+Y^2 for primes congruent to 1 (mod 4) and by X^2+3Y^2 for primes congruent to 1 (mod 3)

Number Theory · Mathematics 2021-09-22 Robert J Sibner

It is well known that the strong subadditivity theorem is hold for classical system, but it is very difficult to prove that it is hold for quantum system. The first proof of this theorem is due to Lieb by using the Lieb's theorem. Here we…

Quantum Physics · Physics 2007-05-23 Yong-Jian Han , Yong-Sheng Zhang , Guang-Can Guo

We introduce and elaborate a novel formalism for the manipulation and analysis of proofs as objects in a global manner. In this first approach the formalism is restricted to first-order problems characterized by condensed detachment. It is…

Logic in Computer Science · Computer Science 2024-10-31 Christoph Wernhard , Wolfgang Bibel

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
‹ Prev 1 3 4 5 6 7 10 Next ›