A polynomial $c_dx^d+c_{d-1}x^{d-1}+\dots+c_1x+c_0$ with degree $d$ is [i]reflexive[/i] if there is an integer $n\ge d$ such that $c_i=c_{n-i}$ for every $0\le i\le n$, where $c_i=0$ for $i>d$. Let $\ell\ge 2$ be an integer and $p(x)$ be a polynomial with integer coefficients. Prove that there exist reflexive polynomials $q(x)$, $r(x)$ with integer coefficients such that \[(1+x+x^2+\dots+x^{\ell-1})p(x)=q(x)+x^\ell r(x)\]

Let $n$ be a positive integer. Show that the equation \[\sqrt{x}+\sqrt{y}=\sqrt{n}\] have solution of pairs of positive integers $(x,y)$ if and only if $n$ is divisible by some perfect square greater than $1$. [i]Proposer: Nanang Susyanto[/i]

What is the sum of the real roots of the equation $4x^4-3x^2+7x-3=0$? $ \textbf{(A)}\ -1 \qquad\textbf{(B)}\ -2 \qquad\textbf{(C)}\ -3 \qquad\textbf{(D)}\ -4 \qquad\textbf{(E)}\ \text {None of above} $

For every integer $ k \geq 2,$ prove that $ 2^{3k}$ divides the number \[ \binom{2^{k \plus{} 1}}{2^{k}} \minus{} \binom{2^{k}}{2^{k \minus{} 1}} \] but $ 2^{3k \plus{} 1}$ does not. [i]Author: Waldemar Pompe, Poland[/i]

$ S$ is the set of all sequences $ \{a_i| 1 \leq i \leq 7, a_i \equal{} 0 \text{ or } 1\}.$ The distance between two elements $ \{a_i\}$ and $ \{b_i\}$ of $ S$ is defined as \[ \sum^7_{i \equal{} 1} |a_i \minus{} b_i|. \] $ T$ is a subset of $ S$ in which any two elements have a distance apart greater than or equal to 3. Prove that $ T$ contains at most 16 elements. Give an example of such a subset with 16 elements.

Let $n\ge4$ points on a circle be denoted by $1$ through $n$. A pair of two nonadjacent points denoted by $a$ and $b$ is called regular if all numbers on one of the arcs determined by $a$ and $b$ are less than $a$ and $b$. Prove that there are exactly $n-3$ regular pairs.

Given three planes and a ball in space. In space, find the number of different ways of placing another ball so that it would be tangent the three given planes and the given ball. It is assumed that the balls can only touch externally.

In acute triangle $ABC$, $D,E$ are two points on side $BC$, satisfying that $\angle BAE=\angle CAF$. $FM\perp AB,EN\perp AC$ ($M,N$ are foot points). $AE$ intersects the circumcircle of $\triangle ABC$ at $D$. Prove that the area of $\triangle ABC$ and quadrilateral $AMDN$ are equal.

Once upon a time, there was a tribe called the Goblin Tribe, and their regular game was ''The ATM Game (Level Giveaway)'' . The game stats with a number of Goblin standing in a circle. Then the Chieftain assigns a Level to each Goblin, which can be the same or different (Level is a number which is a non-negative integer). Start play by selecting a Goblin with Level $k$ ($k \not=). 0$) comes up. Let's assume Goblin $A$. Goblin $A$ explodes itself. Goblin A's Level becomes $0$. After that, Level of Goblin $k$ next to Goblin $A$ clockwise gets Level $1$. Prove that: 1.) If after that Goblin $k$ next to Goblin $A$ explodes itself and keep doing this, $k'$ next to that Goblin clockwise explodes itself. Prove that the level of each Goblin will be the same again. 2) 2.) If after that we can choose any Goblin whose level is not $0$ to explode itself. And keep doing this. Prove that no matter what the initial level is, we can make each level the way we want. But there is a condition that the sum of all Goblin's levels must be equal to the beginning. [i](gools)[/i]

In the arithmetic triangle below each number (apart from those in the first row) is the sum of the two numbers immediately above. $0 \, 1\, 2\, 3 \,4\, ... \,1991 \,1992\, 1993$ $\,\,1\, 3\, 5 \,7\, ......\,\,\,\,3983 \,3985$ $\,\,\,4 \,8 \,12\, .......... \,\,\,7968$ ······································· Prove that the bottom number is a multiple of $1993$.

A point in the cartesian plane with integer coordinates is called a lattice point. Consider the following one player game. A finite set of selected lattice points and finite set of selected segments is called a position in this game if the following hold: (i) The endpoints of each selected segment are lattice points; (ii) Each selected segment is parallel to a coordinate axis or to one of the lines $y = \pm x$, (iii) Each selected segment contains exactly five lattice points, all of which are selected, (iv) Every two selected segments have at most one common point. A move in this game consists of selecting a lattice point and a segment such that the new set of selected lattice points and segments is a position. Prove or disprove that there exists an initial position such that the game can have infinitely many moves.

Two runners started a race simultaneously. Initially they ran on the street toward the stadium and then 3 laps on the stadium. Both runners covered the whole distance at their own constant speed. During the whole race the first runner passed the second runner exactly twice. Prove that the speed of the first runner is at least double the speed of the second runner. (Author: I. Rubanov)

A cylindrical glass beaker is $8$ cm high and its circumference rim is $12$ cm wide . Inside, $3$ cm from the edge, there is a tiny drop of honey. In a point on its outer surface, belonging to the plane passing through the axis of the cylinder and for the drop of honey, and located $1$ cm from the base (or bottom) of the glass, there is a fly. What is the shortest path that the fly must travel, walking on the surface from the glass, to the drop of honey, and how long is said path? [hide=original wording]Un vaso de vidrio cil´ındrico tiene 8 cm de altura y su borde 12 cm de circunferencia. En su interior, a 3 cm del borde, hay una diminuta gota de miel. En un punto de su superficie exterior, perteneciente al plano que pasa por el eje del cilindro y por la gota de miel, y situado a 1 cm de la base (o fondo) del vaso, hay una mosca. ¿Cu´al es el camino m´as corto que la mosca debe recorrer, andando sobre la superficie del vaso, hasta la gota de miel, y qu´e longitud tiene dicho camino?[/hide]

Let $ABCDEF$ be a convex hexagon such that $AB=CD=EF=20, \ BC=DE=FA=21,$ and $\angle A=\angle C=\angle E=90^{\circ}.$ The area of $ABCDEF$ can then be expressed in the form $a+\tfrac{b\sqrt{c}}{d},$ where $a,\ b,\ c,$ and $d$ are positive integers, $b$ and $d$ are relatively prime, and $c$ is not divisible by the square of any prime. Find $a+b+c+d.$

The radius $r$ of a circle with center at the origin is an odd integer. There is a point ($p^m, q^n$) on the circle, with $p,q$ prime numbers and $m,n$ positive integers. Determine $r$.

Let $p$ be an odd prime number. For every integer $a,$ define the number $S_a = \sum^{p-1}_{j=1} \frac{a^j}{j}.$ Let $m,n \in \mathbb{Z},$ such that $S_3 + S_4 - 3S_2 = \frac{m}{n}.$ Prove that $p$ divides $m.$ [i]Proposed by Romeo Meštrović, Montenegro[/i]

Let $ABC$ be an isosceles triangle with vertex $A$ and $AB> BC$. Let $k$ be the circle with center $A$ passsing through $B$ and $C$. Let $H$ be the second intersection of $k$ with the altitude of the triangle $ABC$ through $B$. Further let $G$ be the second intersection of $k$ with the median through $B$ in triangle $ABC$. Let $X$ be the intersection of the lines $AC$ and $GH$. Show that $C$ is the midpoint of $AX$.

Consider a triangle $\vartriangle ACE$ with $\angle ACE = 45^o$ and $\angle CEA = 75^o$. Define points $Q, R$, and $P$ such that $AQ$, $CR$, and $EP$ are the altitudes of $\vartriangle ACE$. Let $H$ be the intersection of $AQ$, $CR$, and $EP$. Next define points $B, D$, and $F$ as follows. Extend $EP$ to point $B$ such that $BP = HP$, extend $AQ$ to point $D$ such that $DQ = HQ$, and extend $CR$ to point $F$ such that $F R = HR$. Finally, lengths $CH = 2$, $AH =\sqrt2$, and $EH =\sqrt3 - 1$. Compute the area of hexagon $ABCDEF$.

Let $H$ be the unit hemisphere $\{(x,y,z):x^2+y^2+z^2=1,z\geq 0\}$, $C$ the unit circle $\{(x,y,0):x^2+y^2=1\}$, and $P$ the regular pentagon inscribed in $C$. Determine the surface area of that portion of $H$ lying over the planar region inside $P$, and write your answer in the form $A \sin\alpha + B \cos\beta$, where $A,B,\alpha,\beta$ are real numbers.

If $yz:zx:xy=1:2:3$, then $\dfrac{x}{yz}:\dfrac{y}{zx}$ is equal to $\textbf{(A) }3:2\qquad\textbf{(B) }1:2\qquad\textbf{(C) }1:4\qquad\textbf{(D) }2:1\qquad \textbf{(E) }4:1$

Let $ABC$ be a triangle with incenter $I,$ circumcenter $O,$ and $A$-excenter $J_A.$ The incircle of $\triangle{ABC}$ touches side $BC$ at a point $D.$ Lines $OI$ and $J_AD$ meet at a point $K.$ Line $AK$ meets the circumcircle of $\triangle{ABC}$ again at a point $L \neq A.$ If $BD=11, CD=5,$ and $AO=10,$ the length of $DL$ can be expressed as $\tfrac{m\sqrt{p}}{n},$ where $m,n,p$ are positive integers, $m$ and $n$ are relatively prime, and $p$ is not divisible by the square of any prime. Find $m+n+p.$

Consider the set $S=\{1,2,...,n\}$. For every $k\in S$, define $S_{k}=\{X \subseteq S, \ k \notin X, X\neq \emptyset\}$. Determine the value of the sum \[S_{k}^{*}=\sum_{\{i_{1},i_{2},...,i_{r}\}\in S_{k}}\frac{1}{i_{1}\cdot i_{2}\cdot...\cdot i_{r}}\] [hide]in fact, this problem was taken from an austrian-polish[/hide]

Cyclic quadrilateral $ABCD$ satisfies $\angle ABD = 70^\circ$, $\angle ADB=50^\circ$, and $BC=CD$. Suppose $AB$ intersects $CD$ at point $P$, while $AD$ intersects $BC$ at point $Q$. Compute $\angle APQ-\angle AQP$.

Two grade seven students were allowed to enter a chess tournament otherwise composed of grade eight students. Each contestant played once with each other contestant and received one point for a win, one half point for a tie and zero for a loss. The two grade seven students together gained a total of eight points and each grade eight student scored the same number of points as his classmates. How many students for grade eight participated in the chess tournament? Is the solution unique?

Find the roots $ r_i \in \mathbb{R}$ of the polynomial \[ p(x) \equal{} x^n \plus{} n \cdot x^{n\minus{}1} \plus{} a_2 \cdot x^{n\minus{}2} \plus{} \ldots \plus{} a_n\] satisfying \[ \sum^{16}_{k\equal{}1} r^{16}_k \equal{} n.\]