Related papers: Distances between the winning numbers in Lottery
We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…
We study the asymptotic behavior of the ratio of total return (or total profit) to total amount bet in a casino game. While the limit is well understood when the sequence of wagers is independent and identically distributed, here we…
We present an extensive statistical analysis of the results of all sports competitions in five major sports leagues in England and the United States. We characterize the parity among teams by the variance in the winning fraction from…
In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.
In a vintage paper concerning Parsimonious games, a subset of constant sum homogeneous weighted majority games, Isbell introduced a twin relationship based on transposition properties of the incidence matrices upon minimal winning…
We propose and analyse a 2-parameter family of 2-player games on two heaps of tokens, and present a strategy based on a class of sequences. The strategy looks easy, but is actually hard. A class of exotic numeration systems is then used,…
Left, Center, Right is a popular dice game. We analyze the game using Markov chain and Monte Carlo methods. We compute the expected game length for two to eight players and determine the probability of winning for each player in the game.…
A fair coin is flipped $n$ times, and two finite sequences of heads and tails (words) $A$ and $B$ of the same length are given. Each time the word $A$ appears in the sequence of coin flips, Alice gets a point, and each time the word $B$…
Suppose that $k$ runners having different constant speeds run laps on a circular track of unit length. The Lonely Runner Conjecture states that, sooner or later, any given runner will be at distance at least $1/k$ from all the other…
We prove that if one colors each point of the Euclidean plane with one of five colors, then there exist two points of the same color that are either distance $1$ or distance $2$ apart.
A tanglegram consists of two binary rooted trees with the same number of leaves and a perfect matching between the leaves of the trees. We show that the two halves of a random tanglegram essentially look like two independently chosen random…
Let $k\geq 2$ be a fixed natural number. We establish the existence of infinitely many pairs of consecutive primes $p_n$, $p_{n+1}$ satisfying $$ p_{n+1}-p_n\geq c\:\frac{\log p_n\: \log_2 p_n\: \log_4 p_n}{\log_3 p_n}\:,$$ with $c$ being a…
This brief paper describes the single-player card game called "Perpetual Motion" and reports on a computational analysis of the game's outcome. The analysis follows a Monte Carlo methodology based on a sample of 10,000 randomly generated…
Given a finite nonempty sequence of integers S, by grouping adjacent terms it is always possible to write it, possibly in many ways, as S = X Y^k, where X and Y are sequences and Y is nonempty. Choose the version which maximizes the value…
We show that there is a non-empty class of finitely additive probabilities on $\mathbb N^2$ such that for each member of the class, each set with limiting relative frequency $p$ has probability $p$. Hence, in that context the probability…
In frequently repeated matching scenarios, individuals may require diversification in their choices. Therefore, when faced with a set of potential outcomes, each individual may have an ideal lottery over outcomes that represents their…
Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…
The Monty Hall puzzle has been solved and dissected in many ways, but always using probabilistic arguments, so it is considered a probability puzzle. In this paper the puzzle is set up as an orthodox statistical problem involving an unknown…
Natural numbers from 0 to 11111 are written in terms of 1 to 9 in two different ways. The first one in increasing order of 1 to 9, and the second one in decreasing order. This is done by using the operations of addition, multiplication,…
It is shown that an equiprobability hypothesis leads to a scenario in which it is possible to predict the outcome of a single toss of a fair coin with a success probability greater than 50%. We discuss whether this hypothesis might be…