A [i]simple hyperplane[/i] in $\mathbb{R}^4$ has the form \[k_1x_1+k_2x_2+k_3x_3+k_4x_4=0\] for some integers $k_1,k_2,k_3,k_4\in \{-1,0,1\}$ that are not all zero. Find the number of regions that the set of all simple hyperplanes divide the unit ball $x_1^2+x_2^2+x_3^2+x_4^2\leq 1$ into. [i]Proposed by Yannick Yao[/i]

Let $\gamma$ be the circumcircle of the acute triangle $ABC$. Let $P$ be the midpoint of the minor arc $BC$. The parallel to $AB$ through $P$ cuts $BC, AC$ and $\gamma$ at points $R,S$ and $T$, respectively. Let $K \equiv AP \cap BT$ and $L \equiv BS \cap AR$. Show that $KL$ passes through the midpoint of $AB$ if and only if $CS = PR$.

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

If $p$ is a prime number and $x, y$ are positive integers, find in terms of $p$, all pairs $(x, y)$ that satisfy the equation: $$p(x -2) = x(y -1).$$ If $x+y = 21$, find all triples $(x, y, p)$ that satisfy this equation.

Let $ABC$ be a triangle with sides $AB = 34$, $BC = 15$, $AC = 35$ and let $\Gamma$ be the circle of smallest possible radius passing through $A$ tangent to $BC$. Let the second intersections of $\Gamma$ and sides $AB$, $AC$ be the points $X, Y$ . Let the ray $XY$ intersect the circumcircle of the triangle $ABC$ at $Z$. If $AZ =\frac{p}{q}$ for relatively prime integers $p$ and $q$, find $p + q$.

[b]p1.[/b] Let $p > 5$ be a prime. It is known that the average of all of the prime numbers that are at least $5$ and at most $p$ is $12$. Find $p$. [b]p2.[/b] The numbers $1, 2,..., n$ are written down in random order. What is the probability that $n-1$ and $n$ are written next to each other? (Give your answer in term of $n$.) [b]p3.[/b] The Duke Blue Devils are playing a basketball game at home against the UNC Tar Heels. The Tar Heels score $N$ points and the Blue Devils score $M$ points, where $1 < M,N < 100$. The first digit of $N$ is $a$ and the second digit of $N$ is $b$. It is known that $N = a+b^2$. The first digit of $M$ is $b$ and the second digit of $M$ is $a$. By how many points do the Blue Devils win? [b]p4.[/b] Let $P(x)$ be a polynomial with integer coefficients. It is known that $P(x)$ gives a remainder of $1$ upon polynomial division by $x + 1$ and a remainder of $2$ upon polynomial division by $x + 2$. Find the remainder when $P(x)$ is divided by $(x + 1)(x + 2)$. [b]p5.[/b] Dracula starts at the point $(0,9)$ in the plane. Dracula has to pick up buckets of blood from three rivers, in the following order: the Red River, which is the line $y = 10$; the Maroon River, which is the line $y = 0$; and the Slightly Crimson River, which is the line $x = 10$. After visiting all three rivers, Dracula must then bring the buckets of blood to a castle located at $(8,5)$. What is the shortest distance that Dracula can walk to accomplish this goal? [b]p6.[/b] Thirteen hungry zombies are sitting at a circular table at a restaurant. They have five identical plates of zombie food. Each plate is either in front of a zombie or between two zombies. If a plate is in front of a zombie, that zombie and both of its neighbors can reach the plate. If a plate is between two zombies, only those two zombies may reach it. In how many ways can we arrange the plates of food around the circle so that each zombie can reach exactly one plate of food? (All zombies are distinct.) [b]p7.[/b] Let $R_I$ , $R_{II}$ ,$R_{III}$ ,$R_{IV}$ be areas of the elliptical region $$\frac{(x - 10)^2}{10}+ \frac{(y-31)^2}{31} \le 2009$$ that lie in the first, second, third, and fourth quadrants, respectively. Find $R_I -R_{II} +R_{III} -R_{IV}$ . [b]p8.[/b] Let $r_1, r_2, r_3$ be the three (not necessarily distinct) solutions to the equation $x^3+4x^2-ax+1 = 0$. If $a$ can be any real number, find the minimum possible value of $$\left(r_1 +\frac{1}{r_1} \right)^2+ \left(r_2 +\frac{1}{r_2} \right)^2+ \left(r_3 +\frac{1}{r_3} \right)^2$$ [b]p9.[/b] Let $n$ be a positive integer. There exist positive integers $1 = a_1 < a_2 <... < a_n = 2009$ such that the average of any $n - 1$ of elements of $\{a_1, a_2,..., a_n\}$ is a positive integer. Find the maximum possible value of $n$. [b]p10.[/b] Let $A(0) = (2, 7, 8)$ be an ordered triple. For each $n$, construct $A(n)$ from $A(n - 1)$ by replacing the $k$th position in $A(n - 1)$ by the average (arithmetic mean) of all entries in $A(n - 1)$, where $k \equiv n$ (mod $3$) and $1 \le k \le 3$. For example, $A(1) = \left( \frac{17}{3} , 7, 8 \right)$ and $A(2) = \left( \frac{17}{3} , \frac{62}{9}, 8\right)$. It is known that all entries converge to the same number $N$. Find the value of $N$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be the number of pairs of values of $b$ and $c$ such that $3x+by+c=0$ and $cx-2y+12=0$ have the same graph. Then $n$ is: $ \textbf{(A)}\ 0\qquad\textbf{(B)}\ 1\qquad\textbf{(C)}\ 2\qquad\textbf{(D)}\ \text{finite but more than 2}\qquad\textbf{(E)}\ \text{greater than any finite number} $

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

In the exterior of the triangle $ABC$ with $m(\angle B) > 45^o$, $m(\angle C) >45°^o$ one constructs the right isosceles triangles $ACM$ and $ABN$ such that $m(\angle CAM) = m(\angle BAN) = 90^o$ and, in the interior of $ABC$, the right isosceles triangle $BCP$, with $m(\angle P) = 90^o$. Show that the triangle $MNP$ is a right isosceles triangle.

Let $K, K_1$ be two circles with the same center and their radii equal to $R$ and $R_1 (R_1>R)$ respectively. Quadrilateral $ABCD$ is inscribed in circle $K$. Quadrilateral $A_1B_1C_1D_1$ is inscribed in circle $K_1$ where $A_1,B_1,C_1,D_1$ lie on rays $CD,DA,AB,BC$ respectively. Show that $\dfrac{S_{A_1B_1C_1D_1}}{S_{ABCD}}\ge \dfrac{R^2_1}{R^2}$.

A rectangular piece of paper has top edge $AD$. A line $L$ from $A$ to the bottom edge makes an angle $x$ with the line $AD$. We want to trisect $x$. We take $B$ and $C$ on the vertical ege through $A$ such that $AB = BC$. We then fold the paper so that $C$ goes to a point $C'$ on the line $L$ and $A$ goes to a point $A'$ on the horizontal line through $B$. The fold takes $B$ to $B'$. Show that $AA'$ and $AB'$ are the required trisectors.

Let $n$ be a positive integer. Let $T_n$ be a set of positive integers such that: \[{T_n={ \{11(k+h)+10(n^k+n^h)| (1 \leq k,h \leq 10)}}\}\] Find all $n$ for which there don't exist two distinct positive integers $a, b \in T_n$ such that $a\equiv b \pmod{110}$

A man in a rowing boat is at point A at a distance of $2$ kilometers from a straight coastline. By first rowing in to a point P and then strolling along the coast he reaches point B, which is at a distance of $5$ kilometers from C, which is the point on the coast closest to A. The man's speed at rest is $3$ kilometers per hour and his strolling speed is $5$ kilometers per hour. Decide where P should go be placed between C and B so that the man gets from A to B in the shortest possible time.

Given a quadrangle $ABCD$. The lengths of all its sides and diagonals are the rational numbers. Let $O$ be the point of its diagonals intersection. Prove that $|AO|$ - the length of the $[AO]$ segment is also rational.

Let $\overline{a_{n}a_{n-1}\ldots a_{1}a_{0}}$ be the decimal representation of a prime positive integer such that $n>1$ and $a_{n}>1$. Prove that the polynomial $P(x)=a_{n}x^{n}+\ldots +a_{1}x+a_{0}$ cannot be written as a product of two non-constant integer polynomials.

How many solutions satisfying the condition $1 < x < 5$ does the equation $\{x[x]\} = 0.5$ have? (Here $[x]$ is the integer part of the number $x$, $\{x\} = x - [x]$ is the fractional part of the number $x$.)