Let $ABC$ be an acute triangle where $AC > BC$. Let $T$ denote the foot of the altitude from vertex $C$, denote the circumcentre of the triangle by $O$. Show that quadrilaterals $ATOC$ and $BTOC$ have equal area.

We are given a map divided into $13\times 13$ fields. It is also known that at one of the fields a tank of the enemy is stationed, which we must destroy. To achieve this we need to hit it twice with shots aimed at the centre of some field. When the tank gets hit it gets moved to a neighbouring field out of precaution. At least how many shots must we fire, so that the tank gets destroyed certainly? We can neither see the tank, nor get any other feedback regarding its position.

Is it possible for the least common multiple of five consecutive positive integers to be a perfect square?

Endre wrote $n$ (not necessarily distinct) integers on a paper. Then for each of the $2^n$ subsets, Kelemen wrote their sum on the blackboard. a) For which values of $n$ is it possible that two different $n$-tuples give the same numbers on the blackboard? b) Prove that if Endre only wrote positive integers on the paper and Ferenc only sees the numbers on the blackboard, then he can determine which integers are on the paper.

Let $H = \{-2019,-2018, ...,-1, 0, 1, 2, ..., 2020\}$. Describe all functions $f : H \to H$ for which a) $x = f(x) - f(f(x))$ holds for every $x \in H$. b) $x = f(x) + f(f(x)) - f(f(f(x)))$ holds for every $x \in H$. c) $x = f(x) + 2f(f(x)) - 3f(f(f(x)))$ holds for every $x \in H$. PS. (a) + (b) for category E 1.5, (b) + (c) for category E+ 1.2

(Game) Károly and Dezso wish to count up to $m$ and play the following game in the meantime: they start from $0$ and the two players can add a positive number less than $13$ to the previous number, taking turns. However because of their superstition, if one of them added $x$, then the other one in the next step cannot add $13-x$. Whoever reaches (or surpasses) $m$ first, loses. Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.

How many ways are there to tile a $3 \times 3$ square with $4$ dominoes of size $1 \times 2$ and $1$ domino of size $1 \times 1$? Tilings that can be obtained from each other by rotating the square are considered different. Dominoes of the same size are completely identical

What number should we put in place of the question mark such that the following statement becomes true? $$11001_? = 54001_{10}$$A number written in the subscript means which base the number is in.

Ann wrote down all the perfect squares from one to one million (all in a single line). However, at night, an evil elf erased one of the numbers. So the next day, Ann saw an empty space between the numbers $760384$ and $763876$. What is the sum of the digits of the erased number?

We have a positive integer $n$, whose sum of digits is $100$ . If the sum of digits of $44n$ is $800$ then what is the sum of digits of $3n$?

The hexagon $ABCDEF$ has all angles equal . We know that four consecutive sides of the hexagon have lengths $7, 6, 3$ and $5$ in this order. What is the sum of the lengths of the two remaining sides?

We build a modified version of Pascal’s triangle as follows: in the first row we write a $2$ and a $3$, and in the further rows, every number is the sum of the two numbers directly above it (and rows always begin with a $2$ and end with a $3$). In the $13$th row, what is the $5$th number from the left?

Santa Claus plays a guessing game with Marvin before giving him his present. He hides the present behind one of $100$ doors, numbered from $1$ to $100$. Marvin can point at a door, and then Santa Claus will reply with one of the following words: $\bullet$ "hot" if the present lies behind the guessed door, $\bullet$ "warm" if the guess is not exact but the number of the guessed door differs from that of the present’s door by at most $5$, $\bullet$ "cold" if the numbers of the two doors differ by more than $5$. At least how many such guesses does Marvin need, so that he can be certain about where his present is? Marvin does not necessarily need to make a "hot" guess, just to know the correct door with $100\%$ certainty.

The integers $1, 2, 3, 4, 5$ and $6$ are written on a board. You can perform the following kind of move: select two of the numbers, say $a$ and $b$, such that $4a - 2b$ is nonnegative; erase $a$ and $b$, then write down $4a - 2b$ on the board (hence replacing two of the numbers by just one). Continue performing such moves until only one number remains on the board. What is the smallest possible positive value of this last remaining number?

On a piece of paper, we write down all positive integers $n$ such that all proper divisors of $n$ are less than $18$. We know that the sum of all numbers on the paper having exactly one proper divisor is $666$. What is the sum of all numbers on the paper having exactly two proper divisors? We say that $k$ is a proper divisor of the positive integer $n$ if $k | n$ and $1 < k < n$.

Soma has a tower of $63$ bricks , consisting of $6$ levels. On the $k$-th level from the top, there are $2k-1$ bricks (where $k = 1, 2, 3, 4, 5, 6$), and every brick which is not on the lowest level lies on precisely $2$ smaller bricks (which lie one level below) - see the figure. Soma takes away $7$ bricks from the tower, one by one. He can only remove a brick if there is no brick lying on it. In how many ways can he do this, if the order of removals is considered as well?

The convex quadrilateral $ABCD$ has $|AB| = 8$, $|BC| = 29$, $|CD| = 24$ and $|DA| = 53$. What is the area of the quadrilateral if $\angle ABC + \angle BCD = 270^o$?

We have a white table with $2$ rows and $5$ columns , and would like to colour all cells of the table according to the following rules: $\bullet$ We must colour the cell in the bottom left corner first. $\bullet$ After that, we can only colour a cell if some adjacent cell has already been coloured. (Two cells are adjacent if they share an edge.) How many different orders are there for colouring all $10$ squares (following these rules)?

In triangle $ABC$ we inscribe a square such that one of the sides of the square lies on the side $AC$, and the other two vertices lie on sides $AB$ and $BC$. Furthermore we know that $AC = 5$, $BC = 4$ and $AB = 3$. This square cuts out three smaller triangles from $\vartriangle ABC$. Express the sum of reciprocals of the inradii of these three small triangles as a fraction $p/q$ in lowest terms (i.e. with $p$ and $q$ coprime). What is $p + q$?

How many ways are there to fill in the $ 8$ spots in the picture with letters $A, B, C$ and $D$, using two copies of each letter, such that the spots with identical letters can be connected with a continuous line that stays within the box, without these four lines crossing each other or going through other spots? The lines do not have to be straight.

In a movie theatre there are $6$ VIP chairs labelled from $1$ to $6$. We call a few consecutive vacant chairs a block. In the online VIP seat reservation process the reservation of a seat consists of two steps: in the first step we choose the block, in the second step we reserve the first, last or middle seat (in case of a block of size even this means the middle chair with the smaller number) of that block. (In the second step the online system offers the three possibilities even though they might mean the same seat.) Benedek reserved all seats at some screeining. In how many ways could he do it if we distinguish two reservation if there were a step when Benedek chose a different option? For instance, if the seats $ 1$ and $6$ are reserved, then there are two blocks, the first one consists of the seat $ 1$, the second block consists of the seats $3, 4$ and $5$. Two reservation orders are different if there is a chair that was reserved in a different step, or there is a chair that was reserved with different option (first, last or middle). So if there were $2$ VIP chairs, then the answer would have been $9$.

Dora has $8$ rods with lengths $1, 2, 3, 4, 5, 6, 7$ and $8$ cm. Dora chooses $4$ of the rods and uses them to assemble a trapezoid (the $4$ chosen rods must be the $4$ sides). How many different trapezoids can she obtain in this way? Two trapezoids are considered different if they are not congruent.

Show that, for any fixed integer $\,n \geq 1,\,$ the sequence \[ 2, \; 2^2, \; 2^{2^2}, \; 2^{2^{2^2}}, \ldots (\mbox{mod} \; n) \]is eventually constant. [The tower of exponents is defined by $a_1 = 2, \; a_{i+1} = 2^{a_i}$. Also $a_i \; (\mbox{mod} \; n)$ means the remainder which results from dividing $a_i$ by $n$.]

In the plane, construct as many lines in general position as possible, with any two of them intersecting in a point with integer coordinates.

Let $ABC$ be a scalene triangle and its incentre $I$. Denote by $F_A$ the intersection of the line $BC$ and the perpendicular to the angle bisector at $A$ through $I$. Let us define points $F_B$ and $F_C$ in a similar manner. Prove that points $F_A, F_B$ and $F_C$ are collinear.

Prove that the number of orientations of a connected $3$-regular graph on $2n$ vertices where the number of vertices with indegree $0$ and outdegree $0$ are equal, is exactly $2^{n+1}$ $ {2n} \choose {n}$.

(Game) At the beginning of the game the organisers place $4$ piles of paper disks onto the table. The player who is in turn takes away a pile, then divides one of the remaining piles into two nonempty piles. Whoever is unable to move, loses. Defeat the organisers in this game twice in a row! A starting position will be given and then you can decide whether you want to go first or second.

On a piece of paper, we write down all positive integers $n$ such that all proper divisors of $n$ are less than $30$. We know that the sum of all numbers on the paper having exactly one proper divisor is $2397$. What is the sum of all numbers on the paper having exactly two proper divisors? We say that $k$ is a proper divisor of the positive integer $n$ if $k | n$ and $1 < k < n$.

Positive integers $a, b$ and $c$ are all less than $2020$. We know that $a$ divides $b + c$, $b$ divides $a + c$ and $c$ divides $a + b$. How many such ordered triples $(a, b, c)$ are there? Note: In an ordered triple, the order of the numbers matters, so the ordered triple $(0, 1, 2)$ is not the same as the ordered triple $(2, 0, 1)$.

There are red and blue balls in an urn : $1024$ in total. In one round, we do the following: we draw the balls from the urn two by two. After all balls have been drawn, we put a new ball back into the urn for each pair of drawn balls: the colour of the new ball depends on that of the drawn pair. For two red balls drawn, we put back a red ball. For two blue balls, we put back a blue ball. For a red and a blue ball, we put back a black ball. For a red and a black ball, we put back a red ball. For a blue and a black ball, we put back a blue ball. Finally, for two black balls we put back a black ball. Then the next round begins. After $10$ rounds, a single ball remains in the urn, which is red. What is the maximal number of blue balls that might have been in the urn at the very beginning?

In the game of Yahtzee , players have to achieve various combinations of values with $5$ dice. In a round, a player can roll the dice three times. At the second and third rolls, he can choose which dice to re-roll and which to keep. What is the probability that a player achieves at least four $6$’s in a round, given that he plays with the optimal strategy to maximise this probability? Writing the answer as $p/q$ where $p$ and $q$ are coprime, you should submit the sum of all prime factors of $p$, counted with multiplicity. So for example if you obtained $\frac{p}{q} = \frac{3^4 \cdot 11}{ 2^5 \cdot 5}$ then the submitted answer should be $4 \cdot 3 + 11 = 23$.

The function $f$ is defined on positive integers : if $n$ has prime factorization $p^{k_1}_{1} p^{k_2}_{2} ...p^{k_t}_{t}$ then $f(n) = (p_1-1)^{k_1+1}(p_2-1)^{k_2+1}...(p_t-1)^{k_t+1}$. If we keep using this function repeatedly, starting from any positive integer $n$, we will always get to $1$ after some number of steps. What is the smallest integer $n$ for which we need exactly $6$ steps to get to $1$?