Balance puzzle
Logic puzzle
Nº Q3823917 ★
Commune · Savoirs
Balance puzzle
Logic puzzle
A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which one has different weight than the rest, by using balance scales a limited number of times. The solution to the most common puzzle variants is summarized in the following table: For example, in detecting a dissimilar coin in three weighings ( n = 3 {\displaystyle n=3} ), the maximum number of coins that can be analyzed is 1 2 ( 3 3 − 1 ) = 13 {\displaystyle {\tfrac {1}{2}}(3^{3}-1)=13} .
Dernier prix
—
Prix plancher
—
Médiane 7 j
—
Ventes 30 j
0
Fourchette 30 j
—
En circulation
0
Cours
médiane
min – max
ventes
Aucune vente sur la période
Voir le tableau
| Date | médiane | Min | Max | ventes |
|---|
Historique des ventes
- Dernière vente
- —
- Moyenne 30 j
- —
- Plus bas 30 j
- —
- Plus haut 30 j
- —
- Ventes 7 j
- 0
- Ventes 30 j
- 0
Aucune vente pour l'instant.
Ventes anonymes : ni acheteur ni vendeur. Les chiffres ne comptent que les ventes entre joueurs.
Sur Wikipédia
Texte en anglais Pas encore d'article dans ta langue : extrait en anglais.
A balance puzzle or weighing puzzle is a logic puzzle about balancing items—often coins—to determine which one has different weight than the rest, by using balance scales a limited number of times. The solution to the most common puzzle variants is summarized in the following table: For example, in detecting a dissimilar coin in three weighings ( n = 3 {\displaystyle n=3} ), the maximum number of coins that can be analyzed is 1 2 ( 3 3 − 1 ) = 13 {\displaystyle {\tfrac {1}{2}}(3^{3}-1)=13} . Note that with 3 {\displaystyle 3} weighings and 13 {\displaystyle 13} coins, it is not always possible to determine the nature of the last coin (whether it is heavier or lighter than the rest), but only that the other coins are all the same, implying that the last coin is the dissimilar coin. In general, with n {\displaystyle n} weighings, one can always determine the identity and nature of a single dissimilar coin if there are 1 2 ( 3 n − 3 ) {\displaystyle {\tfrac {1}{2}}(3^{n}-3)} or fewer coins. In the case of three weighings, it is possible to find and describe a single dissimilar coin among a collection of 12 {\displaystyle 12} coins. This twelve-coin version of the problem appeared in print as early as 1945 and Guy and Nowakowski explain it "was popular on both sides of the Atlantic during WW2; it was even suggested that it be dropped over Germany in an attempt to sabotage their war effort".
Texte : Wikipédia en anglais, CC BY-SA 4.0. · Image : Cmglee (CC BY-SA 4.0) ·