The following isosceles trapezoid consists of equal equilateral triangles with side length $1$. The side $A_1E$ has length $3$ while the larger base $A_1A_n$ has length $n-1$. Starting from the point $A_1$ we move along the segments which are oriented to the right and up(obliquely right or left). Calculate (in terms of $n$ or not) the number of all possible paths we can follow, in order to arrive at points $B,\Gamma,\Delta, E$, if $n$ is an integer greater than $3$. [color=#00CCA7][Need image][/color]

Let $n$ be a positive integer. Two players $A$ and $B$ play a game in which they take turns choosing positive integers $k \le n$. The rules of the game are: (i) A player cannot choose a number that has been chosen by either player on any previous turn. (ii) A player cannot choose a number consecutive to any of those the player has already chosen on any previous turn. (iii) The game is a draw if all numbers have been chosen; otherwise the player who cannot choose a number anymore loses the game. The player $A$ takes the first turn. Determine the outcome of the game, assuming that both players use optimal strategies. [i]Proposed by Finland[/i]

[b]p1.[/b] Find the value of the parameter $a$ for which the following system of equations does not have solutions: $$ax + 2y = 1$$ $$2x + ay = 1$$ [b]p2.[/b] Find all solutions of the equation $\cos(2x) - 3 \sin(x) + 1 = 0$. [b]p3.[/b] A circle of a radius $r$ is inscribed into a triangle. Tangent lines to this circle parallel to the sides of the triangle cut out three smaller triangles. The radiuses of the circles inscribed in these smaller triangles are equal to $1,2$ and $3$. Find $r$. [b]p4.[/b] Does there exist an integer $k$ such that $\log_{10}(1 + 49367 \cdot k)$ is also an integer? [b]p5.[/b] A plane is divided by $3015$ straight lines such that neither two of them are parallel and neither three of them intersect at one point. Prove that among the pieces of the plane obtained as a result of such division there are at least $2010$ triangular pieces. PS. You should use hide for answers.

The [i]giraffe[/i] is a chess piece that moves $4$ squares in one direction and then a box in a perpendicular direction. What is the smallest value of $n$ such that the giraffe that starts from a corner on an $n \times n$ board can visit all the squares of said board?

a) Prove that of $5$ consecutive positive integers one that is relatively prime with the other $4$ can always be selected. b) Prove that of $10$ consecutive positive integers one that is relatively prime with the other $9$ can always be selected.

On a line are given $2k -1$ white segments and $2k -1$ black ones. Assume that each white segment intersects at least $k$ black segments, and each black segment intersects at least $k$ white ones. Prove that there are a black segment intersecting all the white ones, and a white segment intersecting all the black ones.

Starting from the number $ 1$ we write down a sequence of numbers where the next number in the sequence is obtained from the previous one either by doubling it, or by rearranging its digits (not allowing the first digit of the rearranged number to be $0$). For instance we might begin: $$1, 2, 4, 8, 16, 61, 122, 212, 424,...$$ Is it possible to construct such a sequence that ends with the number $1,000,000,000$? Is it possible to construct one that ends with the number $9,876,543,210$?

A table $2022 \times 2022$ is divided onto the tiles of two types: $L$-tetromino and $Z$-tetromino. Determine the least amount of $Z$-tetromino one needs to use.

Let a sequence of real numbers $a_0, a_1,a_2, \cdots$ satisfies the condition: $$\sum_{n=0}^ma_n\cdot(-1)^n\cdot{m\choose n}=0$$ for all sufficiently large values of $m$. Show that there exists a polynomial $P$ such that $a_n=P(n)$ for all $n\geq 0$

In the country of Graphia there are $100$ towns, each numbered from $1$ to $100$. Some pairs of towns may be connected by a (direct) road and we call such pairs of towns [i]adjacent[/i]. No two roads connect the same pair of towns. Peter, a foreign tourist, plans to visit Graphia $100$ times. For each $i$, $i=1,2,\dots, 100$, Peter starts his $i$-th trip by arriving in the town numbered $i$ and then each following day Peter travels from the town he is currently in to an adjacent town with the lowest assigned number, assuming such that a town exists and that he hasn't visited it already on the $i$-th trip. Otherwise, Peter deems his $i$-th trip to be complete and returns home. It turns out that after all $100$ trips, Peter has visited each town in Graphia the same number of times. Find the largest possible number of roads in Graphia.

Suppose \(40\) objects are placed along a circle at equal distances. In how many ways can \(3\) objects be chosen from among them so that no two of the three chosen objects are adjacent nor diametrically opposite?

On a $10 \times 10$ chessboard, several knights are placed, and in any $2 \times 2$ square there is at least one knight. What is the smallest number of cells these knights can threat? (The knight does not threat the square on which it stands, but it does threat the squares on which other knights are standing.)

[u]Round 5[/u] [b]p13.[/b] Vincent the Bug is at the vertex $A$ of square $ABCD$. Each second, he moves to an adjacent vertex with equal probability. The probability that Vincent is again on vertex $A$ after $4$ seconds is $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p14.[/b] Let $ABC$ be a triangle with $AB = 2$, $AC = 3$, and $\angle BAC = 60^o$. Let $P$ be a point inside the triangle such that $BP = 1$ and $CP =\sqrt3$, let $x$ equal the area of $APC$. Compute $16x^2$. [b]p15.[/b] Let $n$ be the number of multiples of$ 3$ between $2^{2020}$ and $2^{2021}$. When $n$ is written in base two, how many digits in this representation are $1$? [u]Round 6[/u] [b]p16.[/b] Let $f(n)$ be the least positive integer with exactly n positive integer divisors. Find $\frac{f(200)}{f(50)}$ . [b]p17.[/b] The five points $A, B, C, D$, and $E$ lie in a plane. Vincent the Bug starts at point $A$ and, each minute, chooses a different point uniformly at random and crawls to it. Then the probability that Vincent is back at $A$ after $5$ minutes can be expressed as $\frac{p}{q}$ , where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [b]p18.[/b] A circle is divided in the following way. First, four evenly spaced points $A, B, C, D$ are marked on its perimeter. Point $P$ is chosen inside the circle and the circle is cut along the rays $PA$, $PB$, $PC$, $PD$ into four pieces. The piece bounded by $PA$, $PB$, and minor arc $AB$ of the circle has area equal to one fifth of the area of the circle, and the piece bounded by $PB$, $PC$, and minor arc $BC$ has area equal to one third of the area of the circle. Suppose that the ratio between the area of the second largest piece and the area of the circle is $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Compute $p + q$. [u]Round 7 [/u] [b]p19.[/b] There exists an integer $n$ such that $|2^n - 5^{50}|$ is minimized. Compute $n$. [b]p20.[/b] For nonnegative integers $a = \overline{a_na_{n-1} ... a_2a_1}$, $b = \overline{b_mb_{m-1} ... b_2b_1}$, define their distance to be $$d(a, b) = \overline{|a_{\max\,\,(m,n)} - b_{\max\,\,(m,n)}||a_{\max\,\,(m,n)-1} - b_{\max\,\,(m,n)-1}|...|a_1 - b_1|}$$ where $a_k = 0$ if $k > n$, $b_k = 0$ if $k > m$. For example, $d(12321, 5067) = 13346$. For how many nonnegative integers $n$ is $d(2021, n) + d(12345, n)$ minimized? [b]p21.[/b] Let $ABCDE$ be a regular pentagon and let $P$ be a point outside the pentagon such that $\angle PEA = 6^o$ and $\angle PDC = 78^o$. Find the degree-measure of $\angle PBD$. [u]Round 8[/u] [b]p22.[/b] What is the least positive integer $n$ such that $\sqrt{n + 3} -\sqrt{n} < 0.02$ ? [b]p23.[/b] What is the greatest prime divisor of $20^4 + 21 \cdot 23 - 6$? [b]p24.[/b] Let $ABCD$ be a parallelogram and let $M$ be the midpoint of $AC$. Suppose the circumcircle of triangle $ABM$ intersects $BC$ again at $E$. Given that $AB = 5\sqrt2$, $AM = 5$, $\angle BAC$ is acute, and the area of $ABCD$ is $70$, what is the length of $DE$? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949414p26408213]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

We call a collection of weights (each weighing an integer value) basic if their total weight equals $200$ and each object of integer weight not greater than $200$ can be balanced exactly with a uniquely determined set of weights from the collection. (Uniquely means that we are not concerned with order or which weights of equalc value are chosen to balance against a particular object, if in fact there is a choice.) (a) Find an example of a basic collection other than the collection of $200$ weights each of value $1$. (b) How many different basic collections are there? (D. Fomin, Leningrad)

Let $a_1, a_2, ..., a_n$ be positive real numbers. Furthermore, let $S_n$ denote the set of all permutations of set $\{1, 2, ..., n\}$. Prove that $$\sum_{\pi \in S_n} \frac{1}{a_{\pi(1)}(a_{\pi(1)}+a_{\pi(2)})...(a_{\pi(1)}+a_{\pi(2)}+...+a_{\pi(n)})}=\frac{1}{a_1 a_2 ... a_n}$$

Alice and Bob play a number game. Starting with a positive integer $n$ they take turns changing the number with Alice going first. Each player may change the current number $k$ to either $k-1$ or $\lceil k/2\rceil$. The person who changes $1$ to $0$ wins. Determine all $n$ such that Alice has a winning strategy.

A $9\times 9$ array is filled with integers from 1 to 81. Prove that there exists $k\in\{1,2,3,\ldots, 9\}$ such that the product of the elements in the row $k$ is different from the product of the elements in the column $k$ of the array.

In a country, some cities are connected by two-way airlines, and one can get from any city to any other city in no more than $n{}$ flights. Prove that all airlines can be distributed among $n{}$ companies so that a route can be built between any two cities in which no more than two flights of each company would meet. [i]From the folklore[/i]

A robot is placed at point $P$ on the $x$-axis but different from $(0,0)$ and $(1,0)$ and can only move along the axis either to the left or to the right. Two players play the following game. Player $A$ gives a distance and $B$ gives a direction and the robot will move the indicated distance along the indicated direction. Player $A$ aims to move the robot to either $(0,0)$ or $(1,0)$. Player $B$'s aim is to stop $A$ from achieving his aim. For which $P$ can $A$ win?

We call a nonempty set $M$ good if its elements are positive integers, each having exactly $4$ divisors. If the good set $M$ has $n$ elements, we denote by $S_{M}$ the sum of all $4n$ divisors of its members (the sum may contain repeating terms). a) Prove that $A=\{2\cdot37,19\cdot37,29\cdot37\}$ is good and $S_{A}=2014$. b) Prove that if the set $B$ is good and $8\in B$, then $S_{B}\neq2014$.

There is an $n\times n$ chessboard where $n\geq 4$ is a positive even number. The cells of the chessboard are coloured black and white such that adjacent cells sharing a common side have different colours. Let $A$ and $B$ be two interior cells (which means cells not lying on an edge of the chessboard) of distinct colours. Prove that a chess piece can move from $A$ to $B$ by moving across adjacent cells such that every cell of the chessboard is passed through exactly once.

Five numbers 1,2,3,4,5 are written on a blackboard. A student may erase any two of the numbers a and b on the board and write the numbers a+b and ab replacing them. If this operation is performed repeatedly, can the numbers 21,27,64,180,540 ever appear on the board?

Initially, all edges of the $K_{2024}$ are painted with $13$ different colors. If there exist $k$ colors such that the subgraph constructed by the edges which are colored with these $k$ colors is connected no matter how the initial coloring was, find the minimum value of $k$.

Each point in a $12 \times 12$ array is colored red, white or blue. Show that it is always possible to find $4$ points of the same color forming a rectangle with sides parallel to the sides of the array.

A set of $n^2$ counters are labeled with $1,2,\ldots, n$, each label appearing $n$ times. Can one arrange the counters on a line in such a way that for all $x \in \{1,2,\ldots, n\}$, between any two successive counters with the label $x$ there are exactly $x$ counters (with labels different from $x$)?