Problems

Two convex polygons \(A_1A_2...A_n\) and \(B_1B_2...B_n\) have equal corresponding sides \(A_1A_2 = B_1B_2\), \(A_2A_3 = B_2B_3\), ... \(A_nA_1 = B_nB_1\). It is also known that \(n - 3\) angles of one polygons are equal to the corresponding angles of the other. Prove that the polygons \(A_1...A_n\) and \(B_1...B_n\) are equal.

Show that \(2^{2n} - 1\) is always divisible by \(3\), if \(n\) is a positive natural number.

The famous Fibonacci sequence is a sequence of numbers, which starts from two ones, and then each consecutive term is a sum of the previous two. It describes many things in nature. In a symbolic form we can write: \(F_0 = 1, F_1 = 1, F_n = F_{n-1} + F_{n-2}\).
Show that \[F_0+F_1+ F_2 + \dots + F_n = F_{n+2}-1\]

In certain country, there are \(n\) cities. Some of them are connected by roads, roads go in both directions. It is possible to get from any city to any other city using only roads, however, for any pair of cities, there is always only one way to get from one of them to the other, there are no alternative routes.
Show that there are exactly \(n-1\) roads in this country.

If \(x\) is any positive real number and \(n \ge 2\) is a positive natural number, show that \[(1+x)^n > 1+nx\]

Anna and Bob play a game with the following rules: they both receive a positive integer number. They do not know each other’s numbers, but they do know that their numbers come one after another – they do not know which one is larger. (If Anna gets \(n\), Bob gets either \(n-1\) or \(n+1\)). Anna then asks Bob – “do you know what number I have?” If Bob does know, he has to say Anna’s number and he wins the game. If he does not, he has to say that he does not. Then, he asks Anna if she knows his number. If Anna does not know, she asks Bob. This continues until one of them finds out what is the other’s number. Assuming that both Anna and Bob know mathematics sufficiently well to be able to solve this problem, find out who wins the game and how.
For simplicity let’s assume Bob always gets the odd number and Anna always gets the even number - two consecutive numbers have opposite parity!

A real number \(y\) is such that \(y+\frac1{y}\) happens to be an integer number. Show that for any natural \(n\), it is also true that \(y^n + \frac1{y^n}\) is an integer number.

DRAFT
We need to ensure that there isn’t overlap with the first areas problem sheet.
We can introduce the areas of a new shape, e.g. a trapezium more formally. Maybe an ellipse?

Previously, we have explored how to tile the plane using rectangles, but a much more fascinating topic is plane tilings with more intricate shapes such as quadrilaterals, pentagons, and even more unconventional shapes like chickens.
In this exercise sheet, we define a plane tiling as a covering of the entire plane, without any gaps or overlaps, using identical geometric shapes that can be rotated and symmetrical to each other. Usually, it is sufficient to cover a small portion of the plane with a particular pattern that can be extended to cover the entire plane.

Let’s start with covering the plane with triangles of the following shape.