Andy, Bella, and Chris are playing in a trivia contest. Andy has $21,200$ points, Bella has $23,600$ points, and Chris has $11,200$ points. They have reached the final round, which works as follows: [list] [*] they are given a hint as to what the only question of the round will be about; [*] then, each of them must bet some amount of their points---this bet must be a nonnegative integer (a player does not know any of the other players' bets, and this bet cannot be changed later on); [*] then, they will be shown the question, where they will have $30$ seconds to individually submit a response (a player does not know any of the other players' answers); [*] finally, once time runs out, their responses and bets are revealed---if a player's response is correct, then the number of points they bet will be added to their score, otherwise, it will be subtracted from their score, and whoever ends up having the most points wins the contest (if there is a tie for the win, then the winner is randomly decided). [/list] Suppose that the contestants are currently deciding their bets based on the hint that the question will be about history. Bella knows that she will likely get the question wrong, but she also knows that Andy, who dislikes history, will definitely get it wrong. Knowing this, Bella wagers an amount that will guarantee her a win. Find the maximum number of points Bella could have ended up with.

The segment $AB$ divides the square into two parts, in each of which a circle can be inscribed. The radii of these circles are equal to $r_1$ and $r_2$ respectively, where $r_1> r_2$. Find the length of $AB$.

We denote by gcd (...) the greatest common divisor of the numbers in (...). (For example, gcd$(4, 6, 8)=2$ and gcd $(12, 15)=3$.) Suppose that positive integers $a, b, c$ satisfy the following four conditions: $\bullet$ gcd $(a, b, c)=1$, $\bullet$ gcd $(a, b + c)>1$, $\bullet$ gcd $(b, c + a)>1$, $\bullet$ gcd $(c, a + b)>1$. a) Is it possible that $a + b + c = 2015$? b) Determine the minimum possible value that the sum $a+ b+ c$ can take.

Let $P(x)=x^3+ax^2+bx+c$ be a polynomial where $a,b,c$ are integers and $c$ is odd. Let $p_{i}$ be the value of $P(x)$ at $x=i$. Given that $p_{1}^3+p_{2}^{3}+p_{3}^{3}=3p_{1}p_{2}p_{3}$, find the value of $p_{2}+2p_{1}-3p_{0}.$

A circle touches the sides $AB,BC, CD,DA$ of a square at points $K,L,M,N$ respectively, and $BU, KV$ are parallel lines such that $U$ is on $DM$ and $V$ on $DN$. Prove that $UV$ touches the circle.

Positive real numbers $a, b$ are such that $a^3 + b^3 = 2$. Show that that $\frac{1}{a}+\frac{1}{b}\ge 2(a^2 - a + 1)(b^2 - b + 1)$.

Alice, Bob, Charlie, Diana, Emma, and Fred sit in a circle, in that order, and each roll a six-sided die. Each person looks at his or her own roll, and also looks at the roll of either the person to the right or to the left, deciding at random. Then, at the same time, Alice, Bob, Charlie, Diana, Emma and Fred each state the expected sum of the dice rolls based on the information they have. All six people say different numbers; in particular, Alice, Bob, Charlie, and Diana say $19$, $22$, $21$, and $23$, respectively. Compute the product of the dice rolls.

Carl decided to fence in his rectangular garden. He bought $20$ fence posts, placed one on each of the four corners, and spaced out the rest evenly along the edges of the garden, leaving exactly $4$ yards between neighboring posts. The longer side of his garden, including the corners, has twice as many posts as the shorter side, including the corners. What is the area, in square yards, of Carl’s garden? $\textbf{(A)}\ 256\qquad\textbf{(B)}\ 336\qquad\textbf{(C)}\ 384\qquad\textbf{(D)}\ 448\qquad\textbf{(E)}\ 512$

Circles with centers $ A$ and $ B$ have radii 3 and 8, respectively. A common internal tangent intersects the circles at $ C$ and $ D$, respectively. Lines $ AB$ and $ CD$ intersect at $ E$, and $ AE \equal{} 5$. What is $ CD$? [asy]unitsize(2.5mm); defaultpen(fontsize(10pt)+linewidth(.8pt)); dotfactor=3; pair A=(0,0), Ep=(5,0), B=(5+40/3,0); pair M=midpoint(A--Ep); pair C=intersectionpoints(Circle(M,2.5),Circle(A,3))[1]; pair D=B+8*dir(180+degrees(C)); dot(A); dot(C); dot(B); dot(D); draw(C--D); draw(A--B); draw(Circle(A,3)); draw(Circle(B,8)); label("$A$",A,W); label("$B$",B,E); label("$C$",C,SE); label("$E$",Ep,SSE); label("$D$",D,NW);[/asy]$ \textbf{(A) } 13\qquad \textbf{(B) } \frac {44}{3}\qquad \textbf{(C) } \sqrt {221}\qquad \textbf{(D) } \sqrt {255}\qquad \textbf{(E) } \frac {55}{3}$

Let $\mathbb{Q}^{+}$ denote the set of positive rational numbers. Find, with proof, all functions $f:\mathbb{Q}^+ \to \mathbb{Q}^+$ such that, for all positive rational numbers $x$ and $y,$ we have \[f(x)=f(x+y)+f(x+x^2f(y)).\]

Square ABCD has side length 7. Let $A_1$, $B_1$, $C_1$, and $D_1$ be points on rays $\overrightarrow{AB}$, $\overrightarrow{BC}$, $\overrightarrow{CD}$, and $\overrightarrow{DA}$, respectively, where each point is $3$ units from the end of the ray so that $A_1B_1C_1D_1$ forms a second square as shown. SImilarly, let $A_2$, $B_2$, $C_2$, and $D_2$ be points on segments $A_1B_1$, $B_1C_1$, $C_1D_1$, and $D_1A_1$, respectively, forming another square where $A_2$ divides segment $A_1B_1$ into two pieces whose lengths are in the same ratio as $AA_1$ is to $A_1B$. Continue this process to construct square $A_nB_nC_nD_n$ for each positive integer $n$. Find the total of all the perimeters of all the squares. [asy] size(180); pair[] A={(-1,-1),(-1,1),(1,1),(1,-1),(-1,-1)}; string[] X={"A","B","C","D"}; for(int k=0;k<10;++k) { for(int m=0;m<4;++m) { if(k==0) label("$"+X[m]+"$",A[m],A[m]); if(k==1) label("$"+X[m]+"_1$",A[m],A[m]); draw(A[m]--A[m+1]); A[m]+=3/7*(A[m+1]-A[m]); } A[4]=A[0]; }[/asy]

If you have $65$ points in a plane, we will make the lines that passes by any two points in this plane and we obtain exactly $2015$ distinct lines, prove that least $4$ points are collinears!!

Find $5$ last digits of the number $M = 5^{2010}$ . (A): $65625$, (B): $45625$, (C): $25625$, (D): $15625$, (E) None of the above.

Prove that there exists a positive integer $n$ such that the last digits of $n^3$ are $...201320132013$.

Square with side 100 was cut by 99 horizontal and 99 vertical lines into 10000 rectangles (not necessarily with integer sides). How many rectangles in this square with area not exceeding 1 at least can be?

Find all positive integers $n$, for which there exist positive integers $a>b$, satisfying $n=\frac{4ab}{a-b}$.