One hundred gnomes weighing each 1, 2, 3, ..., 100 pounds, gathered on the left bank of a river. They cannot swim, but on the same shore is a rowing boat with a carrying capacity of 100 pounds. Because of the current, it’s hard to swim back, so each gnome has enough power to row from the right bank to the left one no more than once (it’s enough for any one of the gnomes to row in the boat, the rower does not change during one voyage). Will all gnomes cross to the right bank?
The number \(x\) is such that both the sums \(S = \sin 64x + \sin 65x\) and \(C = \cos 64x + \cos 65x\) are rational numbers.
Prove that in both of these sums, both terms are rational.
For all real \(x\) and \(y\), the equality \(f (x^2 + y) = f (x) + f (y^2)\) holds. Find \(f(-1)\).
Prove that for any odd natural number, \(a\), there exists a natural number, \(b\), such that \(2^b - 1\) is divisible by \(a\).
On a lottery ticket, it is necessary for Mary to mark 8 cells from 64. What is the probability that after the draw, in which 8 cells from 64 will also be selected (all such possibilities are equally probable), it turns out that Mary guessed
a) exactly 4 cells? b) exactly 5 cells? c) all 8 cells?
Prove that for any positive integer \(n\), it is always possible to find a number, consisting of the digits \(1\) and \(2,\) that is divisible by \(2^n\). (For example, \(2\) is divisible by \(2\), \(12\) is divisible by \(4,\) \(112\) is divisible by \(8,\) \(2112\) is divisible by \(16\) and so on...).
A sequence of natural numbers \(a_1 < a_2 < a_3 < \dots < a_n < \dots\) is such that each natural number is either a term in the sequence, can be expressed as the sum of two terms in the sequence, or perhaps the same term twice. Prove that \(a_n \leq n^2\) for any \(n=1, 2, 3,\dots\)
Out of the given numbers 1, 2, 3, ..., 1000, find the largest number \(m\) that has this property: no matter which \(m\) of these numbers you delete, among the remaining \(1000 - m\) numbers there are two, of which one is divisible by the other.
An infinite sequence of digits is given. Prove that for any natural number \(n\) that is relatively prime with a number 10, you can choose a group of consecutive digits, which when written as a sequence of digits, gives a resulting number written by these digits which is divisible by \(n\).
A quadrilateral is given; \(A\), \(B\), \(C\), \(D\) are the successive midpoints of its sides, \(P\) and \(Q\) are the midpoints of its diagonals. Prove that the triangle \(BCP\) is equal to the triangle \(ADQ\).