Determine all pairs $(f,g)$ of functions from the set of real numbers to itself that satisfy \[g(f(x+y)) = f(x) + (2x + y)g(y)\] for all real numbers $x$ and $y$. [i]Proposed by Japan[/i]

Let $ABC$ be a triangle with $AB = 7, BC = 5,$ and $CA = 6$. Let $D$ be a variable point on segment $BC$, and let the perpendicular bisector of $AD$ meet segments $AC, AB$ at $E, F,$ respectively. It is given that there is a point $P$ inside $\triangle ABC$ such that $\frac{AP}{PC} = \frac{AE}{EC}$ and $\frac{AP}{PB} = \frac{AF}{FB}$. The length of the path traced by $P$ as $D$ varies along segment $BC$ can be expressed as $\sqrt{\frac{m}{n}}\sin^{-1}\left(\sqrt \frac 17\right)$, where $m$ and $n$ are relatively prime positive integers, and angles are measured in radians. Compute $100m + n$. [i]Proposed by Edward Wan[/i]

Let $I$ be the incenter of an acute-angled triangle $ABC$. Let $P$, $Q$, $R$ be points on sides $AB$, $BC$, $CA$ respectively, such that $AP=AR$, $BP=BQ$ and $\angle PIQ = \angle BAC$. Prove that $QR \perp AC$.

The diagonals of a quadrilateral $ABCD$ are perpendicular: $AC\perp BD$. Four squares, $ABEF,BCGH,CDIJ,DAKL$, are erected externally on its sides. The intersection points of the pairs of straight lines $CL,DF; DF,AH; AH,BJ; BJ,CL$ are denoted by $P_1,Q_1,R_1, S_1$, respectively, and the intersection points of the pairs of straight lines $AI,BK; BK,CE;$ $ CE,DG; DG,AI$ are denoted by $P_2,Q_2,R_2, S_2$, respectively. Prove that $P_1Q_1R_1S_1 \cong P_2Q_2R_2S_2.$

$ n$ people decide to play a game. There are $ n\minus{}1$ ropes and each of its two ends are in hand of one of the players, in such a way that ropes and players form a tree. (Each person can hold more than rope end.) At each step a player gives one of the rope ends he is holding to another player. The goal is to make a path of length $ n\minus{}1$ at the end. But the game regulations change before game starts. Everybody has to give one of his rope ends only two one of his neighbors. Let $ a$ and $ b$ be minimum steps for reaching to goal in these two games. Prove that $ a\equal{}b$ if and only if by removing all players with one rope end (leaves of the tree) the remaining people are on a path. (the remaining graph is a path.) [img]http://i37.tinypic.com/2l9h1tv.png[/img]

Points $C_1$ and $C_2$ lie on side $AB$ of triangle $ABC$, where the point $C_1$ belongs to the segment $AC_2$ and $\angle ACC_1= \angle BCC_2$. On segments $CC_1$ and $CC_2$ points $A'$ and $B'$ are taken such that $\angle CAA'= \angle CBB' = \angle C_1CC_2$. Prove that the center of the circle $(CA'B')$ lies on the perpendicular bisector of the segment $AB$.

In the $xOy$ system, consider the points $A_n(n,n^3)$ with $n\in \mathbb{N}^*$ and the point $B(0,1)$. Prove that a) for any positive integers $k>j>i\ge 1$, the points $A_i,A_j,A_k$ cannot be collinear. b) for any positive integers $i_k>i_{k-1}>\ldots>i_1\ge 1$, we have \[\mu(\widehat{A_{i_1}OB})+\mu(\widehat{A_{i_2}OB})+\cdots+\mu(\widehat{A_{i_k}OB})<\frac{\pi}{2}\] [i]***[/i]

In the interior of the convex polygon $A_1A_2...A_{2n}$ there is point $M$. Prove that at least one side of the polygon has not intersection points with the lines $MA_i$, $1\le i\le 2n$. (Spain)

Let $P$ be a polynomial of degree greater than or equal to $4$ with integer coefficients. An integer $x$ is called $P$-[i]representable[/i] if there exists integer numbers $a$ and $b$ such that $x = P(a) - P(b)$. Prove that, if for all $N \geq 0$, more than half of the integers of the set $\{0,1,\dots,N\}$ are $P$-[i]representable[/i], then all the even integers are $P$-[i]representable[/i] or all the odd integers are $P$-[i]representable[/i].

Let $ABCD$ be a square with side length $6$. Let $E$ be a point on the perimeter of $ABCD$ such that the area of $\triangle{AEB}$ is $\frac{1}{6}$ the area of $ABCD$. Find the maximum possible value of $CE^2$. [i]Proposed by Anthony Yang[/i]

Let \( ABC \) be an acute-angled scalene triangle with circumcenter \( O \). Denote by \( M \), \( N \), and \( P \) the midpoints of sides \( BC \), \( CA \), and \( AB \), respectively. Let \( \omega \) be the circle passing through \( A \) and tangent to \( OM \) at \( O \). The circle \( \omega \) intersects \( AB \) and \( AC \) at points \( E \) and \( F \), respectively (where \( E \) and \( F \) are distinct from \( A \)). Let \( I \) be the midpoint of segment \( EF \), and let \( K \) be the intersection of lines \( EF \) and \( NP \). Prove that \( AO = 2IK \) and that triangle \( IMO \) is isosceles.

For every positive integer $n$, define $$f(n)=\sum_{p\mid n}{p^{k_p}},$$where the sum is taken over all positive prime divisors $p$ of $n$, and $k_p$ is the unique integer satisfying $$p^{k_p}\leqslant n<p^{k_p+1}.$$Find$$\limsup_{n\to \infty} \frac{f(n)\log \log n}{n\log n} .$$

Two robots are programmed to communicate numbers using different bases. The first robot states: "I communicate in base 10, which interestingly is a perfect square. You communicate in base 16, which is not a perfect square." The second robot states: "I find it more interesting that the sum of our bases is the factorial of an integer." The second robot is referring to the factorial of which integer?

Solve the quasi-homogeneous equation \[\ddot{x}=x^5+x^2\dot{x}\]

Let $ABCD$ be a square of side length $4$. Points $E$ and $F$ are chosen on sides $BC$ and $DA$, respectively, such that $EF = 5$. Find the sum of the minimum and maximum possible areas of trapezoid $BEDF$. [i]Proposed by Andrew Wu[/i]

Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for any two reals $x$ and $y$, we have $f\left( f\left( x+y\right) \right) +xy=f\left( x+y\right) +f\left( x\right) f\left( y\right) $.

The sum $\frac{1}{1}+\frac{1}{2}+\frac{1}{3}+\frac{1}{4}+\frac{1}{5}+\frac{1}{6}=\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n.$

Let $S^1 = \{ z \in \mathbb{C} \mid |z| =1 \}$ be the unit circle in the complex plane. Let $f \colon S^1 \longrightarrow S^2$ be the map given by $f(z) = z^2$. We define $f^{(1)} \colon = f$ and $f^{(k+1)} \colon = f \circ f^{(k)}$ for $k \geq 1$. The smallest positive integer $n$ such that $f^{(n)}(z) = z$ is called the [i]period[/i] of $z$. Determine the total number of points in $S^1$ of period $2025$. (Hint : $2025 = 3^4 \times 5^2$)

Let $\triangle{PQR}$ be a right triangle with $PQ=90$, $PR=120$, and $QR=150$. Let $C_{1}$ be the inscribed circle. Construct $\overline{ST}$ with $S$ on $\overline{PR}$ and $T$ on $\overline{QR}$, such that $\overline{ST}$ is perpendicular to $\overline{PR}$ and tangent to $C_{1}$. Construct $\overline{UV}$ with $U$ on $\overline{PQ}$ and $V$ on $\overline{QR}$ such that $\overline{UV}$ is perpendicular to $\overline{PQ}$ and tangent to $C_{1}$. Let $C_{2}$ be the inscribed circle of $\triangle{RST}$ and $C_{3}$ the inscribed circle of $\triangle{QUV}$. The distance between the centers of $C_{2}$ and $C_{3}$ can be written as $\sqrt{10n}$. What is $n$?

Professor Oak is feeding his $100$ Pokémon. Each Pokémon has a bowl whose capacity is a positive real number of kilograms. These capacities are known to Professor Oak. The total capacity of all the bowls is $100$ kilograms. Professor Oak distributes $100$ kilograms of food in such a way that each Pokémon receives a non-negative integer number of kilograms of food (which may be larger than the capacity of the bowl). The [i]dissatisfaction level[/i] of a Pokémon who received $N$ kilograms of food and whose bowl has a capacity of $C$ kilograms is equal to $\lvert N-C\rvert$. Find the smallest real number $D$ such that, regardless of the capacities of the bowls, Professor Oak can distribute food in a way that the sum of the dissatisfaction levels over all the $100$ Pokémon is at most $D$. [i]Oleksii Masalitin, Ukraine[/i]

What is the median of the following list of $4040$ numbers$?$ $$1, 2, 3, ..., 2020, 1^2, 2^2, 3^2, ..., 2020^2$$ $\textbf{(A) } 1974.5 \qquad \textbf{(B) } 1975.5 \qquad \textbf{(C) } 1976.5 \qquad \textbf{(D) } 1977.5 \qquad \textbf{(E) } 1978.5$

The Fort Worth Zoo has a number of two-legged birds and a number of four-legged mammals. On one visit to the zoo, Margie counted 200 heads and 522 legs. How many of the animals that Margie counted were two-legged birds? $\textbf{(A)}\hspace{.05in}61 \qquad \textbf{(B)}\hspace{.05in}122 \qquad \textbf{(C)}\hspace{.05in}139 \qquad \textbf{(D)}\hspace{.05in}150 \qquad \textbf{(E)}\hspace{.05in}161 $

Anna and Orjan play the following game: they start with a positive integer $n>1$, Anna writes it as the sum of two other positive integers, $n = n_1+n_2$. Orjan deletes one of them, $n_1$ or $n_2$. If the remaining number is larger than $1$, the process is repeated, i.e. Anna writes it as the sum of two positive integers, $ n_3+n_4$, Orjan deletes one of them etc. The game ends when the last number is $1$. Orjan is the winner if there are two equal numbers among the numbers he has deleted, otherwise Anna wins. Who is winning the game if n = 2008 and they both play optimally?

Each pair of opposite sides of a convex hexagon has the following property: the distance between their midpoints is equal to $\dfrac{\sqrt{3}}{2}$ times the sum of their lengths. Prove that all the angles of the hexagon are equal.

A subset of the set $A={1,2,\dots ,n}$ is called [i]connected[/i], if it consists of one number or a certain amount of consecutive numbers. Find the greatest $k$ (defined as a function of $n$) for which there exists $k$ different subsets $A_1,A_2,…,A_k$ of $A$ the intersection of each two of which is a [i]connected[/i] set.