$p$ is an odd prime. Show that $p$ divides $n(n+1)(n+2)(n+3) + 1$ for some integer $n$ iff $p$ divides $m^2 - 5$ for some integer $m$.

Let $T$ be an acute triangle. Inscribe a rectangle $R$ in $T$ with one side along a side of $T.$ Then inscribe a rectangle $S$ in the triangle formed by the side of $R$ opposite the side on the boundary of $T,$ and the other two sides of $T,$ with one side along the side of $R.$ For any polygon $X,$ let $A(X)$ denote the area of $X.$ Find the maximum value, or show that no maximum exists, of $\tfrac{A(R)+A(S)}{A(T)},$ where $T$ ranges over all triangles and $R,S$ over all rectangles as above.

Find all polynomials $p(x)$ such that for all reals $a, b$ and $c$, with $a+b+c=0$, satisfies $$p(a^3)+p(b^3)+p(c^3)=3p(abc)$$

On a plane, there are $7$ seats. Each is assigned to a passenger. The passengers walk on the plane one at a time. The first passenger sits in the wrong seat (someone else's). For all the following people, they either sit in their assigned seat, or if it is full, randomly pick another. You are the last person to board the plane. What is the probability that you sit in your own seat?

A real number $ to $ is randomly and uniformly chosen from the $ [- 3,4] $ interval. What is the probability that all roots of the polynomial $ x ^ 3 + ax ^ 2 + ax + 1 $ are real?

Let $ABC$ be an acute-angled triangle, $C'$ and $A'$ be arbitrary points on the sides $AB$ and $BC$ respectively, and $B'$ be the midpoint of the side $AC$. (a) Prove that the area of triangle $A'B'C'$ is at most half the area of triangle $ABC$. (b) Prove that the area of triangle $A'B'C'$ is equal to one fourth of the area of triangle $ABC$ if and only if at least one of the points $A'$, $C'$ is the midpoint of the corresponding side. (E Cherepanov)

Determine the number of real roots of the equation $$16x^5 - 20x^3 + 5x + m = 0.$$

The incircle of a non-isosceles triangle $ABC$ with the center $I$ touches the sides $ BC, CA, AB$ at $ A_1 , B_1 , C_1 $ respectively. The line $AI$ meets the circumcircle of $ABC$ at $A_2 $. The line $B_1 C_1 $ meets the line $BC$ at $A_3 $ and the line $A_2 A_3 $ meets the circumcircle of $ABC$ at $A_4 (\ne A_2 ) $. Define $B_4 , C_4 $ similarly. Prove that the lines $ AA_4 , BB_4 , CC_4 $ are concurrent.

The diagram below shows a rectangle with side lengths $4$ and $8$ and a square with side length $5$. Three vertices of the square lie on three different sides of the rectangle, as shown. What is the area of the region inside both the square and the rectangle? [asy] size(5cm); filldraw((4,0)--(8,3)--(8-3/4,4)--(1,4)--cycle,mediumgray); draw((0,0)--(8,0)--(8,4)--(0,4)--cycle,linewidth(1.1)); draw((1,0)--(1,4)--(4,0)--(8,3)--(5,7)--(1,4),linewidth(1.1)); label("$4$", (8,2), E); label("$8$", (4,0), S); label("$5$", (3,11/2), NW); draw((1,.35)--(1.35,.35)--(1.35,0),linewidth(.4)); draw((5,7)--(5+21/100,7-28/100)--(5-7/100,7-49/100)--(5-28/100,7-21/100)--cycle,linewidth(.4)); [/asy] $\textbf{(A) } 15\dfrac{1}{8} \qquad \textbf{(B) } 15\dfrac{3}{8} \qquad \textbf{(C) } 15\dfrac{1}{2} \qquad \textbf{(D) } 15\dfrac{5}{8} \qquad \textbf{(E) } 15\dfrac{7}{8}$

The children sitting around a circle are playing the game as follows. At first the teacher gives each child an even number of candies (bigger than $ 0$, may be equal, maybe different). A certain child gives half of his candies to his neighbor on the right. Then the child who has just received candies does the same if he has an even number of candies, otherwise he gets one candy from the teacher and then does the job; and so on. Prove that after several steps there will be a child who will be able, giving the teacher half of his candies, to make the numbers of candies of all the children equal.

We´re given an inscriptible quadrilateral $ DEFG $ having some vertices on the sides of a triangle $ ABC, $ and some vertices (at least one of them) coinciding with the vertices of the same triangle. Knowing that the lines $ DF $ and $ EG $ aren´t parallel, find the locus of their intersection. [i]Dan Brânzei[/i]

Point A, which is within an acute, is reflected with respect to both sides of angle A to obtain the points B and C. the segment BC intersects the sides of angle A at points D and E respectively. Prove that BC/2>DE.

A team contest between $n$ participants is to be held. Each of these participants has exactly $k$ enemies among the other participants. (If $A$ is an enemy of $B$, then $B$ is an enemy of $A$. Nobody is his own enemy.) Assume that there are no three participants such that every two of them are enemies of each other. A [i]subversive enmity[/i] will mean an (un-ordered) pair of two participants which are enemies of each other and which belong to one and the same team. Show that one can divide the participants into two teams such that the number of subversive enmities is $\leq\frac{k\left(n-2k\right)}{2}$. (The teams need not be of equal size.) [i]Note.[/i] The actual source of this problem is: Glenn Hopkins, William Staton, [i]Maximal Bipartite Subgraphs[/i], Ars Combinatoria 13 (1982), pp. 223-226. It should be noticed that $\frac{k\left(n-2k\right)}{2}\leq\frac{n^{2}}{16}$, so the bound in the problem can be replaced by $\frac{n^{2}}{16}$ (which makes it weaker, but independent of $k$). darij

Durer drew a regular triangle and then poked at an interior point. He made perpendiculars from it sides and connected it to the vertices. In this way, $6$ small triangles were created, of which (moving clockwise) all the second one is painted gray, as shown in figure. Show that the sum of the gray areas is just half the area of the triangle. [img]https://cdn.artofproblemsolving.com/attachments/e/7/a84ad28b3cd45bd0ce455cee2446222fd3eac2.png[/img]

Chords $AA^{\prime}$, $BB^{\prime}$, $CC^{\prime}$ of a sphere meet at an interior point $P$ but are not contained in a plane. The sphere through $A$, $B$, $C$, $P$ is tangent to the sphere through $A^{\prime}$, $B^{\prime}$, $C^{\prime}$, $P$. Prove that $\, AA' = BB' = CC'$.

Let $ \left( x_n \right)_{n\ge 1} $ be a sequence of positive real numbers, verifying the inequality $ x_n\le \frac{x_{n-1}+x_{n-2}}{2} , $ for any natural number $ n\ge 3. $ Show that $ \left( x_n \right)_{n\ge 1} $ is convergent.

In each square of a $4\times 4$ board, we are to write an integer in such a way that the sums of the numbers in each column and in each row are nonnegative integral powers of $2$. Is it possible to do this in such a way that every two of these eight sums are different? Justify your answer.

Let $ a_1 \equal{} 11^{11}, \, a_2 \equal{} 12^{12}, \, a_3 \equal{} 13^{13}$, and $ a_n \equal{} |a_{n \minus{} 1} \minus{} a_{n \minus{} 2}| \plus{} |a_{n \minus{} 2} \minus{} a_{n \minus{} 3}|, n \geq 4.$ Determine $ a_{14^{14}}$.

Set $ M= \{1,2,\cdots,2550\} $ and $\min A ,\ \max A $ represents the minimum and maximum values of the elements in the set $A$. For $ k \in \{1,2,\cdots 2006\} $define $$ x_k = \frac{1}{2008} \bigg (\sum_{A \subset M : n(A)= k} (\ min A + \max A) \, \bigg) $$. Find remainder from division $\sum_{i=1}^{2006} x_i^2$ with $2551$. [i](passer-by)[/i]

Let $ABCD$ be a cyclic quadrilateral with $AB<CD$. The diagonals intersect at the point $F$ and lines $AD$ and $BC$ intersect at the point $E$. Let $K$ and $L$ be the orthogonal projections of $F$ onto lines $AD$ and $BC$ respectively, and let $M$, $S$ and $T$ be the midpoints of $EF$, $CF$ and $DF$ respectively. Prove that the second intersection point of the circumcircles of triangles $MKT$ and $MLS$ lies on the segment $CD$. [i](Greece - Silouanos Brazitikos)[/i]

Find all functions $f: \mathbb{R} \mapsto \mathbb{R}$ such that $$f(x)f\left(yf(x)-1\right)=x^2f(y)-f(x),$$for all $x,y \in \mathbb{R}$.

A(x,y), B(x,y), and C(x,y) are three homogeneous real-coefficient polynomials of x and y with degree 2, 3, and 4 respectively. we know that there is a real-coefficient polinimial R(x,y) such that $B(x,y)^2-4A(x,y)C(x,y)=-R(x,y)^2$. Proof that there exist 2 polynomials F(x,y,z) and G(x,y,z) such that $F(x,y,z)^2+G(x,y,z)^2=A(x,y)z^2+B(x,y)z+C(x,y)$ if for any x, y, z real numbers $A(x,y)z^2+B(x,y)z+C(x,y)\ge 0$

For a positive integer $n$ and nonzero digits $a$, $b$, and $c$, let $A_n$ be the $n$-digit integer each of whose digits is equal to $a$; let $B_n$ be the $n$-digit integer each of whose digits is equal to $b$, and let $C_n$ be the $2n$-digit (not $n$-digit) integer each of whose digits is equal to $c$. What is the greatest possible value of $a + b + c$ for which there are at least two values of $n$ such that $C_n - B_n = A_n^2$? $\textbf{(A)} \text{ 12} \qquad \textbf{(B)} \text{ 14} \qquad \textbf{(C)} \text{ 16} \qquad \textbf{(D)} \text{ 18} \qquad \textbf{(E)} \text{ 20}$

In a certain country there are $10$ cities connected by a network of one-way nonstop flights so that it is possible to fly (using one or more flights) from any city to any other. Let $n$ be the least number of flights needed to complete a trip starting from one of the cities, visiting all others and returning to the starting point. Find the greatest possible value of $n$.

The quadrilateral PQRS whose vertices are the midpoints of the sides AB, BC, CD, DA, respectively of a quadrilateral ABCD is called the midpoint quadrilateral of ABCD. Determine all circumscribed quadrilaterals whose mid-point quadrilaterals are squares. .