Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ such that $\boxed{1} \ f(1) = 1$ $\boxed{2} \ f(m+n)(f(m)-f(n)) = f(m-n)(f(m)+f(n)) \ \forall \ m,n \in \mathbb{Z}$

An Emperor invited $2015$ wizards to a festival. Each of the wizards knows who of them is good and who is evil, however the Emperor doesn’t know this. A good wizard always tells the truth, while an evil wizard can tell the truth or lie at any moment. The Emperor gives each wizard a card with a single question, maybe different for different wizards, and after that listens to the answers of all wizards which are either “yes” or “no”. Having listened to all the answers, the Emperor expels a single wizard through a magic door which shows if this wizard is good or evil. Then the Emperor makes new cards with questions and repeats the procedure with the remaining wizards, and so on. The Emperor may stop at any moment, and after this the Emperor may expel or not expel a wizard. Prove that the Emperor can expel all the evil wizards having expelled at most one good wizard. [i]($10$ points)[/i]

Let $p > 3$ be a prime. For each $k\in \{1,2, \ldots , p-1\}$, define $x_k$ to be the unique integer in $\{1, \ldots, p-1\}$ such that $kx_k\equiv 1 \pmod{p}$ and set $kx_k = 1+ pn_k$. Prove that : \[\sum_{k=1}^{p-1}kn_k \equiv \frac{p-1}{2} \pmod{p}\]

Dividing a three-digit number by the number obtained from it by swapping its first and last digit we get $3$ as the quotient and the sum of digits of the original number as the remainder. Find all three-digit numbers with this property.

How many ways are there to make change for $55$ cents using any number of pennies nickles, dimes, and quarters? $\text{(A) }42\qquad\text{(B) }49\qquad\text{(C) }55\qquad\text{(D) }60\qquad\text{(E) }78$

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 $x=-2016$. What is the value of $\left| \ \bigl \lvert { \ \lvert x\rvert -x }\bigr\rvert -|x|{\frac{}{}}^{}_{}\right|-x$? $\textbf{(A)}\ -2016\qquad\textbf{(B)}\ 0\qquad\textbf{(C)}\ 2016\qquad\textbf{(D)}\ 4032\qquad\textbf{(E)}\ 6048$

Consider a complete graph of $2020$ vertices. What is the least number of edges that need to be marked such that each triangle ($3$-vertex subgraph) has an odd number of marked edges?

Let $ABCD$ be a parallelogram and let $K$ be a point on line $AD$ such that $BK=AB$. Suppose that $P$ is an arbitrary point on $AB$, and the perpendicular bisector of $PC$ intersects the circumcircle of triangle $APD$ at points $X$, $Y$. Prove that the circumcircle of triangle $ABK$ passes through the orthocenter of triangle $AXY$. [i]Proposed by Iman Maghsoudi[/i]

The diagonals of trapezoid $ABCD$ ($BC\parallel AD$) meet at point $O$. Points $M$ and $N$ lie on the segments $BC$ and $AD$ respectively. The tangent to the circle $AMC$ at $C$ meets the ray $NB$ at point $P$; the tangent to the circle $BND$ at $D$ meets the ray $MA$ at point $R$. Prove that $\angle BOP =\angle AOR$.

Find the sum of the series $ x\plus{}\frac{x^3}{1\cdot 3}\plus{}\frac{x^5}{1\cdot 3\cdot 5}\plus{}\cdots\plus{}\frac{x^{2n\plus{}1}}{1\cdot 3\cdot 5\cdot \cdots \cdot (2n\plus{}1)}\plus{}\cdots$

A manufacturer built a machine which will address $500$ envelopes in $8$ minutes. He wishes to build another machine so that when both are operating together they will address $500$ envelopes in $2$ minutes. The equation used to find how many minutes $x$ it would require the second machine to address $500$ envelopes alone is: $\textbf{(A)}\ 8-x=2 \qquad \textbf{(B)}\ \dfrac{1}{8}+\dfrac{1}{x}=\dfrac{1}{2} \qquad \textbf{(C)}\ \dfrac{500}{8}+\dfrac{500}{x}=500 \qquad \textbf{(D)}\ \dfrac{x}{2}+\dfrac{x}{8}=1 \qquad\\ \textbf{(E)}\ \text{None of these answers}$

Let $P$ be a point chosen on the interior of side $\overline{BC}$ of triangle $\triangle ABC$ with side lengths $\overline{AB} = 10, \overline{BC} = 10, \overline{AC} = 12$. If $X$ and $Y$ are the feet of the perpendiculars from $P$ to the sides $AB$ and $AC$, then the minimum possible value of $PX^2 + PY^2$ can be expressed as $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by Andrew Wen[/i]

$\textbf{Juan's Old Stamping Grounds}$ Juan organizes the stamps in his collection by country and by the decade in which they were issued. The prices he paid for them at a stamp shop were: Brazil and France, 6 cents each, Peru 4 cents each, and Spain 5 cents each. (Brazil and Peru are South American countries and France and Spain are in Europe.) [asy] /* AMC8 2002 #8, 9, 10 Problem */ size(3inch, 1.5inch); for ( int y = 0; y <= 5; ++y ) { draw((0,y)--(18,y)); } draw((0,0)--(0,5)); draw((6,0)--(6,5)); draw((9,0)--(9,5)); draw((12,0)--(12,5)); draw((15,0)--(15,5)); draw((18,0)--(18,5)); draw(scale(0.8)*"50s", (7.5,4.5)); draw(scale(0.8)*"4", (7.5,3.5)); draw(scale(0.8)*"8", (7.5,2.5)); draw(scale(0.8)*"6", (7.5,1.5)); draw(scale(0.8)*"3", (7.5,0.5)); draw(scale(0.8)*"60s", (10.5,4.5)); draw(scale(0.8)*"7", (10.5,3.5)); draw(scale(0.8)*"4", (10.5,2.5)); draw(scale(0.8)*"4", (10.5,1.5)); draw(scale(0.8)*"9", (10.5,0.5)); draw(scale(0.8)*"70s", (13.5,4.5)); draw(scale(0.8)*"12", (13.5,3.5)); draw(scale(0.8)*"12", (13.5,2.5)); draw(scale(0.8)*"6", (13.5,1.5)); draw(scale(0.8)*"13", (13.5,0.5)); draw(scale(0.8)*"80s", (16.5,4.5)); draw(scale(0.8)*"8", (16.5,3.5)); draw(scale(0.8)*"15", (16.5,2.5)); draw(scale(0.8)*"10", (16.5,1.5)); draw(scale(0.8)*"9", (16.5,0.5)); label(scale(0.8)*"Country", (3,4.5)); label(scale(0.8)*"Brazil", (3,3.5)); label(scale(0.8)*"France", (3,2.5)); label(scale(0.8)*"Peru", (3,1.5)); label(scale(0.8)*"Spain", (3,0.5)); label(scale(0.9)*"Juan's Stamp Collection", (9,0), S); label(scale(0.9)*"Number of Stamps by Decade", (9,5), N); [/asy] The average price of his '70s stamps is closest to $\text{(A)}\ 3.5 \text{ cents} \qquad \text{(B)}\ 4 \text{ cents} \qquad \text{(C)}\ 4.5 \text{ cents} \qquad \text{(D)}\ 5 \text{ cents} \qquad \text{(E)}\ 5.5 \text{ cents}$

The village chatterboxes are exchanging their gossip by phone every day so that any two of them talk to each other exactly once. A certain day, every chatterbox called up at least one of the other chatterboxes. Show that there exist three chatterboxes such that the first called up the second, the second called up the third, and the third called up the first.

Let $ABCD$ be a regular tetrahedron and let $E$ be a point inside the face $ABC$. Denote by $s$ the sum of the distances from $E$ to the faces $DAB$, $DBC$, $DCA$, and by $S$ the sum of the distances from $E$ to the edges $AB$, $BC$, $CA$. Then $\dfrac sS$ equals $\textbf{(A) }\sqrt2\qquad\textbf{(B) }\dfrac{2\sqrt2}3\qquad\textbf{(C) }\dfrac{\sqrt6}2\qquad\textbf{(D) }2\qquad\textbf{(E) }3$

Let $O$ be the center of the circle circumscribed to $\vartriangle ABC$, and let $ P$ be any point on $BC$ ($P \ne B$ and $P \ne C$). Suppose that the circle circumscribed to $\vartriangle BPO$ intersects $AB$ at $R$ ($R \ne A$ and $R \ne B$) and that the circle circumscribed to $\vartriangle COP$ intersects $CA$ at point $Q$ ($Q \ne C$ and $Q \ne A$). 1) Show that $\vartriangle PQR \sim \vartriangle ABC$ and that$ O$ is orthocenter of $\vartriangle PQR$. 2) Show that the circles circumscribed to the triangles $\vartriangle BPO$, $\vartriangle COP$, and $\vartriangle PQR$ all have the same radius.