A whole number of litres of water were poured into three vessels. You can only to pour into any vessel the exact amount of water equal to the amount it already contains from any other vessel. Prove that in a few transfusions one can empty one of the vessels. The vessels are large enough: each can hold all the water.
Roman numerals are a numeral system that originated in ancient Rome and remained the usual way of writing numbers throughout Europe well into the Late Middle Ages. Numbers are written as combinations of letters from the Latin alphabet, each letter with a fixed integer value:
I&V&X&L&C&D&M
1&5&10&50&100&500&1000
For example the first \(12\) numbers in Roman Numerals are written as: \(I,\,II,\, III,\, IV,\, V,\, VI,\, VII,\, VIII,\, IX,\, X,\, XI,\, XII\), where the notations \(IV\) and \(IX\) can be read as "one less than five" and "one less than ten" correspondingly. A number containing two or more decimal digits is built by appending the Roman numeral equivalent for each digit, from highest to lowest, as in the following examples: the current year \(2024\) as \(MMXXIV\), number \(17\) as \(XVII\) and number \(42\) as \(XLII\) or \(XXXXII\). Let’s see how to multiply Roman numerals by multiplying \(17\) and \(42\).
Write down in Roman numerals the numbers \(14\) and \(61\) and multiply them as Roman numerals.
Detective Nero Wolf investigates a crime. He’s got \(80\) people involved in the case, among whom one is a criminal and another is a witness to the crime (but it is not known who either of them are). Each day the detective may invite one or more of these \(80\) people, and if there is a witness among those invited, but not the perpetrator, the witness will report who the perpetrator is. Can the detective solve a case in \(12\) days?
A set includes weights weighing \(1\) gram, \(2\) grams, \(4\) grams, ... (all powers of the number \(2\)), and in the set some of the weights might be the same. Weights were placed on two cups of the scales so that the scales are in balance. It is known that on the left cup, all weights are different. Prove that there are as many weights on the right cup as there are on the left.
Cut a \(7\times 7\) square into \(9\) rectangles, out of which you can construct any rectangle whose sidelengths are less than \(7\). Show how to construct the rectangles.
There are \(16\) cities in the kingdom. Prove that it is not possible to build a system of roads in such a way that one can get from any city to any other without passing through more than one city on the way, and with at most four roads coming out of each city.
There are \(16\) cities in the kingdom. Prove that it is possible to build a system of roads in such a way that one can get from any city to any other without passing through more than one city on the way, and with at most five roads coming out of each city.
The prime factorization of the number \(b\) is \(2 \times 5^2 \times 7 \times 13^2 \times 17\). The prime factorization of the number \(c\) is \(2^2 \times 5 \times 7^2 \times 13\). Is the first number divisible by the second one? Is the product of these two numbers, \(b \times c\), divisible by \(49000\)?
Find all natural numbers \(n\) for which there exist integers \(a,b,c\) such that \(a+b+c = 0\) and the number \(a^n + b^n + c^n\) is prime.