There are 13 weights. It is known that any 12 of them could be placed in 2 scale cups with 6 weights in each cup in such a way that balance will be held.
Prove the mass of all the weights is the same, if it is known that:
a) the mass of each weight in grams is an integer;
b) the mass of each weight in grams is a rational number;
c) the mass of each weight could be any real (not negative) number.
Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any \(k = 1, 2, 3, \dots\) the sum of the first \(k\) terms of the sequence is divisible by \(k\)?
Solve the equation \(xy = x + y\) in integers.
Author: A.K. Tolpygo
An irrational number \(\alpha\), where \(0 <\alpha <\frac 12\), is given. It defines a new number \(\alpha_1\) as the smaller of the two numbers \(2\alpha\) and \(1 - 2\alpha\). For this number, \(\alpha_2\) is determined similarly, and so on.
a) Prove that for some \(n\) the inequality \(\alpha_n <3/16\) holds.
b) Can it be that \(\alpha_n> 7/40\) for all positive integers \(n\)?
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 the letters with digits in a way that makes the following sum as big as possible: \[SEND +MORE +MONEY.\]
Jane wrote another number on the board. This time it was a two-digit number and again it did not include digit 5. Jane then decided to include it, but the number was written too close to the edge, so she decided to t the 5 in between the two digits. She noticed that the resulting number is 11 times larger than the original. What is the sum of digits of the new number?
a) Find the biggest 6-digit integer number such that each digit, except for the two on the left, is equal to the sum of its two left neighbours.
b) Find the biggest integer number such that each digit, except for the rst two, is equal to the sum of its two left neighbours. (Compared to part (a), we removed the 6-digit number restriction.)
Does there exist an irreducible tiling with \(1\times2\) rectangles of a \(4\times 6\) rectangle?
Irreducibly tile a floor with \(1\times2\) tiles in a room that is a \(5\times8\) rectangle.