All of the sweets of different sorts in stock are arranged in \(n\) boxes, for which prices are set at \(1, 2, \dots , n\), respectively. It is required to buy such \(k\) of these boxes of the least total value, which contain at least \(k/n\) of the mass of all of the sweets. It is known that the mass of sweets in each box does not exceed the mass of sweets in any more expensive box.
a) What boxes should I buy when \(n = 10\) and \(k = 3\)?
b) The same question for arbitrary natural numbers \(n \geq k\).
The bank of the Nile was approached by a group of six people: three Bedouins, each with his wife. At the shore is a boat with oars, which can withstand only two people at a time. A Bedouin can not allow his wife to be without him whilst in the company of another man. Can the whole group cross to the other side?
Is it possible for the mean of some 35 whole numbers to equal \(6.35\)?
Is it possible to place 12 identical coins along the edges of a square box so that touching each edge there were exactly: a) 2 coins, b) 3 coins, c) 4 coins, d) 5 coins, e) 6 coins, f) 7 coins.
You are allowed to place coins on top of one another. In the cases where it is possible, draw how this could be done. In the other cases, prove that doing so is impossible.
In a class there are 50 children. Some of the children know all the letters except “h” and they miss this letter out when writing. The rest know all the letters except “c” which they also miss out. One day the teacher asked 10 of the pupils to write the word “cat”, 18 other pupils to write “hat” and the rest to write the word “chat”. The words “cat” and “hat” each ended up being written 15 times. How many of the pupils wrote their word correctly?
Eight schoolchildren solved \(8\) tasks. It turned out that \(5\) schoolchildren solved each problem. Prove that there are two schoolchildren, who solved every problem at least once.
If each problem is solved by \(4\) pupils, prove that it is not necessary to have two schoolchildren who would solve each problem.
Some squares on a chess board contain a chess piece. It is known that each row contains at least one chess piece, but that different rows all have different numbers of pieces. Prove that it is always possible to mark 8 pieces so that each row and each column of the board contains exactly one marked piece.
Is it possible to find natural numbers \(x\), \(y\) and \(z\) which satisfy the equation \(28x+30y+31z=365\)?
Peter has 28 classmates. Each 2 out of these 28 have a different number of friends in the class. How many friends does Peter have?
Prove that any convex polygon contains not more than \(35\) vertices with an angle of less than \(170^\circ\).