In an attempt create diversity the government of the planet hired \(100\) truth tellers and \(100\) liars. Each of them has at least one friend. Once exactly \(100\) members said: “All my friends are honest” and exactly \(100\) members said: “All my friends are liars.” What is the smallest possible number of pairs of friends, one of whom is honest and the other a liar?
A class contains 33 pupils, who have a combined age of 430 years. Prove that if we picked the 20 oldest pupils they would have a combined age of no less than 260 years. The age of any given pupil is a whole number.
In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).
Specify any solution of the puzzle: \(2014 + YES =BEAR\).
Of five coins, two are fake. One of the counterfeit coins is lighter than the real one, and the other is heavier than the real one by as much as the lighter one is lighter than the real coin.
Explain how in the three weighings, you can find both fake coins using scales without weights.
A traveller met five inhabitants of the planet of liars and truth tellers. To his question: “How many truth tellers are there among you?” the first replied: “None!", and another two answered: “One.” What did the final two say?
The sheikh spread out his treasures in nine sacks: 1 kg in the first bag, 2 kg in the second bag, 3 kg in the third bag, and so on, and 9 kg in the ninth bag. The insidious official stole a part of the treasure from one bag. How can the sheikh work out from which bag the official stole the treasure from using two weighings?
The height of the room is 3 meters. When it was being renovated, it turned out that more paint was needed on each wall than on the floor. Can the area of the floor of this room be more than 10 square meters?
Author: D.V. Baranov
Vlad and Peter are playing the following game. On the board two numbers written are: \(1/2009\) and \(1/2008\). At each turn, Vlad calls any number \(x\), and Peter increases one of the numbers on the board (whichever he wants) by \(x\). Vlad wins if at some point one of the numbers on the board becomes equal to 1. Will Vlad win, no matter how Peter acts?
A castle is surrounded by a circular wall with nine towers, at which there are knights on duty. At the end of each hour, they all move to the neighbouring towers, each knight moving either clockwise or counter-clockwise. During the night, each knight stands for some time at each tower. It is known that there was an hour when at least two knights were on duty at each tower, and there was an hour when there was precisely one knight on duty on each of exactly five towers. Prove that there was an hour when there were no knights on duty on one of the towers.