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

We give an elementary and self-contained proof of the uniformization theorem for non-compact simply-connected Riemann surfaces.

There are proven few analogues of the Theorem of Moser using The Approximation Theorem of Artin.

We give a new elementary proof of Landau's Prime Ideal Theorem. The proof is an extension of Richter's proof of the Prime Number Theorem. The main result contains other results related to the equidistribution of the prime ideal counting…

We give a short proof of a strengthening of the Maximal Ergodic Theorem which also immediately yields the Pointwise Ergodic Theorem.

We suggest an alternative proof of a theorem due to Lambek and Moser using a perceptible model.

We present an extremely simple sorting algorithm. It may look like it is obviously wrong, but we prove that it is in fact correct. We compare it with other simple sorting algorithms, and analyse some of its curious properties.

In this short note, we revisit Zeilberger's proof of the classical matrix-tree theorem and give a unified concise proof of variants of this theorem, some known and some new.

Elementary proofs of unique factorization in rings of arithmetic functions using a simple variant of Euclid's proof for the fundamental theorem of arithmetic.

We present an alternative proof of Perron's theorem, which is probabilistic in nature. It rests on the representation of the Perron eigenvector as a functional of the trajectory of an auxiliary Markov chain.

This note presents a proof of P\'olya's random walk theorem using classical methods from special function theory and asymptotic analysis.

We provide a proof of the Borwein Conjecture using analytic methods.

Following work by I. Anderson, in this note we present a formulation of Noether's Second Theorem that is valid on any natural bundle.

We give a direct, purely arithmetical and elementary proof of the strong normalization of the cut-elimination procedure for full (i.e. in presence of all the usual connectives) classical natural deduction.

We give an elementary probabilistic proof of a binomial identity. The proof is obtained by computing the probability of a certain event in two different ways, yielding two different expressions for the same quantity.

Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…

The purpose of the paper is to present an short proof of the Chuang's inequality.

In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…

We give a simple proof of a recently result concerning Hardy $q$-inequalities.

We consider the immediate consequence of an arguable addition to the standard Deduction Theorems of first order theories.

A gem of classical probability, the Berry-Esseen theorem provides a non-asymptotic form of the central limit theorem. This note gives a friendly and intuitive exposition of the classical Fourier-analytic proof of Esseen's smoothing…