Alex has a piece of cheese. He chooses a positive number a and cuts the piece into several pieces one by one. Every time he choses a piece and cuts it in the same ratio $1 : a$. His goal is to divide the cheese into two piles of equal masses. Can he do it if $(a) a$ is irrational? $(b) a$ is rational, $a \neq 1?$

Let $ABC$ be a triangle with $AC > BC,$ let $\omega$ be the circumcircle of $\triangle ABC,$ and let $r$ be its radius. Point $P$ is chosen on $\overline{AC}$ such taht $BC=CP,$ and point $S$ is the foot of the perpendicular from $P$ to $\overline{AB}$. Ray $BP$ mets $\omega$ again at $D$. Point $Q$ is chosen on line $SP$ such that $PQ = r$ and $S,P,Q$ lie on a line in that order. Finally, let $E$ be a point satisfying $\overline{AE} \perp \overline{CQ}$ and $\overline{BE} \perp \overline{DQ}$. Prove that $E$ lies on $\omega$.

There are $28$ students who have to be separated into two groups such that the number of students in each group is a multiple of $4$. The number of ways to split them into the groups can be written as $$\sum_{k \ge 0} 2^k a_k = a_0 +2a_1 +4a_2 +...$$ where each $a_i$ is either $0$ or $1$. Find the value of $$\sum_{k \ge 0} ka_k = 0+ a_1 +2a_2 +3a3_ +....$$

Some players participate in a competition. Suppose that each player plays one game against every other player and there is no draw game in the competition. Player $A$ is regarded as an excellent player if the following condition is satisfied: for any other player $B$, either $A$ beats $B$ or there exists another player $C$ such that $C$ beats $B$ and $A$ beats $C$. It is known that there is only one excellent player in the end, prove that this player beats all other players.

Andy and Eddie play a game in which they continuously flip a fair coin. They stop flipping when either they flip tails, heads, and tails consecutively in that order, or they flip three tails in a row. Then, if there has been an odd number of flips, Andy wins, and otherwise Eddie wins. Given that the probability that Andy wins is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$. [i]Proposed by Anderw Zhao and Zachary Perry[/i]

Two cyclists, $ k$ miles apart, and starting at the same time, would be together in $ r$ hours if they traveled in the same direction, but would pass each other in $ t$ hours if they traveled in opposite directions. The ratio of the speed of the faster cyclist to that of the slower is: $ \textbf{(A)}\ \frac {r \plus{} t}{r \minus{} t} \qquad\textbf{(B)}\ \frac {r}{r \minus{} t} \qquad\textbf{(C)}\ \frac {r \plus{} t}{r} \qquad\textbf{(D)}\ \frac {r}{t} \qquad\textbf{(E)}\ \frac {r \plus{} k}{t \minus{} k}$

[b]p1.[/b] Let $x_1 = 0$, $x_2 = 1/2$ and for $n >2$, let $x_n$ be the average of $x_{n-1}$ and $x_{n-2}$. Find a formula for $a_n = x_{n+1} - x_{n}$, $n = 1, 2, 3, \dots$. Justify your answer. [b]p2.[/b] Given a triangle $ABC$. Let $h_a, h_b, h_c$ be the altitudes to its sides $a, b, c,$ respectively. Prove: $\frac{1}{h_a}+\frac{1}{h_b}>\frac{1}{h_c}$ Is it possible to construct a triangle with altitudes $7$, $11$, and $20$? Justify your answer. [b]p3.[/b] Does there exist a polynomial $P(x)$ with integer coefficients such that $P(0) = 1$, $P(2) = 3$ and $P(4) = 9$? Justify your answer. [b]p4.[/b] Prove that if $\cos \theta$ is rational and $n$ is an integer, then $\cos n\theta$ is rational. Let $\alpha=\frac{1}{2010}$. Is $\cos \alpha $ rational ? Justify your answer. [b]p5.[/b] Let function $f(x)$ be defined as $f(x) = x^2 + bx + c$, where $b, c$ are real numbers. (A) Evaluate $f(1) -2f(5) + f(9)$ . (B) Determine all pairs $(b, c)$ such that $|f(x)| \le 8$ for all $x$ in the interval $[1, 9]$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Solve in real number the system $x^3=\frac{z}{y}-\frac{2y}{z}, y^3=\frac{x}{z}-\frac{2z}{x}, z^3=\frac{y}{x}-\frac{2x}{y}$

Let $ABC$ be an equilateral triangle and $\mathcal{E}$ the set of all points contained in the three segments $AB$, $BC$, and $CA$ (including $A$, $B$, and $C$). Determine whether, for every partition of $\mathcal{E}$ into two disjoint subsets, at least one of the two subsets contains the vertices of a right-angled triangle.

A person moves in the $x-y$ plane moving along points with integer co-ordinates $x$ and $y$ only. When she is at a point $(x,y)$, she takes a step based on the following rules: (a) if $x+y$ is even she moves to either $(x+1,y)$ or $(x+1,y+1)$; (b) if $x+y$ is odd she moves to either $(x,y+1)$ or $(x+1,y+1)$. How many distinct paths can she take to go from $(0,0)$ to $(8,8)$ given that she took exactly three steps to the right $((x,y)$ to $(x+1,y))$?

Let $n$ be a positive integer. Each square of a $(2n-1) \times (2n - 1)$ square board contains an arrow, either pointing up, down,to the left, or to the right. A beetle sits in one of the cells. Each year it creeps from one square in the direction of the arrow in that square, either reaching another square or leaving the board. Each time the beetle moves, the arrow in the square it leaves turns $\frac{\pi}{2}$ clockwise. Prove that the beetle leaves the board in at most $2^{3n-1}(n-1)!-4$ years after it first moves.

Let $ABC$ be an acute triangle with incenter $I$. On its circumcircle, let $M_A$, $M_B$ and $M_C$ be the midpoints of minor arcs $BC, CA$ and $AB$, respectively. Prove that the reflection $M_A$ over the line $IM_B$ lies on the circumcircle of the triangle $IM_BM_C$.

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Determine all non-negative real number $\alpha$ such that there exist a function $f:\mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that $$f(x^{\alpha}+y)=(f(x+y))^{\alpha}+f(y)$$ for any $x,y$ positive real numbers.

Consider a three-person game involving the following three types of fair six-sided dice. \begin{itemize} \item Dice of type $A$ have faces labelled $2$, $2$, $4$, $4$, $9$, $9$. \item Dice of type $B$ have faces labelled $1$, $1$, $6$, $6$, $8$, $8$. \item Dice of type $C$ have faces labelled $3$, $3$, $5$, $5$, $7$, $7$. \end{itemize} All three players simultaneously choose a die (more than one person can choose the same type of die, and the players don't know one another's choices) and roll it. Then the score of a player $P$ is the number of players whose roll is less than $P$'s roll (and hence is either $0$, $1$, or $2$). Assuming all three players play optimally, what is the expected score of a particular player?

Find all functions $f : R \to R$ with $f (x + yf(x + y))= y^2 + f(x)f(y)$ for all $x, y \in R$.

Determine all triplets of integers $(x, y, z)$ that validate the inequality $x^2 + y^2 + z^2 <xy + 3y + 2z$.

An inverted cone with base radius $12 \text{ cm}$ and height $18 \text{ cm}$ is full of water. The water is poured into a tall cylinder whose horizontal base has a radius of $24 \text{ cm}$. What is the height in centimeters of the water in the cylinder? $\textbf{(A) }1.5 \qquad \textbf{(B) }3 \qquad \textbf{(C) }4 \qquad \textbf{(D) }4.5 \qquad \textbf{(E) }6$

$a_1,a_2,\cdots,a_n$ are positive real numbers, $a_1+a_2+\cdots,a_n=1$. Prove that $$\sum_{m=1}^n\frac{a_m}{\prod\limits_{k=1}^m(1+a_k)}\leq1-\frac{1}{2^n}.$$

Let us call a triangle rational if each of its angles is a rational number when measured in degrees. Let us call a point inside triangle rational if joining it to the three vertices of the triangle we get three rational triangles. Show that any acute rational triangle contains at least three distinct rational points.

Given a point $P_0$ in the plane of the triangle $A_1A_2A_3$. Define $A_s=A_{s-3}$ for all $s\ge4$. Construct a set of points $P_1,P_2,P_3,\ldots$ such that $P_{k+1}$ is the image of $P_k$ under a rotation center $A_{k+1}$ through an angle $120^o$ clockwise for $k=0,1,2,\ldots$. Prove that if $P_{1986}=P_0$, then the triangle $A_1A_2A_3$ is equilateral.

If $x$ and $y$ are positive integers such that $(x-4)(x-10)=2^y$, then Find maximum value of $x+y$

Let $V$ be a set of eight points in $3\text{D}$ space that are the vertices of a cube with side length $1$. Compute the number of ways we can color the vertices in $V$ yellow or blue such that [list] [*] each vertex receives exactly one color, and [/*] [*] there exists a point in $3\text{D}$ space whose distance to each yellow vertex is less than $1$ and whose distance to each blue vertex is greater than $1$. [/*] [/list]

Find all real non-zero polynomials satisfying $P(x)^3+3P(x)^2=P(x^{3})-3P(-x)$ for all $x\in\mathbb{R}$.

The $ABCDE$ pentagon is inscribed in a circle and $AB = BC = CD$. Segments $AC$ and $BE$ intersect at $K$, and Segments $AD$ and $CE$ intersect at point$ L$. Prove that $AK = KL$.

Prove that for all real numbers $a,b,c$ the inequality $(a^2+b^2-c^2)(b^2+c^2-a^2)(c^2+a^2-b^2) \leq (a+b-c)^2(b+c-a)^2(c+a-b)^2$ holds.