Related papers: Every Fifth Real Number is Evil
Harnessing quantum processes is an efficient method to generate truly indeterministic random numbers, which are of fundamental importance for cryptographic protocols, security applications or Monte-Carlo simulations. Recently, quantum…
One of the many number theoretic topics investigated by the ancient Greeks was perfect numbers, which are positive integers equal to the sum of their proper positive integral divisors. Mathematicians from Euclid to Euler investigated these…
We show that the sequence of moments of order less than 1 of averages of i.i.d. positive random variables is log-concave. For moments of order at least 1, we conjecture that the sequence is log-convex and show that this holds eventually for…
For a pair of random Gaussian integers chosen uniformly and independently from the set of Gaussian integers of norm $x$ or less as $x$ goes to infinity, we find asymptotics for the average norm of their greatest common divisor, with…
We study the set $\mathcal{S}$ of odd positive integers $n$ with the property ${2n}/{\sigma(n)} - 1 = 1/x$, for positive integer $x$, i.e., the set that relates to odd perfect and odd "spoof perfect" numbers. As a consequence, we find that…
We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle…
A real number $\lambda$ is called a Z-eigenvalue of a tensor $A$, if $\lambda$ is an eigenvalue of $A$ and the corresponding eigenvector $v$ is real and satisfies $v^Tv=1$. In this paper we compute the expected number of Z-eigenvalues of a…
We hypothesize that if election results are manipulated or forged, then, due to the well-known human attraction to round numbers, the frequency of reported round percentages can be increased. To test this hypothesis, we analyzed raw data…
The occurrence of the nonzero leftmost digit, i.e., 1, 2, ..., 9, of numbers from many real world sources is not uniformly distributed as one might naively expect, but instead, the nature favors smaller ones according to a logarithmic…
Let $p$ be an odd prime. We give a formula for the bad part of $p$-class groups that is valid for $100\%$ of the abelian $p$-extensions when ordered by product of ramified primes.
By expressing Fibonacci and Lucas numbers in terms of the powers of the golden ratio, $\alpha=(1+\sqrt 5)/2$ and its inverse, $\beta=-1/\alpha=(1-\sqrt 5)/2$, a multitude of Fibonacci and Lucas identities have been developed in the…
OBJECTIVE. A computer program tells me that a mean value is 12.3456789012, but how many of these digits are significant (the rest being random junk)? Should I report: 12.3?, 12.3456?, or even 10 (if only the first digit is significant)?…
A Friedman number is a positive integer which is the result of an expression combining all of its own digits by use of the four basic operations, exponentiation and digit concatenation. A "nice" Friedman number is a Friedman number for…
Let $I$ be a proper graded ideal in a positively graded polynomial ring $S$ over a field of characteristic 0. In this note it is shown that $S/I^k$ is Golod for all $k\geq 2$.
To a numerical semigroup $S$, Eliahou associated a number $E(S)$ and proved that numerical semigroups for which the associated number is non negative satisfy Wilf's conjecture. The search for counterexamples for the conjecture of Wilf is…
Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…
Let $\alpha=0.a_1a_2a_3\ldots$ be an irrational number in base $b>1$, where $0\leq a_i<b$. The number $\alpha \in (0,1)$ is a \textit{normal number} if every block $(a_{n+1}a_{n+2}\ldots a_{n+k})$ of $k$ digits occurs with probability…
Our primary aim is to find an estimate of the expected shortfall in various situations: (1) Nonparametric situation, when the probability distribution of the incurred loss is unknown, only satisfying some general conditions. Then, following…
We present numerical results for the probability of bad cases for Quicksort, i.e. cases of input data for which the sorting cost considerably exceeds that of the average. Dynamic programming was used to compute solutions of the recurrence…
A random access code (RAC) is a communication task in which the sender encodes a random message into a shorter one to be decoded by the receiver so that a randomly chosen character of the original message is recovered with some probability.…