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

We give another proof of a theorem of Fife - understood broadly as providing a finite automaton that gives a complete description of all infinite binary overlap-free words. Our proof is significantly simpler than those in the literature. As…

If no optimal propositional proof system exists, we (and independently Pudl\'ak) prove that ruling out length $t$ proofs of any unprovable sentence is hard. This mapping from unprovable to hard-to-prove sentences powerfully translates facts…

In logic there is a clear concept of what constitutes a proof and what not. A proof is essentially defined as a finite sequence of formulae which are either axioms or derived by proof rules from formulae earlier in the sequence.…

D'Alembert made the first serious attempt to prove the Fundamental Theorem of Algebra (FTA) in 1746. An elementary proof of (FTA) based on the same idea is given in Proofs from THE BOOK. We give a shorter and more transperant version of…

Sophie Germain (1776-1831) was the first woman we know who did important original research in mathematics, specifically in elasticity theory and number theory. Celebrating her semiquincentennial year, we outline Germain's recently unearthed…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

The most important problems for society are describable only in vague terms, dependent on subjective positions, and missing highly relevant data. This thesis is intended to revive and further develop the view that giving non-trivial,…

First a few reformulations of Frankl's conjecture are given, in terms of reduced families or matrices, or analogously in terms of lattices. These lead naturally to a stronger conjecture with a neat formulation which might be easier to…

We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

Recently GM Sofi & SA Shabir [arXive: 1903.01850v2 [math.GM] 6 Mar 2019] made an attempt to prove the Sendov's conjecture. But unfortunately the proof is not correct. In this note, we discuss the fallacy in the proof.

Dummett's argument for intuitionism is well known. There is a concern that the argument proves too much, specifically, that it supports the extreme and apparently incoherent position of strict finitism. The central question is how to…

This is a write-up of a lecture at the level of a physics colloquium. There exists an idealized mathematical formulation of strong interactions which has no free parameters but is known to describe the real world quite accurately. Over the…

We give a short proof of a theorem of J.-E. Pin (theorem 1.1 below), which can be found in his thesis. The part of the proof which is my own (not Pin's) is a complete replacement of the same part in an earlier version of this paper.

Linear logic was conceived in 1987 by Girard and, in contrast to classical logic, restricts the usage of the structural inference rules of weakening and contraction. With this, atoms of the logic are no longer interpreted as truth, but as…

In this article, I explain why I abandoned my original plan to write a novel about a mathematician proving Fermat's Last Theorem, letting my protagonist solve the entirely fictional Wild Number Problem instead. I enumerate the steps that…

Wiles' work on Fermat's last Theorem highlighted the power of $p$-adic methods to prove the existence of analytic continuations of $\zeta$ and $L$ functions. These methods have become considerably more sophisticated in recent years, and…

Mathematical theorem proving is an important testbed for large language models' deep and abstract reasoning capability. This paper focuses on improving LLMs' ability to write proofs in formal languages that permit automated proof…

A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…

Comments about the paper by Elsholz, Fermat's last theorem implies Euclid's infinitude of primes, (2021), and simplification.