Let $AA_1$, $CC_1$ be the altitudes of $\Delta ABC$, and $P$ be an arbitrary point of side $BC$. Point $Q$ on the line $AB$ is such that $QP = PC_1$, and point $R$ on the line $AC$ is such that $RP = CP$. Prove that $QA_1RA$ is a cyclic quadrilateral.

The [i]runcible[/i] positive integers are defined recursively as follows: [list] [*]$1$ and $2$ are runcible [*]If $a$ and $b$ are runcible (where $a$ and $b$ are not necessarily distinct) then $2a + 3b$ is runcible. [/list] Is $2024$ runcible?

Let $a, b, c, d$ be real numbers. Suppose that all the roots of $z^4+az^3+bz^2+cz+d=0$ are complex numbers lying on a circle in the complex plane centered at $0+0i$ and having radius $1$. The sum of the reciprocals of the roots is necessarily $ \textbf{(A)}\ a \qquad\textbf{(B)}\ b \qquad\textbf{(C)}\ c \qquad\textbf{(D)}\ -a \qquad\textbf{(E)}\ -b $

Let $k$,$n$ be positive integers, $k,n>1$, $k<n$ and a $n \times n$ grid of unit squares is given. Ana and Maya take turns in coloring the grid in the following way: in each turn, a unit square is colored black in such a way that no two black cells have a common side or vertex. Find the smallest positive integer $n$ , such that they can obtain a configuration in which each row and column contains exactly $k$ black cells. Draw one example.

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

There are 1000 doors $D_1, D_2, . . . , D_{1000}$ and 1000 persons $P_1, P_2, . . . , P_{1000}$. Initially all the doors were closed. Person $P_1$ goes and opens all the doors. Then person $P_2$ closes door $D_2, D_4, . . . , D_{1000}$ and leaves the odd numbered doors open. Next $P_3$ changes the state of every third door, that is, $D_3, D_6, . . . , D_{999}$ . (For instance, $P_3$ closes the open door $D_3$ and opens the closed door D6, and so on). Similarly, $P_m$ changes the state of the the doors $D_m, D_{2m}, D_{3m}, . . . , D_{nm}, . . .$ while leaving the other doors untouched. Finally, $P_{1000}$ opens $D_{1000}$ if it was closed or closes it if it were open. At the end, how many doors will remain open?

How many ordered four-tuples of integers $(a,b,c,d)$ with $0 < a < b < c < d < 500$ satisfy $a + d = b + c$ and $bc - ad = 93$?

An altitude $h$ of a triangle is increased by a length $m$. How much must be taken from the corresponding base $b$ so that the area of the new triangle is one-half that of the original triangle? ${{ \textbf{(A)}\ \frac{bm}{h+m}\qquad\textbf{(B)}\ \frac{bh}{2h+2m}\qquad\textbf{(C)}\ \frac{b(2m+h)}{m+h}\qquad\textbf{(D)}\ \frac{b(m+h)}{2m+h} }\qquad\textbf{(E)}\ \frac{b(2m+h)}{2(h+m)} } $

Suppose $n$ is an integer $\geq 2$. Determine the first digit after the decimal point in the decimal expansion of the number \[\sqrt[3]{n^{3}+2n^{2}+n}\]

Let $\vartriangle ABC$ be a triangle of which the side lengths are positive integers which are pairwise coprime. The tangent in $A$ to the circumcircle intersects line $BC$ in $D$. Prove that $BD$ is not an integer.

Prove that every natural number which is not an integer power of $2$ is the sum of two or more consecutive natural numbers.

Two disjoint circles $W_1(S_1,r_1)$ and $W_2(S_2,r_2)$ are given in the plane. Point $A$ is on circle $W_1$ and $AB,AC$ touch the circle $W_2$ at $B,C$ respectively. Find the loci of the incenter and orthocenter of triangle $ABC$.

Positive numbers $a, b, c, x, y, z$ satisfy that $cy + bz = a$, $az + cx = b$, and $bx + ay = c$. Find the minimum value of the function $f(x,y,z) =\frac{x^2}{x+1}+\frac{y^2}{y+1}+\frac{z^2}{z+1}$.

$m,n,p$ are positive integers which do not simultaneously equal to zero. $3$D Cartesian space is divided into unit cubes by planes each perpendicular to one of $3$ axes and cutting corresponding axis at integer coordinates. Each unit cube is filled with an integer from $1$ to $60$. A filling of integers is called [i]Dien Bien[/i] if, for each rectangular box of size $\{2m+1,2n+1,2p+1\}$, the number in the unit cube which has common centre with the rectangular box is the average of the $8$ numbers of the $8$ unit cubes at the $8$ corners of that rectangular box. How many [i]Dien Bien[/i] fillings are there? Two fillings are the same if one filling can be transformed to the other filling via a translation. [hide]translation from [url=http://artofproblemsolving.com/community/c6h592875p3515526]here[/url][/hide]

Math teacher wrote in a table a polynomial $P(x)$ with integer coefficients and he said: "Today my daughter have a birthday.If in polynomial $P(x)$ we have $x=a$ where $a$ is the age of my daughter we have $P(a)=a$ and $P(0)=p$ where $p$ is a prime number such that $p>a$." How old is the daughter of math teacher?

Find all triplets of real numbers $(x, y, z)$ that satisfies the system of equations $x^5 = 2y^3 + y - 2$ $y^5 = 2z^3 + z - 2$ $z^5 = 2x^3 + x - 2$

consider $0<u<1$. find $\alpha > 0$ minimum such that there exists $\beta > 0$ satisfying $(1+x)^u +(1-x)^u \leq 2 - \frac{x^\alpha}{\beta} \forall 0<x<1$

Find all integer coefficient polynomial $P(x)$ such that for all positive integer $x$, we have $$\tau(P(x))\geq\tau(x)$$Where $\tau(n)$ denotes the number of divisors of $n$. Define $\tau(0)=\infty$. Note: you can use this conclusion. For all $\epsilon\geq0$, there exists a positive constant $C_\epsilon$ such that for all positive integer $n$, the $n$th smallest prime is at most $C_\epsilon n^{1+\epsilon}$. [i]Proposed by USJL[/i]

Let $a$ and $ b$ be acute corners. Prove that if $\sin a$, $\sin b$, and $\sin (a + b)$ are rational numbers, then $\cos a$, $\cos b$, and $\cos (a + b)$ are also rational numbers.

Let $\lfloor x \rfloor$ denote the greatest integer less than or equal to $x$. Find the number of positive integers $m$ between $1$ and $2022$ inclusive such that \[ \left\lfloor \frac{3^m}{11} \right\rfloor \] is even.

Suppose that $(\underline{AB}, \underline{CD})$ is a pair of two digit positive integers (digits $A$ and $C$ must be nonzero) such that the product $\underline{AB} \cdot \underline{CD}$ divides the four digit number $\underline{ABCD}$. Find the sum of all possible values of the three digit number $\underline{ABC}$.

Consider $\triangle MAB$ with a right angle at $A$ and circumcircle $\omega$. Take any chord $CD$ perpendicular to $AB$ such that $A, C, B, D, M$ lie on $\omega$ in this order. Let $AC$ and $MD$ intersect at point $E$, and let $O$ be the circumcenter of $\triangle EMC$. Show that if $J$ is the intersection of $BC$ and $OM$, then $JB = JM$. [i](Proposed by Matthew Kung Wei Sheng and Ivan Chan Kai Chin)[/i]

Let $M$ be the intersection point of the diagonals of the parallelogram $ABCD$. Consider three circles passing through $M$, the first and second touch $AB$ at points $A$ and $B$, respectively, and the third passes through $C$ and $D$. Let us denote by $P$ and $C$, respectively, the intersection points of the first circle with the third and the second with the third, different from $M$. Prove that the line $PQ$ touches the first and second circles.

Determine whether there exists a differentiable function $f:[0,1]\to\mathbb R$ such that $$f(0)=f(1)=1,\qquad|f'(x)|\le2\text{ for all }x\in[0,1]\qquad\text{and}\qquad\left|\int^1_0f(x)dx\right|\le\frac12.$$

It is possible to paint with the colors red and blue the squares of a grid board $1999\times 1999$, so that in each of the $1999$ rows, in each of the $1999$ columns and each of the the $2$ diagonals are exactly $1000$ squares painted red?