A triangle has sides of length $48$, $55$, and $73$. Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the length of the shortest altitude of the triangle. Find the value of $a+b$.

For any integer $n\ge 2$ and two $n\times n$ matrices with real entries $A,\; B$ that satisfy the equation $$A^{-1}+B^{-1}=(A+B)^{-1}\;$$ prove that $\det (A)=\det(B)$. Does the same conclusion follow for matrices with complex entries? (Proposed by Zbigniew Skoczylas, Wroclaw University of Technology)

Find all quadrilaterals which can be covered (without overlappings) with squares with side $ 1$ and equilateral triangles with side $ 1$. (Emanuele Tron)

In an acute-angled triangle $ ABC$, $ D,E,F$ are the feet of the altitudes from $ A,B,C$, respectively, and $ P,Q,R$ are the feet of the perpendiculars from $ A,B,C$ onto $ EF,FD,DE$, respectively. Prove that the lines $ AP,BQ,CR$ are concurrent.

Compute the surface area of a rectangular prism with side lengths $2, 3, 4$.

Determine whether there exist two reals $x,y$ and a sequence $\{a_n\}_{n=0}^{\infty}$ of nonzero reals such that $a_{n+2}=xa_{n+1}+ya_n$ for all $n\ge0$ and for every positive real number $r$, there exist positive integers $i,j$ such that $|a_i|<r<|a_j|$. [i]Alex Zhu.[/i]

Let $S$ be a real number. It is known that however we choose several numbers from the interval $(0, 1]$ with sum equal to $S$, these numbers can be separated into two subsets with the following property: The sum of the numbers in one of the subsets doesn’t exceed 1 and the sum of the numbers in the other subset doesn’t exceed 5. Find the greatest possible value of $S$.

A board $2025 \times 2025$ is filled with the numbers $1, 2, \ldots, 2025$, each appearing exactly $2025$ times. Show that there is a row or column with at least $45$ distinct numbers.

The critical temperature of water is the $ \textbf{(A)}\hspace{.05in}\text{temperature at which solid, liquid and gaseous water coexist} \qquad$ $\textbf{(B)}\hspace{.05in}\text{temperature at which water vapor condenses}\qquad$ $\textbf{(C)}\hspace{.05in}\text{maximum temperature at which liquid water can exist}\qquad$ $\textbf{(D)}\hspace{.05in}\text{minimum temperature at which water vapor can exist}\qquad$

Given a sequence $x_1,x_2,x_3,\cdots$ of positive integers, Ali proceed the following algorythm: In the i-th step he markes all rational numbers in the interval $[0,1]$ which have denominator equal to $x_i$. Then he write down the number $a_i$ equal to the length of the smallest interval in $[0,1]$ which both two ends of that is a marked number. Find all sequences $x_1,x_2,x_3,\cdots$ with $x_5=5$ and such that for all $n\in \mathbb N$ we have $$ a_1+a_2+\cdots+a_n= 2-\dfrac{1}{x_n}. $$ Proposed by [i]Mojtaba Zare[/i]

We consider the quadrilateral $ABCD$, with $AD = CD = CB$ and $AB \parallel CD$. Points $E$ and $F$ belong to the segments $CD$ and $CB$ so that angles $\angle ADE = \angle AEF$. Prove that: a) $4CF \le CB$ , b) if $4CF = CB$, then $AE$ is the bisector of the angle $\angle DAF$.

Find all pairs $(m,n)$ of nonnegative integers for which \[m^2 + 2 \cdot 3^n = m\left(2^{n+1} - 1\right).\] [i]Proposed by Angelo Di Pasquale, Australia[/i]

Let $\mathbb R_{>0}$ be the set of positive real numbers. Determine all functions $f \colon \mathbb R_{>0} \to \mathbb R_{>0}$ such that \[x \big(f(x) + f(y)\big) \geqslant \big(f(f(x)) + y\big) f(y)\] for every $x, y \in \mathbb R_{>0}$.

In triangle $ABC$, $AB > BC > CA$, $AB=6$, $\angle{B}-\angle{C}=90^o$. The incircle touches $BC$ at $E$ and $EF$ is a diameter of the incircle. Radical $AF$ intersect $BC$ at $D$. $DE$ equals to the circumradius of $\triangle{ABC}$. Find $BC$ and $AC$.

Let $O, I$ be the circumcenter and the incenter of triangle $ABC$, $P$ be an arbitrary point on segment $OI$, $P_A$, $P_B$, and $P_C$ be the second common points of lines $PA$, $PB$, and $PC$ with the circumcircle of triangle $ABC$. Prove that the bisectors of angles $BP_AC$, $CP_BA$, and $AP_CB$ concur at a point lying on $OI$.

Rothschild the benefactor has a certain number of coins. A man comes, and Rothschild wants to share his coins with him. If he has an even number of coins, he gives half of them to the man and goes away. If he has an odd number of coins, he donates one coin to charity so he can have an even number of coins, but meanwhile another man comes. So now he has to share his coins with two other people. If it is possible to do so evenly, he does so and goes away. Otherwise, he again donates a few coins to charity (no more than 3). Meanwhile, yet another man comes. This goes on until Rothschild is able to divide his coins evenly or until he runs out of money. Does there exist a natural number $N$ such that if Rothschild has at least $N$ coins in the beginning, he will end with at least one coin?