Related papers: How many ways can you make change: Some easy proof…
In this paper, we will present an algorithm to resolve the counterfeit coins problem in the case that the number of false coins is unknown in advance.
We analyze the main arguments that attempt to explain why there is no point in changing the envelope. Most people confuse estimation and calculation, conditional and unconditional probabilities, random and non-random variables, modelling…
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…
We consider the integers having the property of reversing when multiplied by a specific integer k. First, we proved that k should be either 1, 4 or 9. Second, we classify these integers as (10, 1)- reverse multiples, (10, 4)- reverse…
Binomial distributions capture the probabilities of `heads' outcomes when a (biased) coin is tossed multiple times. The coin may be identified with a distribution on the two-element set {0,1}, where the 1 outcome corresponds to `head'. One…
ApSimon's Mints problem is a very difficult and often misunderstood counterfeit-coin puzzle. I explain the problem and suggest ways to approach it, while giving several fun exercises for the reader.
We present an analysis of a coin-tossing problem posed by Daniel Litt which has generated some popular interest. We demonstrate a recursive identity which leads to relatively simple formulas for the excess number of wins for one player over…
Ciphers are a powerful tool for encrypting communication. There are many different cipher types, which makes it computationally expensive to solve a cipher using brute force. In this paper, we frame the decryption task as a classification…
We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.
A permutiple is the product of a digit preserving multiplication, that is, a number which is an integer multiple of some permutation of its digits. Certain permutiple problems, particularly transposable, cyclic, and, more recently,…
By repeated trials, one can determine the fairness of a classical coin with a confidence which grows with the number of trials. A quantum coin can be in a superposition of heads and tails and its state is most generally a density matrix.…
Let k_1,...,k_d be positive integers, and D be a subset of [k_1]x...x[k_d], whose complement can be decomposed into disjoint sets of the form {x_1}x...x{x_{s-1}}x[k_s]x{x_{s+1}}x...x{x_d}. We conjecture that the number of elements of D can…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
A permutiple is a natural number that is a nontrivial multiple of a permutation of its digits in some base. Special cases of permutiples include cyclic numbers (multiples of cyclic permutations of their digits) and palintiple numbers…
We present a novel reshuffling exchange model and investigate its long time behavior. In this model, two individuals are picked randomly, and their wealth $X_i$ and $X_j$ are redistributed by flipping a sequence of fair coins leading to a…
We pose 100 new conjectures on representations involving primes or related things, which might interest number theorists and stimulate further research. Below are five typical examples: (i) For any positive integer $n$, there exists…
In the paper, the authors provide four alternative proofs of an explicit formula for computing Bernoulli numbers in terms of Stirling numbers of the second kind.
In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…
A group of people wishes to use money to exchange goods efficiently over several time periods. However, there are disadvantages to using any of the goods as money, and in addition fiat money issued in the form of notes or coins will be…
This review is about the convenience, the benefits, as well as the destructive capacities of money. It deals with various aspects of money creation, with its value, and its appropriation. All sorts of money tend to get corrupted by…