Related papers: A short proof of the error term in Simpson's rule
We give a short and relatively elementary proof of the Hilton-Milner Theorem.
For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…
In this article we give some refinements of Simpson's Rule in cases when it is not applicable in it's classical form i.e., when the target function is not four times differentiable on a given interval. Some sharp two-sided inequalities for…
In this paper, we will give some estimation for the average error of the prime number theorem.
The purpose of this paper is to provide a random version of Simons' inequality.
A short, fairly self-contained proof is given of the Poincar\'e Conjecture. In the previous version there was an error on Page 8. This gap has now been filled.
This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).
In this paper, an inequality of Simpson type for quasi-convex mappings are proved. The constant in the classical Simpson's inequality is improved. Furthermore, the obtained bounds can be (much) better than some recently obtained bounds.…
We present a short and self-contained proof of the choosability version of Brooks' theorem.
We make explicit a theorem of Pintz concerning the error term in the prime number theorem. This gives an improved version of the prime number theorem with error term roughly square-root of that which was previously known. We apply this to a…
An error in the proof of Bell's Theorem is identified and a semiclassical model of the EPRB experiment is presented
I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.
We give a very simple proof of a strengthened version of Chernoff's Inequality. We derive the same conclusion from much weaker assumptions.
In the current note, we present a new, short proof of the famous AM-GM-HM inequality using only induction and basic calculus.
This short note provides and proves an easy algorithm to find a basic feasible solution for the Simplex Algorithm. The method uses a rule similar to Bland's rule for the initial phase of the algorithm.
We give a new simpler proof of a theorem of Jayne and Rogers.
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.
We provide a simple proof of Kamp's theorem.
We will give a simple proof of the ambiguous class number formula.
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…