Related papers: Yet another elementary proof of Morley's theorem

In this short paper we review and extract some features of the Fredholm Alternative problem .

We derive the Gallai-Edmonds Structure Theorem from Hall's Theorem.

In this paper, we present a simple analytic proof of Siegel's theorem that concerns the lower bound of $L(1,\chi)$ for primitive quadratic $\chi$. Our new method compares an elementary lower bound with an analytic upper bound obtained by…

We give a short straightforward proof for the bound of the reminder term in the Taylor theorem. The proof uses only induction and the fact that $f'\geq 0$ implies the monotonicity of $f$, so it might be an attractive proof to give to…

We find a generalization of the Mordell integral and we also establish a set of properties for a generalization of the Mordell integral similar to those in the third author's PhD thesis.

In this note, we present a simpler way to prove the compactness of the closed intervals in simply ordered set with order topology.

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.

Torelli's theorem is proven by the study of the convolution product of the intersection cohomology sheaf of the thetadivisor.

We present a conjecture about partitions, with a very elementary formulation.

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…

Simple and shorter proofs of two Dirac-type theorems involving connectivity are presented.

The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…

We give a generalization of Fujisawa's theorem in [F]. Our proof of the generalized theorem is purely algebraic and it is simpler than his proof.

We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

This article is an introduction to Mordell-Weil theorem. In this article, I introduced some basic properties about ellptic curves and proved the theorem in two different ways.

A short and almost elementary proof of the Boros-F\"uredi-B\'ar\'any-Pach-Gromov theorem on the multiplicity of covering by simplices in $\mathbb R^d$ is given.

This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are…

We settle in the affirmative the Graham-Sloane conjecture.

In this paper, we give a detailed account of Goldfeld's proof of Siegel's theorem. Particularly, we present complete proofs of the nontrivial assumptions made in his paper.