Related papers: A constructive proof of Simpson's Rule
We consider the function $G(n)=\frac{\sigma(n)}{n\log\log n}$ (where $\sigma(n)=\sum_{d|n}d$) and set an imposed condition on its argument $n$, the fulfillment of which is sufficient for the existence of a prime $p$, at which $G(np)>G(n)$.…
We propose a proof of the Lagrange Interpolation Formula based on the Chinese Remainder Theorem for arbitrary rings. Even such relationships are known, we think that our viewpoint is worth being published.
The present paper is devoted to possible generalizations of the classic Lagrange Mean Value Theorem. We consider a real-valued function of several variables that is only assumed to be continuous. The main concept is to replace the notion of…
Consider multiple sums $S_n$ on the $d$-dimensional integer grid,which are generated by i.i.d.\ random variables with a positive expectation. We prove the strong law of large numbers, the law of the iterated logarithm and the distributional…
In number theory, many major results related to the additive properties of primes are proven using the methods of sieve theory. However, in nearly every case, the existing proofs of these results are ineffective, in that explicit values for…
We generalize Lindeberg's proof of the central limit theorem to an invariance principle for arbitrary smooth functions of independent and weakly dependent random variables. The result is applied to get a similar theorem for smooth functions…
We prove a structure theorem for multiplicative functions which states that an arbitrary bounded multiplicative function can be decomposed into two terms, one that is approximately periodic and another that has small Gowers uniformity norm…
Scoring rules measure the deviation between a probabilistic forecast and reality. Strictly proper scoring rules have the property that for any forecast, the mathematical expectation of the score of a forecast p by the lights of p is…
In the general context of computable metric spaces and computable measures we prove a kind of constructive Borel-Cantelli lemma: given a sequence (constructive in some way) of sets $A_{i}$ with effectively summable measures, there are…
For n>1, let G(n)=\sigma(n)/(n log log n), where \sigma(n) is the sum of the divisors of n. We prove that the Riemann Hypothesis is true if and only if 4 is the only composite number N satisfying G(N) \ge \max(G(N/p),G(aN)), for all prime…
It is well-known that Lagrange's four-square theorem, stating that every natural number may be written as the sum of four squares, may be proved using methods from the classical theory of modular forms and theta functions. We revisit this…
The overlapping coefficient is a fundamental measure of similarity between probability distributions. While the case of two distributions has been extensively studied, extending this measure to multiple populations presents both analytical…
That there exist two losing games that can be combined, either by random mixture or by nonrandom alternation, to form a winning game is known as Parrondo's paradox. We establish a strong law of large numbers and a central limit theorem for…
Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…
Born's rule is the recipe for calculating probabilities from quantum mechanical amplitudes. There is no generally accepted derivation of Born's rule from first principles. In this paper, it is motivated from assumptions that link the…
A theorem of alternatives provides a reduction of validity in a substructural logic to validity in its multiplicative fragment. Notable examples include a theorem of Arnon Avron that reduces the validity of a disjunction of multiplicative…
In this paper, we consider the sublinear expectation on bounded random variables. With the notion of uncorrelatedness for random variables under the sublinear expectation, a weak law of large numbers is obtained. With the notion of…
The problem of combining p-values is an old and fundamental one, and the classic assumption of independence is often violated or unverifiable in many applications. There are many well-known rules that can combine a set of arbitrarily…
We prove interpolating estimates providing a bound for the oscillation of a function in terms of two $L^p$ norms of its gradient. They are based on a pointwise bound of a function on cones in terms of the Riesz potential of its gradient.…
Cantor's ordinal numbers, a powerful extension of the natural numbers, are a cornerstone of set theory. They can be used to reason about the termination of processes, prove the consistency of logical systems, and justify some of the core…