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

We give a short straightforward proof for the bound of the reminder term in the Taylor theorem. The proof uses only induction and the fact that $f'\geq 0$ implies the monotonicity of $f$, so it might be an attractive proof to give to…

The Boros-Moll polynomials arise in the evaluation of a quartic integral. The original double summation formula does not imply the fact that the coefficients of these polynomials are positive. Boros and Moll proved the positivity by using…

This article presents a concise proof of the famous Benford's law when the distribution has a Riemann integrable probability density function and provides a criterion to judge whether a distribution obeys the law. The proof is intuitive and…

We record an explicit proof of the theorem that lifts a two-variable adjunction to the arrow categories of its domains.

We obtain a system of relations between linear Hodge integrals. As an application, we show that its first non-trivial relation implies the Witten's Conjecture/Kontsevich Theorem.

We illustrate the concept of mathematical proof.

An inductive inference system for proving validity of formulas in the initial algebra $T_{\mathcal{E}}$ of an order-sorted equational theory $\mathcal{E}$ is presented. It has 20 inference rules, but only 9 of them require user interaction;…

We establish a simple identity and using it we find a new proof of a result of Kloosterman.

In this note, we provide a short and robust proof of the Clausius-Mossotti formula for the effective conductivity in the dilute regime, together with an optimal error estimate. The proof makes no assumption on the underlying point process…

We complete statement and proof for B. Moss\'e's unilateral recognizability theorem. We also provide an algorithm for deciding the unilateral non-recognizability of a given primitive substitution.

We reformulate Mesiar's hypothesis [Possibility measures, integration and fuzzy possibility measures, Fuzzy Sets and Systems 92 (1997) 191-196], which as such was shown to be untrue by Murofushi [Two-valued possibility measures induced by…

In this short paper, we will give a simple and transcendental proof for Mok's theorem of the generalized Frankel conjecture. This work is based on the maximum principle in \cite{BS2} proposed by Brendle and Schoen.

A simple proof of Atanassov's Conjecture is presented. Atanassov's Conjecture is a generalization of Sperner's Lemma, a lemma which has been used to prove Brouwer's Fixed Point Theorem, among other fixed point theorems. The proof of…

We present a geometric proof for the duality theorem of linear programming. Besides being self-contained and simple, the present approach also provides a transparent way for understanding this fundamental result.

Based on various strategies and a new general doubling operator, we obtain several simple proofs of the celebrated Sharkovsky's cycle coexistence theorem. A simple non-directed graph proof which is especially suitable for a calculus course…

In this article we propose a revisitation of the well-known argument principle that may lead to the solution of the Riemann hypothesis. We are looking for collaborators.

I give a proof of the uniform boundedness theorem that is elementary (i.e. does not use any version of the Baire category theorem) and also extremely simple.

In this note, we give a simple, counting based proof of Fisher's Inequality that does not use any tools from linear algebra.

Using multisets, we develop novel techniques for mechanizing the proofs of the synthesis conjectures for list-sorting algorithms, and we demonstrate them in the Theorema system. We use the classical principle of extracting the algorithm as…

In a previous paper, the author proved the existence of extremal function for the Moser-Trudinger inequality on a compact manifold. In the this paper, we will give a new proof of one of the key proposition.