Related papers: Hausdorff's forgotten proof that almost all number…

Defined by Borel, a real number is normal to an integer base $b$, greater than or equal to $2$, if in its base-$b$ expansion every block of digits occurs with the same limiting frequency as every other block of the same length. We consider…

We show, from a topological viewpoint, that most numbers are not normal in a strong sense. More precisely, the set of numbers $x \in (0,1]$ with the following property is comeager: for all integers $b\ge 2$ and $k\ge 1$, the sequence of…

We show that if $\mathfrak{c} = \aleph_2$ then all covering numbers of Hausdorff measures $\operatorname{cov}(\mathcal{N}^s(\mathbb{R}^d))$ ($0 < s < d, d \in \omega$) are equal and all uniformity numbers…

Let $u_{2j}$ be the product of the odd positive integers $< 2j$. For $n$ an integer $\ge 1$, define \[ f(x)=\sum_{j=0}^{n}a_j\frac{x^{2j}}{u_{2j+2}}, \] where the $a_j$'s are arbitrary integers with $|a_0|=1$. In 1929, I. Schur established…

In a finite dimensional Hilbert space, each normalized vector (state) can be chosen as a member of an orthonormal basis of the space. We give a proof of this statement in a manner that seems to be more comprehensible for physics students…

We show that, for any $0<\gamma<1/2$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set with Hausdorff dimension about $\sqrt{\gamma}$, any small $0<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such…

A perfect number is a number whose divisors add up to twice the number itself. The existence of odd perfect numbers is a millennia-old unsolved problem. This note proposes a proof of the nonexistence of odd perfect numbers. More generally,…

Generalized Heisenberg algebras $\H(f)$ for any polynomial $f(h)\in\C[h]$ have been used to explain various physical systems and many physical phenomena for the last 20 years. In this paper, we first obtain the center of $\H(f)$, and the…

We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

Solutions that satisfy classically the Burgers equation except, perhaps, on a closed set S of the plane of potential singularities whose Hausdorff 1-measure is zero, $H^1(S) = 0$, are necessarily identically constant. We show this under the…

We construct the base $2$ expansion of an absolutely normal real number $x$ so that, for every integer $b$ greater than or equal to $2$, the discrepancy modulo $1$ of the sequence $(b^0 x, b^1 x, b^2 x , \ldots)$ is essentially the same as…

The general notion of a Hausdorff-type operator with a kernel depending on an external variable is introduced and generalizations and analogs of classical results on the regularity of various summation methods are proved for the case of…

In this short note, we give an easy proof of the following result: for $ n\geq 2, $ $\underset{t\to0}{\lim} \,e^{it\Delta }f\left(x+\gamma(t)\right) = f(x) $ almost everywhere whenever $ \gamma $ is an $ \alpha- $H\"older curve with $…

Assuming the Riemann Hypothesis, we prove that for all $x\geq 2$, there exists at least one even integer within the interval $(x, x+123\log^2x]$, that can be expressed as the sum of two primes. This result is an improvement over the recent…

A very simple but useful almost sure convergence theorem of probability is given.

This article provides a concise overview of the main mathematical theory of Benford's law in a form accessible to scientists and students who have had first courses in calculus and probability. In particular, one of the main objectives here…

A set of integers greater than 1 is primitive if no member in the set divides another. Erd\H{o}s proved in 1935 that the series $f(A) = \sum_{a\in A}1/(a \log a)$ is uniformly bounded over all choices of primitive sets $A$. In 1986 he asked…

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with decreasing probability of order $n^{-\alpha}$, $0 < \alpha < 1/2$. We prove that, almost surely, for every measure-preserving system…

The paper provides an elementary proof establishing a sharp universal bound on the $(d-1)$-Hausdorff measure of the zeros of any nontrivial multivariable polynomial $p:\mathbb{R}^d\to\mathbb{R}$ within a $d$-dimensional cube of size $r$.…