Related papers: Wilson's and Wolstenholme's Theorems
In measure theory, Steinhaus theorem is a result that deals with a property of the difference between two sets of positive measure. We give a simple elementary proof of the result.
A few years ago Fritz Gesztesy raised the issue of whether there was a composition rule for the Witten index analogous to that satisfied by Fredholm operators. In this note we prove a result in this direction and provide an application to…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
We give a simple proof of Strassen's theorem on stochastic dominance using linear programming duality, without requiring measure-theoretic arguments. The result extends to generalized inequalities using conic optimization duality and…
We give a proof for the fundamental theorem of algebra,using the Fredholm index phenomena
We give a remarkably elementary proof of the Brouwer fixed point theorem. The proof is verifiable for most of the mathematicians.
There are several proofs of the Fundamental Theorem of Algebra, mainly using algebra, analysis and topology. In this article, we have shown that the Fundamental Theorem of Algebra can be proved using Nevanlinna's first fundamental theorem…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
Given a prime p and a positive integer m satisfying a certain inequality, the converse of Wolstenholme's Theorem is shown to hold for the product mp^k where k is any positive integer, generalizing a result by Helou and Terjanian.
In a previous article [1] we presented an argument to obtain (or rather infer) Born's rule, based on a simple set of axioms named "Contexts, Systems and Modalities" (CSM). In this approach there is no "emergence", but the structure of…
We provide elementary proof of several congruences involving single sum and multisums of binomial coefficients.
By changing variables in a suitable way and using dominated convergence methods, this note gives a short proof of Stirling's formula and its refinement.
Wedderburn's theorem on the structure of finite dimensional semisimple algebras is proved by using minimal prerequisites.
We show that the virial theorem provides a useful simple tool for approximating nonlinear problems. In particular we consider conservative nonlinear oscillators and a bifurcation problem. In the former case we obtain the same main result…
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 proof of the o-minimal version of the Whitney Extension Theorem simplified as compared to the original ones. A new simplifying ingredient is a definable variant of Urysohn's lemma for class $\mathcal{C}^q$ (see Section 3).
In this paper we give two theorems from the Propositional Calculus of the Boolean Logic with their consequences and applications and we prove them axiomatically.
We revisit the proof of the de Moivre--Laplace theorem, which is the ancestor of the central limit theorem for the binomial distribution. Our goal is to provide a proof that can be reasonably presented to undergraduate students within a…
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…
The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…