Professions of family members. In the Semenov family there are 5 people: a husband, a wife, their son, a husband’s sister and the father of his wife. They all work. One is an engineer, another is a lawyer, the third is a mechanic, the fourth is an economist, the fifth is a teacher. Here’s what else is known about them. The lawyer and the teacher are not blood relatives. The mechanic is a good athlete. He followed in the footsteps of an economist and played football for the national team of the plant. The engineer is older than his brother’s wife, but younger than the teacher. The economist is older than the mechanic. What are the professions of each member of the Semenov family?
We meet three people: Alex, Brian and Ben. One of them is an architect, the other is a baker and the third is an archeologist. One lives in Aberdeen, the other in Birmingham and the third in Brighton.$\\$
1) Ben is in Birmingham only for trips, and even then very rarely. However, all his relatives live in this city.$\\$
2) For two of these people the first letter of their name, the city they live in and their job is the same.$\\$
3) The wife of the architect is Ben’s younger sister.
The vendor has a cup weighing scales with unequal shoulders and weights. First he weighs the goods on one cup, then on the other, and takes the average weight. Is he deceiving customers?
At the cat show, 10 male cats and 19 female cats sit in a row where next to each female cat sits a fatter male cat. Prove that next to each male cat is a female cat, which is thinner than it.
Three friends – Peter, Ryan and Sarah – are university students, each studying a different subject from one of the following: mathematics, physics or chemistry. If Peter is the mathematician then Sarah isn’t the physicist. If Ryan isn’t the physicist then Peter is the mathematician. If Sarah isn’t the mathematician then Ryan is the chemist. Can you determine which subject each of the friends is studying?
Harry, Jack and Fred were seated so that Harry could see Jack and Fred, Jack could only see Fred, and Fred could not see anyone. Then, from a bag which contained two white caps and three black caps $($ the contents of the bag were known to the boys $)$, they took out and each put on a cap of an unknown color, and the other two hats remained in the sack. Harry said that he could not determine the color of his hat. Jack heard Harry’s statement and said that he did not have enough information to determine the color of his hat. Could Fred on the basis of these answers determine the color of his cap?
Fred and George are twin brothers. One of them always tells the truth, and the other always lies. You can ask only one question to one of the brothers, to which he will answer “yes” or “no”. Try to find out the name of each of the twins.
Cowboy Joe was sentenced to death in an electric chair. He knows that out of two electric chairs standing in a special cell, one is defective. In addition, Joe knows that if he sits on this faulty chair, the penalty will not be repeated and he will be pardoned. He also knows that the guard guarding the chairs on every other day tells the truth to every question and on the alternate days he answers incorrectly to every question. The sentenced person is allowed to ask the guard exactly one question, after which it is necessary to choose which electric chair to sit on. What question can Joe ask the guard to find out for sure which chair is faulty?
A schoolboy told his friend Bob:$\\$
“We have thirty-five people in the class. And imagine, each of them is friends with exactly eleven classmates …”$\\$
“It cannot be,” Bob, the winner of the mathematical Olympiad, answered immediately. Why did he decide this?
A kindergarten used cards for teaching children how to read: on some, the letter “MA” are written, on the rest – “DA”. Each child took three cards and began to compose words from them. It turned out that the word “MAMA” was created from the cards by 20 children, the word “DADA” by 30 children, and the word “MADA” by 40 children. How many children all had 3 of the same cards?
Decipher the following rebus $\\$
All the digits indicated by the letter “E” are even $($ not necessarily equal $)$; all the numbers indicated by the letter O are odd $($ also not necessarily equal $)$.
There are 6 locked suitcases and 6 keys for them. It is not known which keys are for which suitcase. What is the smallest number of attempts do you need in order to open all the suitcases? How many attempts would you need if there are 10 suitcases and keys instead of 6?
48 blacksmiths must shoe 60 horses. Each blacksmith spends 5 minutes on one horseshoe. What is the shortest time they should spend on the work? $($ Note that a horse can not stand on two legs. $)$
Decipher the following rebus. Despite the fact that only two figures are known here, and all the others are replaced by asterisks, the question can be restored.$\\$
Decode this rebus: replace the asterisks with numbers such that the equalities in each row are true and such that each number in the bottom row is equal to the sum of the numbers in the column above it.
In the rebus in the diagram below, the arithmetic operations are carried out from left to right (even though the brackets are not written).
For example, in the first row “$** \div 5 + * \times 7 = 4*$” is the same as “$((** \div 5) +*) \times 7 = 4*$”. Each number in the last row is the sum of the numbers in the column above it. The result of each $n$-th row is equal to the sum of the first four numbers in the $n$-th column. All of the numbers in this rebus are non-zero and do not begin with a zero, however they could end with a zero. That is, 10 is allowed but not 01 or 0. Solve the rebus.
During the chess tournament, several players played an odd number of games. Prove that the number of such players is even.
A traveller rents a room in an inn for a week and offers the innkeeper a chain of seven silver links as payment – one link per day, with the condition that they will be payed everyday. The innkeeper agrees, with the condition that the traveller can only cut one of the links. How did the traveller manage to pay the innkeeper?
We consider a sequence of words consisting of the letters “A” and “B”. The first word in the sequence is “A”, the k-th word is obtained from the $(k-1)$-th by the following operation: each “A” is replaced by “AAB” and each “B” by “A”. It is easy to see that each word is the beginning of the next, thus obtaining an infinite sequence of letters: AABAABAAABAABAAAB …
$\\$ a) Where in this sequence will the 1000th letter “A” be?
$\\$ b) Prove that this sequence is non-periodic.
Replace each letter in the diagram with a digit from 1 to 9 so that all the inequalities are satisfied,
and then arrange the letters in numerical order of their numerical values. What word did you get?