How many integers are there from 1 to 1,000,000, which are neither full squares, nor full cubes, nor numbers to the fourth power?
Consider a chess board of size \(n \times n\). It is required to move a rook from the bottom left corner to the upper right corner. You can move only up and to the right, without going into the cells of the main diagonal and the one below it. (The rook is on the main diagonal only initially and in the final moment in time.) How many possible routes does the rook have?
Tickets cost 50 cents, and \(2n\) buyers stand in line at a cash register. Half of them have one dollar, the rest – 50 cents. The cashier starts selling tickets without having any money. How many different orders of people can there be in the queue, such that the cashier can always give change?
Prove that the Catalan numbers satisfy the recurrence relationship \(C_n = C_0C_{n-1} + C_1C_{n-2} + \dots + C_{n-1}C_0\). The definition of the Catalan numbers \(C_n\) is given in the handbook.
Determine all prime numbers \(p\) and \(q\) such that \(p^2 - 2q^2 = 1\) holds.
Write in terms of prime factors the numbers 111, 1111, 11111, 111111, 1111111.
Numbers \(a, b, c\) are integers with \(a\) and \(b\) being coprime. Let us assume that integers \(x_0\) and \(y_0\) are a solution for the equation \(ax + by = c\).
Prove that every solution for this equation has the same form \(x = x_0 + kb\), \(y = y_0 - ka\), with \(k\) being a random integer.
Prove that for a real positive \(\alpha\) and a positive integer \(d\), \(\lfloor \alpha / d\rfloor = \lfloor \lfloor \alpha\rfloor / d\rfloor\) is always satisfied.
Let \(m\) and \(n\) be integers. Prove that \(mn(m + n)\) is an even number.
Prove that if \(p\) is a prime number and \(1 \leq k \leq p - 1\), then \(\binom{p}{k}\) is divisible by \(p\).