Related papers: Distances between the winning numbers in Lottery
We have found maximum possible runs of consecutive positive integers each having exactly $k$ divisors for some fixed values of $k$. In addition, we exhibit the run of 10 consecutive positive integers each having exactly 12 divisors and two…
The game of memory is played with a deck of n pairs of cards. The cards in each pair are identical. The deck is shuffled and the cards laid face down. A move consists of flipping over first one card then another. The cards are removed from…
Game theory is the study of tractable games which may be used to model more complex systems. Board games, video games and sports, however, are intractable by design, so "ludological" theories about these games as complex phenomena should be…
The Collatz map is defined for a positive even integer as half that integer, and for a positive odd integer as that integer threefold, plus one. The Collatz conjecture states that when the map is iterated the number one is eventually…
In a classical chess round-robin tournament, each of $n$ players wins, draws, or loses a game against each of the other $n-1$ players. A win rewards a player with 1 points, a draw with 1/2 point, and a loss with 0 points. We are interested…
This paper gives two sharp bounds for the generalized ballot problem with candidate A receiving at least \mu times as candidate B for an arbitrary real number \mu.
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…
One source of beauty in mathematics is totally unexpected connections between two fundamentally different objects. For instance, is it not surprising that the time period of a real simple pendulum is linked with a function arising out of…
For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…
Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…
Parrondo's coin-tossing games comprise two games, $A$ and $B$. The result of game $A$ is determined by the toss of a fair coin. The result of game $B$ is determined by the toss of a $p_0$-coin if capital is a multiple of $r$, and by the…
The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…
We study statistics of the knockout tournament, where only the winner of a fixture progresses to the next. We assign a real number called competitiveness to each contestant and find that the resulting distribution of prize money follows a…
Zipf's law is well known in linguistics: the frequency of a word is inversely proportional to its rank. This is a special case of a more general power law, a common phenomenon in many kinds of real-world statistical data. Here, it is shown…
What is the distance between 11 (a prime number) and 12 (a highly composite number)? If your answer is 1, then ask yourself "is this reasonable?" In this work, we will introduce a distance between natural numbers based on their arithmetic…
Six conjectures on pairs of consecutive primes are listed in this paper, together with examples for each case.
We introduce an evolutionary game with feedback between perception and reality, which we call the reality game. It is a game of chance in which the probabilities for different objective outcomes (e.g., heads or tails in a coin toss) depend…
A very simple but useful almost sure convergence theorem of probability is given.
We consider a game with two piles, in which two players take turn to add $a$ or $b$ chips ($a$, $b$ are not necessarily positive) randomly and independently to their respective piles. The player who collects $n$ chips first wins the game.…