There are \(n\) integers. Prove that among them either there are several numbers whose sum is divisible by \(n\) or there is one number divisible by \(n\) itself.
Prove that \(n^2 + 1\) is not divisible by \(3\) for any natural \(n\).
Solve the equation with natural numbers \(1 + m + m^2 + m^3 = 2^n\).
A student did not notice the multiplication sign between two three-digit numbers and wrote one six-digit number, which turned out to be exactly seven times their product. Determine these numbers.
The student did not notice the multiplication sign between two seven-digit numbers and wrote one fourteen-digit number, which turned out to be three times bigger than their product. Determine these numbers.
Is it possible to find natural numbers \(x\), \(y\) and \(z\) which satisfy the equation \(28x+30y+31z=365\)?
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\)?
Prove that there are no natural numbers \(a\) and \(b\) such that \(a^2 - 3b^2 = 8\).
Prove there are no integer solutions for the equation \(x^2=y^2+1990\).
Given a board (divided into squares) of the size: a) \(10\times 12\), b) \(9\times 10\), c) \(9\times 11\), consider the game with two players where: in one turn a player is allowed to cross out any row or any column if there is at least one square not crossed out. The loser is the one who cannot make a move. Is there a winning strategy for one of the players?