Related papers: An Elementary proof for Bertrand's Postulate
We give a formal Laurent series proof of Andrews's $q$-Dyson Conjecture, first proved by Zeilberger and Bressoud.
In the paper it is demonstrated that Bells theorem is an unprovable theorem.
We present a solution of Exercise 1.2.1 of [2] which yields a short new proof of a key step in one of proofs of Brouwer's fixed point theorem, 1910. A few people asked the author about the details of the solution and they might be…
Legendre's conjecture states that there is a prime number between n^2 and (n+1)^2 for every positive integer n. We consider the following question : for all integer n>1 and a fixed integer k<=n does there exist a prime number such that kn <…
This paper contains a new elementary proof of the Fundamental Theorem of Calculus for the Lebesgue integral. The hardest part of our proof simply concerns the convergence in ${\rm L}^1$ of a certain sequence of step functions, and we prove…
This is an exposition, in 12 pages including all prerequisites and a generalization, of Karamata's little known elementary proof of the Landau-Ingham Tauberian theorem, a result in real analysis from which the Prime Number Theorem follows…
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
We present a criterion that provides an easy sufficient condition in order that a collection of Abelian integrals has the Chebyshev property. This condition involves the functions in the integrand of the Abelian integrals and can be…
A very simple but useful almost sure convergence theorem of probability is given.
We generalize Mertens' product theorem to Chebotarev sets of prime ideals in Galois extensions of number fields. Using work of Rosen, we extend an argument of Williams from cyclotomic extensions to this more general case. Additionally, we…
We give a counting based proof of the Graham Pollak Theorem
We present a new proof of a primality criterion first proved by Emmanuel Vantieghem.
We give a simple proof of Dorronsoro's theorem and use similar ideas to establish an equivalence for embeddings of vector fields.
In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…
Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…
We give a brief historical overview of the famous Pythagoras' theorem and Pythagoras. We present a simple proof of the result and dicsuss some extensions. We follow \cite{thales}, \cite{wiki} and \cite{wiki2} for the historical comments and…
We discuss five ways of proving Chernoff's bound and show how they lead to different extensions of the basic bound.
Bertrand's paradox is a famous problem of probability theory, pointing to a possible inconsistency in Laplace's principle of insufficient reason. In this article we show that Bertrand's paradox contains two different problems: an "easy"…
There are several reformulations of the Vi\`ete's formula for pi that have been reported in the modern literature. In this paper we show another analog to the Vi\`ete's formula for pi by Chebyshev polynomials of the first kind.
We find some extensions of the Kraft-Russell Generic Equivalence Theorem and using it we obtain a simple proof of a result of Dubouloz and Kishimoto.