The judges of an Olympiad decided to denote each participant with a natural number in such a way that it would be possible to unambiguously reconstruct the number of points received by each participant in each task, and that from each two participants the one with the greater number would be the participant which received a higher score. Help the judges solve this problem!
The numbers \(a_1, a_2, \dots , a_{1985}\) are the numbers \(1, 2, \dots , 1985\) rearranged in some order. Each number \(a_k\) is multiplied by its number \(k\), and then the largest number is chosen among the resulting 1985 products. Prove that it is not less than \(993^2\).
The product of 1986 natural numbers has exactly 1985 different prime factors. Prove that either one of these natural numbers, or the product of several of them, is the square of a natural number.
The product of a group of 48 natural numbers has exactly 10 prime factors. Prove that the product of some four of the numbers in the group will always give a square number.
In March 2015 a teacher ran 11 sessions of a maths club. Prove that if no sessions were run on Saturdays or Sundays there must have been three days in a row where a session of the club did not take place. The 1st March 2015 was a Sunday.
Prove that from any 27 different natural numbers less than 100, two numbers that are not coprime can be chosen.
7 different digits are given. Prove that for any natural number \(n\) there is a pair of these digits, the sum of which ends in the same digit as the number.
Is there a line on the coordinate plane relative to which the graph of the function \(y = 2^x\) is symmetric?
In a group of seven boys, everyone has at least three brothers who are in that group. Prove that all seven are brothers.
A council of 2,000 deputies decided to approve a state budget containing 200 items of expenditure. Each deputy prepared his draft budget, which indicated for each item the maximum allowable, in his opinion, amount of expenditure, ensuring that the total amount of expenditure did not exceed the set value of \(S\). For each item, the board approves the largest amount of expenditure that is agreed to be allocated by no fewer than \(k\) deputies. What is the smallest value of \(k\) for which we can ensure that the total amount of approved expenditures does not exceed \(S\)?