Related papers: A double-inductive proof of Moessner's theorem

In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.

In this note, we give an alternate proof of the multinomial theorem using a probabilistic approach. Although the multinomial theorem is basically a combinatorial result, our proof may be simpler for a student familiar with only basic…

We give a simple direct proof of Fermat's two squares theorem. Our argument uses no intricate notions or ideas; one might say that it is a proof by careful bookkeeping. As such, the proof may be particularly easy to comprehend by students…

The leading idea of the paper is to treat the theorem of Wigner with methods inspired by geometry. The exercise mentionned in the title has two functions: On the one hand it can serve as a pedagogical text in order to make the reader…

We present simple and direct proof to an important case of Nash-Moser-Ekeland theorem.

Seventy years on, Moessner's theorem and Moessner's process -- i.e., the additive computation of integral powers -- continue to fascinate. They have given rise to a variety of elegant proofs, to an implementation in hardware, to…

We give a simple proof of the Fourier Inversion Theorem, using the methods of nonstandard analysis.

In this paper we give a mathematical proof of Dodgson algorithm [1]. Recently Zeilberger [2] gave a bijective proof. Our techniques are based on determinant properties and they are obtained by induction.

I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.

We give a short proof of Stein's universal multiplier theorem, purely by probabilistic methods, thus avoiding any use of harmonic analysis techniques (complex interpolation or transference methods).

We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.

We present a simple inductive proof of the Lagrange Inversion Formula.

In this note we show that any proof of Wallis's formula or of the probability integral formula proves both assertions.

In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.

The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.

In the current note, we present a new, short proof of the famous AM-GM-HM inequality using only induction and basic calculus.

We present a short new proof of Cobham's theorem without using Kronecker's approximation theorem, making it suitable for generalization beyond automatic sequences.

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.

We present a simple short proof of the Fundamental Theorem of Algebra, without complex analysis and with a minimal use of topology. It can be taught in a first year calculus class.

The aim of this short note is to present an elementary, self-contained, and direct proof for the classical Lebesgue decomposition theorem.