From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
There are \(2k+1\) cards numbered with the numbers \(1\) to \(2k+1\). What is the largest number of cards that can be chosen so that no number on a chosen card is equal to the sum of two numbers from two other chosen cards?
We are given 51 two-digit numbers – we will count one-digit numbers as two-digit numbers with a leading 0. Prove that it is possible to choose 6 of these so that no two of them have the same digit in the same column.
You are given 1002 different integers that are no greater than 2000. Prove that it is always possible to choose three of the given numbers so that the sum of two of them is equal to the third.
Will this still always be possible if we are given 1001 integers rather than 1002?
Prove that amongst any 11 different decimal fractions of infinite length, there will be two whose digits in the same column – 10ths, 100s, 1000s, etc – coincide (are the same) an infinite number of times.
Let \(a\), \(b\), \(c\) be integers; where \(a\) and \(b\) are not equal to zero.
Prove that the equation \(ax + by = c\) has integer solutions if and only if \(c\) is divisible by \(d = \mathrm{GCD} (a, b)\).
Prove that in a three-digit number, that is divisible by 37, you can always rearrange the numbers so that the new number will also be divisible by 37.
Prove that there are infinitely many composite numbers among the numbers \(\lfloor 2^k \sqrt{2}\rfloor\) (\(k = 0, 1, \dots\)).
Prove the irrationality of the following numbers:
a) \(\sqrt{3}{17}\)
b) \(\sqrt{2} + \sqrt{3}\)
c) \(\sqrt{2} + \sqrt{3} + \sqrt{5}\)
d) \(\sqrt{3}{3} - \sqrt{2}\)
e) \(\cos 10^{\circ}\)
f) \(\tan 10^{\circ}\)
g) \(\sin 1^{\circ}\)
h) \(\log_{2}3\)
Is it possible for
a) the sum of two rational numbers irrational?
b) the sum of two irrational numbers rational?
c) an irrational number with an irrational degree to be rational?