Let $ w, x, y, z$ are non-negative reals such that $ wx \plus{} xy \plus{} yz \plus{} zw \equal{} 1$. Show that $ \frac {w^3}{x \plus{} y \plus{} z} \plus{} \frac {x^3}{w \plus{} y \plus{} z} \plus{} \frac {y^3}{w \plus{} x \plus{} z} \plus{} \frac {z^3}{w \plus{} x \plus{} y}\geq \frac {1}{3}$.

Find all ordered pairs of nonnegative integers $(x,y)$ such that \[x^4-x^2y^2+y^4+2x^3y-2xy^3=1.\]

A number $n$ is called a Niven number, named for Ivan Niven, if it is divisible by the sum of its digits. For example, $24$ is a Niven number. Show that it is not possible to have more than $20$ consecutive Niven numbers.

Let $n > 1$ be an integer. Let $A$ denote the set of divisors of $n$ that are less than $\sqrt n$. Let $B$ denote the set of divisors of $n$ that are greater than $\sqrt n$. Prove that there exists a bijective function $f \colon A \to B$ such that $a$ divides $f(a)$ for all $a \in A$. (We say $f$ is [i]bijective[/i] if for every $b \in B$ there exists a unique $a \in A$ with $f(a) = b$.)

A five digit number $n= \overline{abcdc}$. Is such that when divided respectively by $2,3,4,5,6$ the remainders are $a,b,c,d,c$. What is the remainder when $n$ is divided by $100$?

In a rectangular plot of land, a man walks in a very peculiar fashion. Labeling the corners $ABCD$, he starts at $A$ and walks to $C$. Then, he walks to the midpoint of side $AD$, say $A_1$. Then, he walks to the midpoint of side $CD$ say $C_1$, and then the midpoint of $A_1D$ which is $A_2$. He continues in this fashion, indefinitely. The total length of his path if $AB=5$ and $BC=12$ is of the form $a + b\sqrt{c}$. Find $\displaystyle\frac{abc}{4}$.

Let $P$ be a given point inside a convex quadrilateral $O_1O_2O_3O_4$. For each $i = 1,2,3,4$, consider the lines $l$ that pass through $P$ and meet the rays $O_iO_{i-1}$ and $O_iO_{i+1}$ (where $O_0 = O_4$ and $O_5 = O_1$) at distinct points $A_i(l)$ and $B_i(l)$, respectively. Denote $f_i(l) = PA_i(l) \cdot PB_i(l)$. Among all such lines $l$, let $l_i$ be the one that minimizes $f_i$. Show that if $l_1 = l_3$ and $l_2 = l_4$, then the quadrilateral $O_1O_2O_3O_4$ is a parallelogram.

Let $ABC$ be an acute triangle and let $\ell$ be a line in the plane of triangle $ABC.$ We've drawn the reflection of the line $\ell$ over the sides $AB, BC$ and $AC$ and they intersect in the points $A', B'$ and $C'.$ Prove that the incenter of the triangle $A'B'C'$ lies on the circumcircle of the triangle $ABC.$

Twelve teams participated in a soccer tournament. According to the rules, one team gets $ 2$ points for a victory, $ 1$ point for a draw and $ 0$ points for a defeat. When the tournament was over, all teams had distinct numbers of points, and the team ranked second had as many points as the teams ranked on the last five places in total. Who won the match between the fourth and the eighth place teams?

Find all triples $(a, b, c)$ of positive integers such that $a \leq b$ and \[a!+b!=c^4+2024\] [i]Proposed by Otgonbayar Uuye.[/i]

Altitudes $AD$ and $BE$ of an acute triangle $ABC$ intersect at $H$. Let $C_1 (H,HE)$ and $C_2(B,BE)$ be two circles tangent at $AC$ at point $E$. Let $P\ne E$ be the second point of tangency of the circle $C_1 (H,HE)$ with its tangent line going through point $C$, and $Q\ne E$ be the second point of tangency of the circle $C_2(B,BE)$ with its tangent line going through point $C$. Prove that points $D, P$, and $Q$ are collinear.

[u]Round 1[/u] [b]p1.[/b] The alphabet of the Aau-Bau language consists of two letters: A and B. Two words have the same meaning if one of them can be constructed from the other by replacing any AA with A, replacing any BB with B, or by replacing any ABA with BAB. For example, the word AABA means the same thing as ABA, and AABA also means the same thing as ABAB. In this language, is it possible to name all seven days of the week? [b]p2.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/7/6/0fd93a0deaa71a5bb1599d2488f8b4eac5d0eb.jpg[/img] [b]p3.[/b] A playground has a swing-set with exactly three swings. When 3rd and 4th graders from Dr. Anna’s math class play during recess, she has a rule that if a $3^{rd}$ grader is in the middle swing there must be $4^{th}$ graders on that person’s left and right. And if there is a $4^{th}$ grader in the middle, there must be $3^{rd}$ graders on that person’s left and right. Dr. Anna calculates that there are $350$ different ways her students can arrange themselves on the three swings with no empty seats. How many students are in her class? [img]https://cdn.artofproblemsolving.com/attachments/5/9/4c402d143646582376d09ebbe54816b8799311.jpg[/img] [b]p4.[/b] The archipelago Artinagos has $19$ islands. Each island has toll bridges to at least $3$ other islands. An unsuspecting driver used a bad mapping app to plan a route from North Noether Island to South Noether Island, which involved crossing $12$ bridges. Show that there must be a route with fewer bridges. [img]https://cdn.artofproblemsolving.com/attachments/e/3/4eea2c16b201ff2ac732788fe9b78025004853.jpg[/img] [b]p5.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9, ... , 121)$ are in one column? [u]Round 2[/u] [b]p6.[/b] Hungry and Sneaky have opened a rectangular box of chocolates and are going to take turns eating them. The chocolates are arranged in a $2m \times 2n$ grid. Hungry can take any two chocolates that are side-by-side, but Sneaky can take only one at a time. If there are no more chocolates located side-by-side, all remaining chocolates go to Sneaky. Hungry goes first. Each player wants to eat as many chocolates as possible. What is the maximum number of chocolates Sneaky can get, no matter how Hungry picks his? [img]https://cdn.artofproblemsolving.com/attachments/b/4/26d7156ca6248385cb46c6e8054773592b24a3.jpg[/img] [b]p7.[/b] There is a thief hiding in the sultan’s palace. The palace contains $2019$ rooms connected by doors. One can walk from any room to any other room, possibly through other rooms, and there is only one way to do this. That is, one cannot walk in a loop in the palace. To catch the thief, a guard must be in the same room as the thief at the same time. Prove that $11$ guards can always find and catch the thief, no matter how the thief moves around during the search. [img]https://cdn.artofproblemsolving.com/attachments/a/b/9728ac271e84c4954935553c4d58b3ff4b194d.jpg[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

John has a string of paper where $n$ real numbers $a_i \in [0, 1]$, for all $i \in \{1, \ldots, n\}$, are written in a row. Show that for any given $k < n$, he can cut the string of paper into non-empty $k$ pieces, between adjacent numbers, in such a way that the sum of the numbers on each piece does not differ from any other sum by more than $1$.

Find the locus of centroids of equilateral triangles whose vertices lie on sides of a given square $ABCD$.

Tom painted round fence which consists of $2n \ge6$ sections in such way that every section is painted in one of four colours. Then he repeats the following while it is possible: he chooses three neighbouring sections of distinct colours and repaints them into the fourth colour. For which $n$ Tom can repaint the fence in such way infinitely many times?

Cary made an investment of $\$1000$. During years $1, 2, 3, \text{and } 4$, his investment went up $20$ percent, down $50$ percent, up $30$ percent, and up $40$ percent, respectively. Find the number of dollars Cary’s investment was worth at the end of the fourth year.

Let $n$ be an integer number greater than or equal to $2$, and let $K$ be a closed convex set of area greater than or equal to $n$, contained in the open square $(0, n) \times (0, n)$. Prove that $K$ contains some point of the integral lattice $\mathbb{Z} \times \mathbb{Z}$. [i]Marius Cavachi[/i]

Given the squares $ABCD$ and $DEFG$, whose only common point is $D$. Let the midpoints of segments $AG$, $GE$, $EC$, and $CA$ be $H, I, J$, and $K$ respectively . Prove that $HIJK$ is a square. [img]https://cdn.artofproblemsolving.com/attachments/f/d/c3313e5bbf581977a74ea2b114d14950e38605.png[/img]

For each positive integer $n$, let $M(n)$ be the $n\times n$ matrix whose $(i,j)$ entry is equal to $1$ if $i+1$ is divisible by $j$, and equal to $0$ otherwise. Prove that $M(n)$ is invertible if and only if $n+1$ is square-free. (An integer is [i]square-free[/i] if it is not divisible by a square of an integer larger than $1$.)

A ten-level $2$-tree is drawn in the plane: a vertex $A_1$ is marked, it is connected by segments with two vertices $B_1$ and $B_2$, each of $B_1$ and $B_2$ is connected by segments with two of the four vertices $C_1, C_2, C_3, C_4$ (each $C_i$ is connected with one $B_j$ exactly); and so on, up to $512$ vertices $J_1, \ldots, J_{512}$. Each of the vertices $J_1, \ldots, J_{512}$ is coloured blue or golden. Consider all permutations $f$ of the vertices of this tree, such that (i) if $X$ and $Y$ are connected with a segment, then so are $f(X)$ and $f(Y)$, and (ii) if $X$ is coloured, then $f(X)$ has the same colour. Find the maximum $M$ such that there are at least $M$ permutations with these properties, regardless of the colouring.

None face of a tetrahedron is isosceles triangle. How many kinds of lengths of edges do the tetrahedron have at least? $\text{(A)}3\qquad\text{(B)}4\qquad\text{(C)}5\qquad\text{(D)}6$

Let $k$ be a positive integer. In the coordinate plane, circle $\omega$ has positive integer radius and is tangent to both axes. Suppose that $\omega$ passes through $(1,1000+k)$. Compute the smallest possible value of $k$. [i]Proposed by Luke Robitaille

Tarik and Sultan are playing the following game. Tarik thinks of a number that is greater than $100$. Then Sultan is telling a number greater than $1$. If Tarik’s number is divisible by Sultan’s number, Sultan wins, otherwise Tarik subtracts Sultan’s number from his number and Sultan tells his next number. Sultan is forbidden to repeat his numbers. If Tarik’s number becomes negative, Sultan loses. Does Sultan have a winning strategy?

For a positive integer $ n>2$, let $ \left(a_{1}, a_{2}, \ldots, a_{n}\right)$ be a sequence of $ n$ positive reals which is either non-decreasing (this means, we have $ a_{1}\leq a_{2}\leq \ldots \leq a_{n}$) or non-increasing (this means, we have $ a_{1}\geq a_{2}\geq \ldots \geq a_{n}$), and which satisfies $ a_{1}\neq a_{n}$. Let $ x$ and $ y$ be positive reals satisfying $ \frac{x}{y}\geq \frac{a_{1}-a_{2}}{a_{1}-a_{n}}$. Show that: \[ \frac{a_{1}}{a_{2}\cdot x+a_{3}\cdot y}+\frac{a_{2}}{a_{3}\cdot x+a_{4}\cdot y}+\ldots+\frac{a_{n-1}}{a_{n}\cdot x+a_{1}\cdot y}+\frac{a_{n}}{a_{1}\cdot x+a_{2}\cdot y}\geq \frac{n}{x+y}. \]

Find all prime number pairs $(p, q)$ such that \[p^q+q^p+p+q-5pq\] is a perfect square. [i]Proposed by chengbilly[/i]