In a triangle $ABC$, $I$ is the incentre and $D$ the intersection point of $AI$ and $BC$. Show that $AI+CD=AC$ if and only if $\angle B=60^{\circ}+\frac{_1}{^3}\angle C$.

Mr. Squash bought a large parking lot in Utah, which has an area of $600$ square meters. A car needs $6$ square meters of parking space while a bus needs $30$ square meters of parking space. Mr. Squash charges $\$2.50$ per car and $\$7.50$ per bus, but Mr. Squash can only handle at most $60$ vehicles at a time. Find the ordered pair $(a,b)$ where $a$ is the number of cars and $b$ is the number of buses that maximizes the amount of money Mr. Squash makes. [i]Proposed by Nathan Cho[/i]

Let $ a_1,a_2,...,a_{2003}\geq 0$, such that $ a_1\plus{}a_2\plus{}...\plus{}a_{2003}\equal{}2$ and $ a_1a_2\plus{}a_2a_3\plus{}...\plus{}a_{2003}a_1\equal{}1$. Determine the minimum and maximum value of $ a_1^2\plus{}a_2^2\plus{}...\plus{}a_{2003}^2$.

In two weeks three cows eat all the grass on two hectares of land, together with all the grass that regrows there during the two weeks. In four weeks, two cows eat all the grass on two hectares of land, together with all the grass that regrows there during the four weeks. How many cows will eat all the grass on six hectares of land in six weeks, together with all the grass that regrows there over the six weeks? (Assume: $\bullet$ the quantity of grass on each hectare is the same when the cows begin to graze, $\bullet$ the rate of growth of the grass is uniform during the time of grazing, $\bullet$ the cows eat the same amount of grass each week.)

Let $N$ be the number of tuples $(a_1, a_2,..., a_{150})$ satisfying: $\bullet$ $a_i \in \{2, 3, 5, 7, 11\}$ for all $1 \le i \le 99$. $\bullet$ $a_i \in \{2, 4, 6, 8\}$ for all $100 \le i \le 150$. $\bullet$ $\sum^{150}_{i=1}a_i$ is divisible by $8$. Compute the last three digits of $N$.

Billiam is distributing his ample supply of balls among an ample supply of boxes. He distributes the balls as follows: he places a ball in the first empty box, and then for the greatest positive integer n such that all $n$ boxes from box $1$ to box $n$ have at least one ball, he takes all of the balls in those $n$ boxes and puts them into box $n +1$. He then repeats this process indefinitely. Find the number of repetitions of this process it takes for one box to have at least $2022$ balls.

For a rational point (x,y), if xy is an integer that divided by 2 but not 3, color (x,y) red, if xy is an integer that divided by 3 but not 2, color (x,y) blue. Determine whether there is a line segment in the plane such that it contains exactly 2017 blue points and 58 red points.

Determine all $k$ for which there exists a natural number n such that $1^n + 2^n + 3^n + 4^n$ with exactly $k$ zeros at the end.

Determine all pairs of integers $(m, n)$ such that $m^2 + n$ and $n^2 + m$ are both perfect squares.

There exist some number of ordered triples of real numbers $(x,y,z)$ that satisfy the following system of equations: \begin{align*} x+y+2z &= 6\\ x^2+y^2+2z^2 &= 18\\ x^3+y^3+2z^3&=54 \end{align*} Given that the sum of all possible positive values of $x$ can be expressed as $\frac{a+b\sqrt{c}}{d}$ where $a$,$b$,$c$, and $d$ are positive integers, $c$ is squarefree, and $\gcd(a,b,d)=1$, find the value of $a+b+c+d$.

Prove that there do not exist natural numbers $ n\ge 10$ having all digits different from zero, and such that all numbers which are obtained by permutations of its digits are perfect squares.

There are two piles with $72$ and $30$ candies. Two students alternate taking candies from one of the piles. Each time the number of candies taken from a pile must be a multiple of the number of candies in the other pile. Which student can always assure taking the last candy from one of the piles?

[asy] size(200); dotfactor=3; pair A=(0,0),B=(1,0),C=(2,0),D=(3,0),X=(1.2,0.7); draw(A--D); dot(A);dot(B);dot(C);dot(D); draw(arc((0.4,0.4),0.4,180,110),arrow = Arrow(TeXHead)); draw(arc((2.6,0.4),0.4,0,70),arrow = Arrow(TeXHead)); draw(B--X,dotted); draw(C--X,dotted); label("$A$",A,SW); label("$B$",B,S); label("$C$",C,S); label("$D$",D,S); label("x",X,fontsize(5pt)); //Credit to TheMaskedMagician for the diagram [/asy] Points $A , B, C$, and $D$ are distinct and lie, in the given order, on a straight line. Line segments $AB, AC$, and $AD$ have lengths $x, y$, and $z$ , respectively. If line segments $AB$ and $CD$ may be rotated about points $B$ and $C$, respectively, so that points $A$ and $D$ coincide, to form a triangle with positive area, then which of the following three inequalities must be satisfied? $\textbf{I. }x<\frac{z}{2}\qquad\textbf{II. }y<x+\frac{z}{2}\qquad\textbf{III. }y<\frac{z}{2}$ $\textbf{(A) }\textbf{I. }\text{only}\qquad\textbf{(B) }\textbf{II. }\text{only}\qquad$ $\textbf{(C) }\textbf{I. }\text{and }\textbf{II. }\text{only}\qquad\textbf{(D) }\textbf{II. }\text{and }\textbf{III. }\text{only}\qquad\textbf{(E) }\textbf{I. },\textbf{II. },\text{and }\textbf{III. }$

Let $ABC$ be an acute-angled triangle. Let $AD,BE,CF$ be internal bisectors with $D, E, F$ on $BC, CA, AB$ respectively. Prove that \[\frac{EF}{BC}+\frac{FD}{CA}+\frac{DE}{AB}\geq 1+\frac{r}{R}\]

Let $ABC$ be a triangle and $K$ be its circumcircle. Let $P$ be the point of intersection of $BC$ with tangent in $A$ to $K$. Let $D$ and $E$ be the symmetrical points of $B$ and $A$, respectively, from $P$. Let $K_1$ be the circumcircle of triangle $DAC$ and let $K_2$ the circumscribed circle of triangle $APB$. We denote with $F$ the second intersection point of the circles $K_1$ and $K_2$ Then denote with $G$ the second intersection point of the circle $K_1$ with $BF$. Show that the lines $BC$ and $EG$ are parallel.

A coin is flipped three times. What is the probability that there are no instances of two consecutive heads or two consecutive tails? $\textbf{(A) }\frac{1}{8}\qquad\textbf{(B) }\frac{1}{4}\qquad\textbf{(C) }\frac{3}{8}\qquad\textbf{(D) }\frac{5}{8}\qquad\textbf{(E) }\frac{3}{4}$

Prove that for all non-negative numbers $x,y,z$ satisfying $x+y+z=1$, one has \[1 \le \frac{x}{1-yz}+\frac{y}{1-zx}+\frac{z}{1-xy} \le \frac{9}{8}.\]