Related papers: On the Lottery Problem: Tracing Stefan Mandel's Co…
At the end, the house always wins! This simple truth holds for all public games of chance. Nevertheless, since lotteries have existed, people have tried everything to give luck a helping hand. This article compares objective scientific…
Despite its unusual payout structure, the Canadian 6/49 Lotto is one of the few government sponsored lotteries that has the potential for a favorable strategy we call "buying the pot." By buying the pot we mean that a syndicate buys each…
Lotteries are a prevalent form of gambling between a seller and buyers. Designing a lottery requires a model of how buyers make decisions when confronted with uncertain outcomes. Cumulative prospect theory (CPT) is a descriptive model that…
An accumulator is a bet that presents a rather unique payout structure, in that it combines multiple bets into a wager that can generate a total payout given by the multiplication of the individual odds of its parts. These potentially…
Suppose that the outcomes of a roulette table are not entirely random, in the sense that there exists a successful betting strategy. Is there a successful `separable' strategy, in the sense that it does not use the winnings from betting on…
We use mathematical statistics theory to derive the Compound-Dirichlet-Multinomial (CDM) prediction model. We then use this model to predict winning numbers for the 6-number, 5-number, pick-4 and pick-3 lottery games. We also develop a…
We study a combinatorial game derived from a problem in the German National Mathematics Competition. In this game, two players take turns removing numbers from a finite set of natural numbers, aiming to satisfy a certain divisibility…
The Labouchere gambling system is hypothesized to increase the probability of winning a predetermined arbitrary profit in a gambling system such as a coin flip or a roulette game in which both payouts and odds are 1:1. However, use of the…
At a first glance lottery is a form of gambling, a game in which the chances of winning is extremely small. But upon a deeper look, considering that the Jackpot prize of lotteries is a result of the active participation of millions of…
The classic model of computable randomness considers martingales that take real or rational values. Recent work by Bienvenu et al. (2012) and Teutsch (2014) shows that fundamental features of the classic model change when the martingales…
Lothar Collatz had proposed in 1937 a conjecture in number theory called Collatz conjecture. Till today there is no evidence of proving or disproving the conjecture. In this paper, we propose an algorithmic approach for verification of the…
In 1970, Statistics giant, Bradley Efron, amazed the world by coming up with a set of four dice, let's call them A,B,C,D, whose faces are marked with [0,0,4,4,4,4], [3,3,3,3,3,3],[2,2,2,2,6,6],[1,1,1,5,5,5] respectively, where die A beats…
In economy, markets are denoted as efficient when it is impossible to systematically generate profits which outperform the average. In the past years, the concept has been tested in other domains such as the growing sports betting market.…
The Kruskal Count is a card trick invented by Martin J. Kruskal in which a magician "guesses" a card selected by a subject according to a certain counting procedure. With high probability the magician can correctly "guess" the card. The…
The Secret Santa ritual, where in a group of people every member presents a gift to a randomly assigned partner, poses a combinatorial problem when considering the probabilities involved in the formation of pairs, where two persons exchange…
The hypothesis that sub-network initializations (lottery) exist within the initializations of over-parameterized networks, which when trained in isolation produce highly generalizable models, has led to crucial insights into network…
We generalize the well-known Coupon Collector Problem (CCP) in combinatorics. Our problem is to find the minimum and expected number of draws, with replacement, required to recover $n$ distinctly labeled coupons, with each draw consisting…
A collector wishes to collect $m$ complete sets of $N$ distinct coupons. The draws from the population are considered to be independent and identical distributed with replacement, and the probability that a type-$j$ coupon is drawn is noted…
We study the two-player coupon-collector competition in which two independent collectors draw one coupon each per round from a set of $d$ equally likely coupon types. Myers and Wilf gave finite formulae for several two-player events and…
Keller proposed a combinatorial conjecture on construction of an n-by-infinite matrix, which comes from showing the existence of many orbits of different sizes in certain linear group actions. He proved it for the case n=4, and we show that…