Problems

There is a rectangular table. Two players start in turn to place on it one pound coin each, so that these coins do not overlap one another. The player who cannot make a move loses. Who will win with the correct strategy?

a) Two players play in the following game: on the table there are 7 two pound coins and 7 one pound coins. In a turn it is allowed to take coins worth no more than three pounds. The one who takes the last coin wins. Who will win with the correct strategy?

b) The same question, if there are 12 one pound and 12 two pound coins.

On Easter Island, people ask each other questions, to which only “yes” or “no” can be answered. In this case, each of them belongs exactly to one of the tribes either A or B. People from tribe A ask only those questions to which the correct answer is “yes”, and from tribe B – those questions to which the correct answer is “no.” In one house lived a couple Ethan and Violet Russell. When Inspector Krugg approached the house, the owner met him on the doorstep with the words: “Tell me, do Violet and I belong to tribe B?”. The inspector thought and gave the right answer. What was the right answer?

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?

Solve problem number 108736 for the inscription \(A\), \(BC\), \(DEF\), \(CGH\), \(CBE\), \(EKG\).

A row of 4 coins lies on the table. Some of the coins are real and some of them are fake (the ones which weigh less than the real ones). It is known that any real coin lies to the left of any false coin. How can you determine whether each of the coins on the table is real or fake, by weighing once using a balance scale?

Members of the State parliament formed factions in such a way that for any two factions \(A\) and \(B\) (not necessarily different)

– also a faction (through

the set of all parliament members not included in \(C\) is denoted). Prove that for any two factions \(A\) and \(B\), \(A \cup % \includegraphics{https://problems-static.s3.eu-west-2.amazonaws.com/static/test/task_images/82/109909-3.png} B\) is also a faction.

A magician with a blindfold gives a spectator five cards with the numbers from 1 to 5 written on them. The spectator hides two cards, and gives the other three to the assistant magician. The assistant indicates to the spectator two of them, and the spectator then calls out the numbers of these cards to the magician (in the order in which he wants). After that, the magician guesses the numbers of the cards hidden by the spectator. How can the magician and the assistant make sure that the trick always works?

In 10 boxes there are pencils (there are no empty boxes). It is known that in different boxes there is a different number of pencils, and in each box, all pencils are of different colors. Prove that from each box you can choose a pencil so that they will all be of different colors.

Which numbers can stand in place of the letters in the equality \(AB \times C = DE\), if different letters denote different numbers and from left to right the numbers are written in ascending order?