Problems

In the language of the Ancient Tribe, the alphabet consists of only two letters: M and O. Two words are synonyms, if one can be obtained by from the other by a) the deletion of the letters MO or OOMM, b) adding in any place the letter combination of OM. Are the words OMM and MOO synonyms in the language of the Ancient Tribe?

An investigation is being conducted into the case of a stolen mustang. There are three suspects – Bill, Joe and Sam. At the trial, Sam said that the mustang was stolen by Joe. Bill and Joe also testified, but what they said, no one remembered, and all the records were lost. In the course of the trial it became clear that only one of the defendants had stolen the Mustang, and that only he had given a truthful testimony. So who stole the mustang?

True or false? Prince Charming went to find Cinderella. He reached the crossroads and started to daydream. Suddenly he sees the Big Bad Wolf. And everyone knows that this Big Bad Wolf on one day answers every question truthfully, and a day later he lies, he proceeds in such a manner on alternate days. Prince Charming can ask the Big Bad Wolf exactly one question, after which it is necessary for him to choose which of the two roads to go on. What question can Prince Charming ask the Big Bad Wolf to find out for sure which of the roads leads to the Magic kingdom?

Decipher the following puzzle. All the numbers indicated by the letter E, are even (not necessarily equal); all the numbers indicated by the letter O are odd (also not necessarily equal).

In a vase, there is a bouquet of 7 white and blue lilac branches. It is known that 1) at least one branch is white, 2) out of any two branches, at least one is blue. How many white branches and how many blue are there in the bouquet?

In some country there are 101 cities, and some of them are connected by roads. However, every two cities are connected by exactly one path.

How many roads are there in this country?

Determine all integer solutions of the equation \(yk = x^2 + x\). Where \(k\) is an integer greater than \(1\).

Prove that for every natural number \(n > 1\) the equality: \[\lfloor n^{1 / 2}\rfloor + \lfloor n^{1/ 3}\rfloor + \dots + \lfloor n^{1 / n}\rfloor = \lfloor \log_{2}n\rfloor + \lfloor \log_{3}n\rfloor + \dots + \lfloor \log_{n}n\rfloor\] is satisfied.

\(a_1, a_2, a_3, \dots\) is an increasing sequence of natural numbers. It is known that \(a_{a_k} = 3k\) for any \(k\). Find a) \(a_{100}\); b) \(a_{2022}\).

\(f(x)\) is an increasing function defined on the interval \([0, 1]\). It is known that the range of its values belongs to the interval \([0, 1]\). Prove that, for any natural \(N\), the graph of the function can be covered by \(N\) rectangles whose sides are parallel to the coordinate axes so that the area of each is \(1/N^2\). (In a rectangle we include its interior points and the points of its boundary).