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.
Suppose that there are 15 prime numbers forming an arithmetic progression with a difference of \(d\). Prove that \(d >30,000\).
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)\).
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.
Could it be that a) \(\sigma(n) > 3n\); b) \(\sigma(n) > 100n\)?
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.
Solve the equations in integers:
a) \(3x^2 + 5y^2 = 345\);
b) \(1 + x + x^2 + x^3 = 2^y\).