Prove that $\sum \frac{1}{i_1i_2 \ldots i_k} = n$ is taken over all non-empty subsets $\left\{i_1,i_2, \ldots, i_k\right\}$ of $\left\{1,2,\ldots,n\right\}$. (The $k$ is not fixed, so we are summing over all the $2^n-1$ possible nonempty subsets.)

Four disks with disjoint interiors are mutually tangent. Three of them are equal in size and the fourth one is smaller. Find the ratio of the radius of the smaller disk to one of the larger disks.

Find all real numbers $(x,y)$ satisfying the following: $$x+\frac{3x-y}{x^2+y^2}=3$$ $$y-\frac{x+3y}{x^2+y^2}=0$$

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

Five distinct points and five distinct lines are given in the plane. Prove that one can select two of the points and two of the lines so that none of the selected lines contains any of the selected points.

There are $2024$ cities in a country, some pairs of which are connected by bidirectional flights. For any distinct cities $A, B, C, X, Y, Z$, it is possible to fly directly from some of the cities $A, B, C$ to some of the cities $X, Y, Z$. Prove that it is possible to plan a route $T_1\to T_2 \to \ldots \to T_{2022}$ that passes through $2022$ distinct cities. [i]Proposed by Lior Shayn[/i]

A real number $f(X)\neq 0$ is assigned to each point $X$ in the space. It is known that for any tetrahedron $ABCD$ with $O$ the center of the inscribed sphere, we have : \[ f(O)=f(A)f(B)f(C)f(D). \] Prove that $f(X)=1$ for all points $X$. [i]Proposed by Aleksandar Ivanov[/i]

A convex quadrangle without parallel sides is given. For each triple of its vertices, a point is constructed that supplements this triple to a parallelogram, one of the diagonals of which coincides with the diagonal of the quadrangle. Prove that of the four points constructed, exactly one lies inside the original quadrangle.

Let $I, O$ be the incenter and the circumcenter of triangle $ABC$, and $D,E,F$ be the circumcenters of triangle $ BIC, CIA, AIB$. Let $ P, Q, R$ be the midpoints of segments $ DI, EI, FI $. Prove that the circumcenter of triangle $PQR $, $M$, is the midpoint of segment $IO$.

Let $ABC$ be a triangle with $A$ is an obtuse angle. Denote $BE$ as the internal angle bisector of triangle $ABC$ with $E \in AC$ and suppose that $\angle AEB = 45^o$. The altitude $AD$ of triangle $ABC$ intersects $BE$ at $F$. Let $O_1, O_2$ be the circumcenter of triangles $FED, EDC$. Suppose that $EO_1, EO_2$ meet $BC$ at $G, H$ respectively. Prove that $\frac{GH}{GB}= \tan \frac{a}{2}$

Let $n$ be a given integer greater than two, and let $S = \{1, 2,...,n\}$. Suppose the function $f : S^k \to S$ has the property that $f(a) \ne f(b)$ for every pair $a$ and $b$ of elements in $S^k$ with $a$ and $b$ differ in all components. Prove that $f$ is a function of one of its elements.

Let S(n) be the sum of the digits of the positive integer $n$. Determine $$S(S(S(2003^{2003}))).$$

In regular hexagon $ABCDEF$, points $W$, $X$, $Y$, and $Z$ are chosen on sides $\overline{BC}$, $\overline{CD}$, $\overline{EF}$, and $\overline{FA}$ respectively, so lines $AB$, $ZW$, $YX$, and $ED$ are parallel and equally spaced. What is the ratio of the area of hexagon $WCXYFZ$ to the area of hexagon $ABCDEF$? $\textbf{(A)}\ \frac{1}{3}\qquad\textbf{(B)}\ \frac{10}{27}\qquad\textbf{(C)}\ \frac{11}{27}\qquad\textbf{(D)}\ \frac{4}{9}\qquad\textbf{(E)}\ \frac{13}{27}$

A triplet of polynomials $u,v,w \in \mathbb{R}[x,y,z]$ is called [i]smart[/i] if there exists polynomials $P,Q,R\in \mathbb{R}[x,y,z]$ such that the following polynomial identity holds :$$u^{2019}P +v^{2019 }Q+w^{2019} R=2019$$ a) Is the triplet of polynomials $$u=x+2y+3 , \;\;\;\; v=y+z+2, \;\;\;\;\;w=x+y+z$$ [i]smart[/i]? b) Is the triplet of polynomials $$u=x+2y+3 , \;\;\;\; v=y+z+2, \;\;\;\;\;w=x+y-z$$ [i]smart[/i]? [i]Proposed by Arturas Dubickas (Vilnius University). [/i]

Let a, b be positive integers such that $5 \nmid a, b$ and $5^5 \mid a^5+b^5$. What is the minimum possible value of $a + b$?

Prove that there exist infinitely many positive integers $k$ such that the equation $$\frac{n^2+m^2}{m^4+n}=k$$ don't have any positive integer solution.

Cut the $9 \times 10$ grid rectangle along the grid lines into several squares so that there are exactly two of them with odd sidelengths.

In a certain school, there are three times as many boys as girls and nine times as many girls as teachers. Using the letters $b,g,t$ to represent the number of boys, girls, and teachers, respectively, then the total number of boys, girls, and teachers can be represented by the expression $\textbf{(A) }31b\qquad \textbf{(B) }\frac{37b}{27}\qquad \textbf{(C) }13g\qquad \textbf{(D) }\frac{37g}{27}\qquad \textbf{(E) }\frac{37t}{27}$

There are coins in denominations of $a$ and $b$ doubloons, where $a$ and $b$ are given mutually prime natural numbers, with $a < b < 100$. A non-negative integer $n$ is called [i]lucky[/i] if the sum in $n$ doubloons can be scored with using no more than $1000$ coins. Find the number of lucky numbers. [i]From the folklore[/i]

The following light grid is given: \begin{tabular}{cccc} o & o & o & o \\ o & o & o & o \\ o & o & o & o \\ o & o & o & o \end{tabular} where `o` represents a switched-off light and `•` represents a switched-on light. Each time a light is pressed, it toggles its state (on/off) as well as the state of its four adjacent neighbors (left, right, above, below). The bottom edge lights are considered to be immediately above the top edge lights, and the same applies to the lateral edges.The right figure illustrates the effect of pressing a light in a corner. Pressing a certain combination of lights results in all lights turning on. Prove that all lights must have been pressed at least once.

[b]p17.[/b] Let the roots of the polynomial $f(x) = 3x^3 + 2x^2 + x + 8 = 0$ be $p, q$, and $r$. What is the sum $\frac{1}{p} +\frac{1}{q} +\frac{1}{r}$ ? [b]p18.[/b] Two students are playing a game. They take a deck of five cards numbered $1$ through $5$, shuffle them, and then place them in a stack facedown, turning over the top card next to the stack. They then take turns either drawing the card at the top of the stack into their hand, showing the drawn card to the other player, or drawing the card that is faceup, replacing it with the card on the top of the pile. This is repeated until all cards are drawn, and the player with the largest sum for their cards wins. What is the probability that the player who goes second wins, assuming optimal play? [b]p19.[/b] Compute the sum of all primes $p$ such that $2^p + p^2$ is also prime. [b]p20.[/b] In how many ways can one color the $8$ vertices of an octagon each red, black, and white, such that no two adjacent sides are the same color? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Does \[\left\{ \begin{array}{l} x^y = z \\ y^z = x \\ z^x = y \\ \end{array} \right. \] have any solutions in positive reals apart from $x = y = z= 1$?

In a narrow alley of width $w$ a ladder of length $a$ is placed with its foot at point $P$ between the walls. Resting against one wall at $Q$, the distance $k$ above the ground makes a $45^\circ$ angle with the ground. Resting against the other wall at $R$, a distance $h$ above the ground, the ladder makes a $75^\circ$ angle with the ground. The width $w$ is equal to $\textbf {(A) } a \qquad \textbf {(B) } RQ \qquad \textbf {(C) } k \qquad \textbf {(D) } \frac{h+k}{2} \qquad \textbf {(E) } h$

You play a game with a biased coin, which has probability $\tfrac{3}{4}$ of landing heads. Each time you toss heads, you score $1$ point, while tossing tails earns no points. After any turn, you can stop playing the game and keep the points you currently have. However, if you are still playing when you toss tails for the second time, you lose all of your points. If you play to maximize your expected score, what is your expected score from playing this game?

Let $n\ge2$ be a positive integer. Given a sequence $\left(s_i\right)$ of $n$ distinct real numbers, define the "class" of the sequence to be the sequence $\left(a_1,a_2,\ldots,a_{n-1}\right)$, where $a_i$ is $1$ if $s_{i+1} > s_i$ and $-1$ otherwise. Find the smallest integer $m$ such that there exists a sequence $\left(w_i\right)$ of length $m$ such that for every possible class of a sequence of length $n$, there is a subsequence of $\left(w_i\right)$ that has that class. [i]David Yang.[/i]