A quadrilateral \( ABCD \) with no parallel sides is inscribed in a circle \( \Omega \). Circles \( \omega_a, \omega_b, \omega_c, \omega_d \) are inscribed in triangles \( DAB, ABC, BCD, CDA \), respectively. Common external tangents are drawn between \( \omega_a \) and \( \omega_b \), \( \omega_b \) and \( \omega_c \), \( \omega_c \) and \( \omega_d \), and \( \omega_d \) and \( \omega_a \), not containing any sides of quadrilateral \( ABCD \). A quadrilateral whose consecutive sides lie on these four lines is inscribed in a circle \( \Gamma \). Prove that the lines joining the centers of \( \omega_a \) and \( \omega_c \), \( \omega_b \) and \( \omega_d \), and the centers of \( \Omega \) and \( \Gamma \) all intersect at one point. \\

Let be a natural number $ n\ge 2, $ the real numbers $ a_1,a_2,\ldots ,a_n,b_1,b_2,\ldots, b_n, $ and the matrix defined as $$ A=\left( a_i+b_j \right)_{1\le j\le n}^{1\le i\le n} . $$ [b]a)[/b] Show that $ n=2 $ if $ A $ is invertible. [b]b)[/b] Prove that the pair of numbers $ a_1,a_2 $ and $ b_1,b_2 $ are both consecutive (not necessarily in this order), if $ A $ is an invertible matrix of integers whose inverse is a matrix of integers. [i]Costică Ambrinoc[/i]

There are $ 7$ boxes arranged in a row and numbered $1$ through $7$. You have a stack of $2015$ cards, which you place one by one in the boxes. The first card is placed in box #$1$, the second in box #$2$, and so forth up to the seventh card which is placed in box #$7$. You then start working back in the other direction, placing the eighth card in box #$6$, the ninth in box #$5$, up to the thirteenth card being placed in box #$1$. The fourteenth card is then placed in box #$2$, and this continues until every card is distributed. What box will the last card be placed in?

For what is the smallest natural number $n$ there is a polynomial $P(x)$ with integer coefficients, having $m$ different integer roots, and at the same time the equation $P(x) = n$ has at least one integer solution if: a) $m = 5$, b) $ m = 6$?

Consider a convex $15$- gon with perimeter $21$. Show that there one can select three distinct pairs of vertices that form a triangle with area less than $1$. [hide=original wording of second sentence]Zeige, dass man davon drei paarweise verschiedene Eckpunkte auswählen kann, die ein Dreieck mit Fläche kleiner als 1 bilden.[/hide]

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

To $m$ ounces of a $m\%$ solution of acid, $x$ ounces of water are added to yield a $(m-10)\%$ solution. If $m>25$, then $x$ is $\textbf{(A)}\ \frac{10m}{m-10} \qquad \textbf{(B)}\ \frac{5m}{m-10} \qquad \textbf{(C)}\ \frac{m}{m-10} \qquad \textbf{(D)}\ \frac{5m}{m-20} \\ \textbf{(E)}\ \text{not determined by the given information}$

Is it true that for any permulation $a_1,a_2.....,a_{2002}$ of $1,2....,2002$ there are positive integers $m,n$ of the same parity such that $0<m<n<2003$ and $a_m+a_n=2a_{\frac {m+n}{2}}$

A board consists of $2021 \times 2021$ squares all of which are white, except for one corner square which is black. Alma and Bertha play the following game. At the beginning, there is a piece on the black square. In each turn, the player must move the piece to a new square in the same row or column as the one in which the piece is currently. All squares that the piece moves across, including the ending square but excluding the starting square, must be white, and all squares that the piece moves across, including the ending square, become black by this move. Alma begins, and the first player unable to move loses. Which player may prepare a strategy which secures her the victory? [img]https://cdn.artofproblemsolving.com/attachments/a/7/270d82f37b729bfe661f8a92cea8be67e5625c.png[/img]

All vertices of a convex polyhedron are endpoints of exactly four edges. Find the minimal possible number of triangular faces of the polyhedron.

Prove that the sum $1^3 + 2^3 +...+ n^3$ is a perfect square for all $n$.

A hinged convex quadrilateral was made of four slats. Then, two points on its opposite sides were connected with another slat, but the structure remained non-rigid. Does it follow from this that this quadrilateral is a parallelogram? [i]Proposed by A. Zaslavsky[/i] [center][img width="40"]https://i.ibb.co/dgqSvLQ/Screenshot-2023-03-09-231327.png[/img][/center]

Let a pair of positive integers $(n, m)$ that are relatively prime be called [i]intertwined[/i] if among any two divisors of $n$ greater than $1$, there exists a divisor of $m$ and among any two divisors of $m$ greater than $1$, there exists a divisor of $n$. For example, pair $(63, 64)$ is intertwined. [b]a)[/b] Find the largest integer $k$ for which there exists an intertwined pair $(n, m)$ such that the product $nm$ is equal to the product of the first $k$ prime numbers. [b]b)[/b] Prove that there does [b]not[/b] exist an intertwined pair $(n, m)$ such that the product $nm$ is the product of $2025$ distinct prime numbers. [b]c)[/b] Prove that there exists an intertwined pair $(n, m)$ such that the number of divisors of $n$ is greater than $2025$. [i]Proposed by Stijn Cambie, Belgium[/i]

\[\int_1^2 \cos(\sin^{-1}(\tan(\cos^{-1}(\sin(\tan^{-1}(x))))))\mathrm dx\] [i]Proposed by Robert Trosten[/i]

We consider a natural number $n$, $n \geq 2$ and the matrices \begin{tabular}{cc} $A= \begin{pmatrix} 1 & 2 & 3 & \cdots & n\\ n & 1 & 2 & \cdots & n - 1\\ n - 1 & n & 1 & \cdots & n - 2\\ \cdots & \cdots & \cdots & \cdots & \cdots\\2 & 3 & 4 & \cdots & 1 \end{pmatrix}$ \end{tabular} Show that$$\epsilon^ndet\left(I_n-A^{2n}\right)+\epsilon^{n-1}det\left(\epsilon I_n-A^{2n}\right)+\epsilon^{n-2}det\left(\epsilon^2 I_n-A^{2n}\right)+\cdots +det\left(\epsilon^n I_n-A^{2n}\right)$$ $$=n(-1)^{n-1}\left[\frac{n^n(n+1)}{2}\right]^{2n^2-4n}\left(1+(n+1)^{2n}\left(2n+(-1)^n{{2n}\choose{n}}\right)\right)$$where $\epsilon \in \mathbb{C}\backslash \mathbb{R}$, $\epsilon^{n+1}=1$

A convex quadrilateral $ABCD$ is given in which $\angle DAB = \angle ABC = 45^o$ and $DA = 3$, $AB = 7\sqrt2$, $BC = 4$. Calculate the length of side $CD$. [img]https://cdn.artofproblemsolving.com/attachments/1/2/046e31a628b3df4d23d3162cb570e1b9cb71e2.png[/img]

Prove the identities: $$C_{n}^{1}+2C_{n}^{2}+3C_{n}^{3}+...+nC_{n}^{n}=n\cdot 2 ^{n-1}$$ $$C_{n}^{1}-2C_{n}^{2}+3C_{n}^{3}+...-(-1)^{n-1}nC_{n}^{n}=0$$

Does there exist an infinite set $S$ consisted of positive integers,so that for any $x,y,z,w\in S,x<y,z<w$,if $(x,y)\ne (z,w)$,then $\gcd(xy+2022,zw+2022)=1$?

[b]a)[/b] Find all $ 2\times 2 $ complex matrices $ A $ which have the property that there are two complex numbers $ \alpha ,\gamma $ with $ \alpha \neq \text{tr} (A) $ or $ \gamma\neq \det (A) $ such that $ A^2-\alpha A+\gamma I=0. $ [b]b)[/b] Consider $ B\not\in\{ 0,I\} $ as a matrix having the property mentioned at [b]a).[/b] Solve in the complex numbers the system $ xB-yI-B^2=xB^2-yI-B^4=0. $ [i]Adrian Troie[/i]

Determine all functions $f : R \to R$ such that $f(x) \ge 0$ for all positive reals $x$, $f(0) = 0$ and for all reals $x, y$ $$f(x + y -xy) = f(x) + f(y) - f(xy).$$

In the quadrilateral $ABCD$, $AB = BC$ . The point $E$ lies on the line $AB$ is such that $BD= BE$ and $AD \perp DE$. Prove that the perpendicular bisectors to segments $AD, CD$ and $CE$ intersect at one point.

Let $VWXYZ$ be a square pyramid with vertex $V$ with height $1$, and with the unit square as its base. Let $STANFURD$ be a cube, such that face $FURD$ lies in the same plane as and shares the same center as square face $WXYZ$. Furthermore, all sides of $FURD$ are parallel to the sides of $WXY Z$. Cube $STANFURD$ has side length $s$ such that the volume that lies inside the cube but outside the square pyramid is equal to the volume that lies inside the square pyramid but outside the cube. What is the value of $s$?

Let $A$ and $B$ be two points inside a circle $C$. Show that there exists a circle that contains $A$ and $B$ and lies completely inside $C$.

The arithmetic mean of the nine numbers in the set $ \{9,99,999,9999, . . . ,999999999\}$ is a $ 9$-digit number $ M$, all of whose digits are distinct. The number $ M$ does not contain the digit $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 8$

Twenty-six people gather in a house. Alicia is friends with only one person, Bruno is friends with two people, Carlos is a friend of three, Daniel is four, Elías is five, and so following each person is friend of a person more than the previous person, until reaching Yvonne, the person number twenty-five, who is a friend to everyone. How many people is Zoila a friend of, person number twenty-six? Clarification: If $A$ is a friend of $B$ then $B$ is a friend of $A$.