Found problems: 39
There is a set of weights with the following properties:
1) It contains 5 weights, pairs of different weights.
2) For any two weights, there are two other weights of the same total weight.
What is the smallest number of weights that can be in this set?
A set of $61$ coins that look alike is given. Two coins (whose weights are equal) are counterfeit. The other $59$ (genuine) coins also have the same weight, but a different weight from that of the counterfeit coins. However it is not known whether it is the genuine coins or the counterfeit coins which are heavier. How can this question be resolved by three weighings on the one balance? (It is not required to separate the counterfeit coins from the genuine ones.)
(D. Fomin, Leningrad)
Among $2000$ outwardly indistinguishable balls, wines - aluminum weighing 1$0$ g, and the rest - duralumin weighing $9.9$ g. It is required to select two piles of balls so that the masses of the piles are different, and the number of balls in them - the same. What is the smallest number of weighings on a cup scale without weights that can be done?
There are 8 coins, 7 of which are real, which weigh the same, and one is fake, which differs in weight from the rest. Cup scales without weights mean that if you put equal weights on their cups, then any of the cups can outweigh, but if the loads are different in mass, then the cup with a heavier load is definitely overpowered. How to definitely identify a counterfeit coin in four weighings and establish is it lighter or heavier than the others?
You are given a balance and one copy of each of ten weights of $1, 2, 4, 8, 16, 32, 64, 128, 256$ and $512$ grams. An object weighing $M$ grams, where $M$ is a positive integer, is put on one of the pans and may be balanced in different ways by placing various combinations of the given weights on either pan of the balance.
(a) Prove that no object may be balanced in more than $89$ ways.
(b) Find a value of $M$ such that an object weighing $M$ grams can be balanced in $89$ ways.
(A Shapovalov, A Kulakov)
It is known that, having $6$ weighs, it is possible to balance the scales with loads, which weights are successing natural numbers from $1$ to $63$. Find all such sets of weighs.
There are $68$ coins , each coin having a different weight than that of each other . Show how to find the heaviest and lightest coin in $100$ weighings on a balance beam.
(S. Fomin, Leningrad)
There are 4 coins, 3 of which are real, which weigh the same, and one is fake, which differs in weight from the rest. Cup scales without weights are such that if equal weights are placed on their cups, then any of the cups can outweigh, but if the loads are different in mass, then the cup with a heavier load is sure to pull. How to definitely identify a counterfeit coin in three weighings and easily establish what is it or is it heavier than the others?
Among a set of $32$ coins , all identical in appearance, $30$ are real and $2$ are fake. Any two real coins have the same weight . The fake coins have the same weight , which is different from the weight of a real coin. How can one divide the coins into two groups of equal total weight by using a balance at most $4$ times?
(A Shapovalov)
Construct a set of $k$ integer weights that allows you to get any total integer weight from $1$ up to $55$ grams even if some of the weights of the set are lost. Consider two versions:
(a) $k = 10$, and any one of the weights may be lost;
(b) $k = 12$, and any two of the weights may be lost.
(D Zvonkin)
(In both cases prove that the set found has the property required.)
Among a set of $2N$ coins, all identical in appearance, $2N - 2$ are real and $2$ are fake. Any two real coins have the same weight . The fake coins have the same weight, which is different from the weight of a real coin. How can one divide the coins into two groups of equal total weight by using a balance at most $4$ times, if
(a) $N = 16$,
( b ) $N = 11$ ?
(A Shapovalov)
Among $18$ parts placed in a row, some three in a row weigh $99 $ g each, and all the rest weigh $100$ g each. On a scale with an arrow, identify all $99$-gram parts.
Given are $8$ weights weighing $1, 2, . . . , 8$ grams, but it is not known which one how much does it weigh. Baron Munchausen claims that he remembers which of the weights weighs how much, and to prove that he is right he is ready to conduct one weighing, as a result of which the weight of at least one of the weights will be unambiguously established. Is he cheating?
a) Given a chain of $60$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $59$ g, $60$ g? A broken link also weighs $1$ g.
b) Given a chain of $150$ links each weighing $1$ g. Find the smallest number of links that need to be broken if we want to be able to get from the obtained parts all weights $1$ g, $2$ g, . . . , $149$ g, $150$ g? A broken link also weighs $1$ g.