Related papers: A Counting Proof of the Graham Pollak Theorem
We settle in the affirmative the Graham-Sloane conjecture.
We give a new proof of Lucas' Theorem in elementary number theory.
We present a probabilistic proof of Euler's pentagonal number theorem based on a shuffling model.
We give an infinite number of proofs of Pythagoras theorem.Some can be classified as `self-similar proofs'.
We provide a simple proof of Kamp's theorem.
We present a new proof of the celebrated quadratic reciprocity law. Our proof is based on group theory.
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…
A proof is given of Rosenthal's \(\ell_1\) theorem.
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
This paper presents a proof of Gallai's Theorem, adapted from A. Soifer's presentation in The Mathematical Coloring Book of E. Witt's 1952 proof of Gallai's Theorem.
We give a new proof of Brooks' theorem that immediately implies a strengthening of Brooks' theorem, known as Catlin's theorem.
I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.
We give a probabilistic proof of the orbit-counting lemma.
The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.
We present a short and self-contained proof of the choosability version of Brooks' theorem.
We present a new, elementary, dynamical proof of the prime number theorem.
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.
The aim of this paper is to prove Cotlar's ergodic theorem modeled on the set of primes.
In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.