There is a group of 5 people: Alex, Beatrice, Victor, Gregory and Deborah. Each of them has one of the following codenames: V, W, X, Y, Z. We know that:
Alex is 1 year older than V,
Beatrice is 2 years older than W,
Victor is 3 years older than X,
Gregory is 4 years older than Y.
Who is older and by how much: Deborah or Z?
Prove there are no natural numbers \(a\) and \(b\), such as \(a^2 - 3b^2 = 8\).
Prove that a graph with \(n\) vertices, the degree of each of which is at least \(\frac{n-1}{2}\), is connected.
In the Far East, the only type of transport is a carpet-plane. From the capital there are 21 carpet-planes, from the city of Dalny there is one carpet-plane, and from all of the other cities there are 20. Prove that you can fly from the capital to Dalny (possibly with interchanges).
The numbers 25 and 36 are written on a blackboard. Consider the game with two players where: in one turn, a player is allowed to write another natural number on the board. This number must be the difference between any two of the numbers already written, such that this number does not already appear on the blackboard. The loser is the player who cannot make a move.
Consider a chessboard of size (number of rows \(\times\) number of columns): a) \(9\times 10\); b) \(10\times 12\); c) \(9\times 11\). Two people are playing a game where: in one turn a player is allowed to cross out any row or column as long as there it contains at least one square that is not crossed out. The loser is the player who cannot make a move. Which player will win?
Two people take turns placing bishops on a chessboard such that the bishops cannot attack each other. Here, the colour of the bishops does not matter. (Note: bishops move and attack diagonally.) Which player wins the game, if the right strategy is used?
Solve the equation \(3x + 5y = 7\) in integers.
Determine all the integer solutions for the equation \(21x + 48y = 6\).
Solve the equation with integers \(x^2 + y^2 = 4z - 1\).