Name
Abstract | ||
|---|---|---|
We investigate a coin-weighing puzzle that appeared in the all-Russian Mathematics Olympiad in 2000. The methods of analysis differ from classical coin-weighing puzzles. We generalize the puzzle by varying the number of participating coins, and deduce a complete solution. Perhaps surprisingly, the objective can be achieved in no more than two weighings regardless of the number of coins involved. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.8.7 | JOURNAL OF INTEGER SEQUENCES |
Keywords | Field | DocType |
weighing, puzzle, triangular decomposition | Discrete mathematics,Combinatorics,Olympiad,Mathematics | Journal |
Volume | Issue | ISSN |
13 | 8 | 1530-7638 |
Citations | PageRank | References |
1 | 0.74 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tanya Khovanova | 1 | 5 | 5.89 |
| Konstantin Knop | 2 | 1 | 0.74 |
| Alexey Radul | 3 | 35 | 8.90 |