相关论文: Baron Munchhausen Redeems Himself: Bounds for a Co…

We investigate a coin-weighing puzzle that appeared in the all-Russian math Olympiad in 2000. We liked the puzzle because the methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of…

In 2007, a new variety of the well-known problem of identifying a counterfeit coin using a balance scale was introduced in the sixth International Kolmogorov Math Tournament. This paper offers a comprehensive overview of this new problem by…

I introduce, solve and generalize a new coin puzzle that involves parallel weighings.

We discuss several coin-weighing problems in which coins are known to be of three different weights and only a balance scale can be used. We start with the task of sorting coins when the pans of the scale can fit only one coin. We prove…

We establish fun parallels between coin-weighing puzzles and knights-and-knaves puzzles.

"The Baron's omni-sequence", B(n), first defined by Khovanova and Lewis (2011), is a sequence that gives for each n the minimum number of weighings on balance scales that can verify the correct labeling of n identically-looking coins with…

Finding a counterfeit coin with the different weight from a set of visually identical coin using a balance, usually a two-armed balance, known as the balance question, is an intersting and inspiring question. Its variants involve…

This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balance scales, with the minimum number of weighings possible, and…

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

Fake coin problems using balance scales to identify one fake coin and its type among n coins (n > 2) were solved by Dyson in 1946. Dyson gave adaptive solutions with the minimum number of weighings where later weighings may be dependent on…

There are $n$ bags with coins that look the same. Each bag has an infinite number of coins and all coins in the same bag weigh the same amount. Coins in different bags weigh 1, 2, 3, and so on to $n$ grams exactly. There is a unique label…

As in many coin puzzles, we have several identical-looking coins, with one of them fake and the rest real. The real coins weigh the same. Our fake coin is special in that it can change its weight. The coin can pretend to be a real coin, a…

We discuss coin-weighing problems with a new type of coin: a chameleon. A chameleon coin can mimic a fake or a real coin, and it can choose which coin to mimic for each weighing independently. We consider a mix of $N$ coins that include…

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…

In this paper we investigate the problem of sorting a set of $n$ coins, each with distinct but unknown weights, using an unusual scale. The classical version of this problem, which has been well-studied, gives the user a binary scale,…

A problem faced by many instructors is that of designing exams that accurately assess the abilities of the students. Typically these exams are prepared several days in advance, and generic question scores are used based on rough…

The locker puzzle is a game played by multiple players against a referee. It has been previously shown that the best strategy that exists cannot succeed with probability greater than 1-ln2 \approx 0.31, no matter how many players are…

We study the Torus Puzzle, a solitaire game in which the elements of an input $m \times n$ matrix need to be rearranged into a target configuration via a sequence of unit rotations (i.e., circular shifts) of rows and/or columns. Amano et…

Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…

In this paper we consider a scenario where there are several algorithms for solving a given problem. Each algorithm is associated with a probability of success and a cost, and there is also a penalty for failing to solve the problem. The…