Related papers: A Concise and Direct Proof of "Fermat's Last Theor…
In this short note we argue that Thomas-Fermi Theory the simplest of all density functional theories, although failing to explain features such as binding or stability of negative ions, is surprisingly accurate in estimating sizes of atoms.…
Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…
Mermin states in a recent paper that his nontechnical version of Bell's theorem stands and is not invalidated by time and setting dependent instrument parameters as claimed in one of our previous papers. We identify a number of…
In a recent article by Farah and the authors, a strong lifting theorem was proved for a class of coordinate-respecting maps between reduced products of discrete structures, hereby working under mild Forcing Axioms. We generalise this…
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…
A very simple but useful almost sure convergence theorem of probability is given.
Can any element in a sufficiently large finite field be represented as a sum of two $d$th powers in the field? In this article, we recount some of the history of this problem, touching on cyclotomy, Fermat's last theorem, and diagonal…
Based on the results people have obtained, we try to prove the Jacobian conjecture, but there is a gap in the proof.
We acuminate the idea of a final theory of physics in order to analyze its logical implications and consequences. It is argued that the rationale of a final theory is the principle of sufficient reason. This implies that a final theory of…
Let $P_1,P_2,P_3$ be three given points in $\mathbf{R}^2$, and $P$ be an arbitrary point in $\mathbf{R}^2$. The classical Fermat's problem to Torricelli asks for the location of the point $P$ such that $|PP_1|+|PP_2|+|PP_3|$ is a minimum.…
We give a direct and elementary proof of the theorem on formal functions by studying the behaviour of the Godement resolution of a sheaf of modules under completion.
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.
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.
Frege's definition of the real numbers, as envisaged in the second volume of \textit{Grundgesetze der Arithmetik}, is fatally flawed by the inconsistency of Frege's ill-fated \textit{Basic Law V}. We restate Frege's definition in a…
For a long time, Collatz Conjecture has been assumed to be true, although a formal proof has eluded all efforts to date. In this article, evidence is presented that suggests such an assumption is incorrect. By analysing the stopping times…
Andrew Wiles' proof of Fermat's Last Theorem, with an assist from Richard Taylor, focused renewed attention on the foundational question of whether the use of Grothendieck's Universes in number theory entails that the results proved…
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…
Alpoge and Granville (separately) gave novel proofs that the primes are infinite that use Ramsey Theory. In particular, they use Van der Waerden's Theorem and some number theory. We prove the primes are infinite using an easier theorem from…
The purpose of this note is to give an accessible proof of Moliens Theorem in Invariant Theory, in the language of today's Linear Algebra and Group Theory, in order to prevent this beautiful theorem from being forgotten.
The classical Technical Lemma for congruences is not difficult to prove but it is very efficient in its applications. We present here a Technical Lemma for congruences on \emph{finite lattices}. This is not difficult to prove either but it…