Prove that the sum of the $ \text{2005-th} $ powers of three pairwise distinct complex numbers is the imaginary unit if their modulus are equal and the sum of these numbers is the imaginary unit.

Harry Potter can do any of the three tricks arbitrary number of times: $i)$ switch $1$ plum and $1$ pear with $2$ apples $ii)$ switch $1$ pear and $1$ apple with $3$ plums $iii)$ switch $1$ apple and $1$ plum with $4$ pears In the beginning, Harry had $2012$ of plums, apples and pears, each. Harry did some tricks and now he has $2012$ apples, $2012$ pears and more than $2012$ plums. What is the minimal number of plums he can have?

[b]p1.[/b] Ten math students take a test, and the average score on the test is $28$. If five students had an average of $15$, what was the average of the other five students' scores? [b]p2.[/b] If $a\otimes b = a^2 + b^2 + 2ab$, find $(-5\otimes 7) \otimes 4$. [b]p3.[/b] Below is a $3 \times 4$ grid. Fill each square with either $1$, $2$ or $3$. No two squares that share an edge can have the same number. After filling the grid, what is the $4$-digit number formed by the bottom row? [img]https://cdn.artofproblemsolving.com/attachments/9/6/7ef25fc1220d1342be66abc9485c4667db11c3.png[/img] [b]p4.[/b] What is the angle in degrees between the hour hand and the minute hand when the time is $6:30$? [b]p5.[/b] In a small town, there are some cars, tricycles, and spaceships. (Cars have $4$ wheels, tricycles have $3$ wheels, and spaceships have $6$ wheels.) Among the vehicles, there are $24$ total wheels. There are more cars than tricycles and more tricycles than spaceships. How many cars are there in the town? [b]p6.[/b] You toss five coins one after another. What is the probability that you never get two consecutive heads or two consecutive tails? [b]p7.[/b] In the below diagram, $\angle ABC$ and $\angle BCD$ are right angles. If $\overline{AB} = 9$, $\overline{BD} = 13$, and $\overline{CD} = 5$, calculate $\overline{AC}$. [img]https://cdn.artofproblemsolving.com/attachments/7/c/8869144e3ea528116e2d93e14a7896e5c62229.png[/img] [b]p8.[/b] Out of $100$ customers at a market, $80$ purchased oranges, $60$ purchased apples, and $70$ purchased bananas. What is the least possible number of customers who bought all three items? [b]p9.[/b] Francis, Ted and Fred planned to eat cookies after dinner. But one of them sneaked o earlier and ate the cookies all by himself. The three say the following: Francis: Fred ate the cookies. Fred: Ted did not eat the cookies. Ted: Francis is lying. If exactly one of them is telling the truth, who ate all the cookies? [b]p11.[/b] Let $ABC$ be a triangle with a right angle at $A$. Suppose $\overline{AB} = 6$ and $\overline{AC} = 8$. If $AD$ is the perpendicular from $A$ to $BC$, what is the length of $AD$? [b]p12.[/b] How many three digit even numbers are there with an even number of even digits? [b]p13.[/b] Three boys, Bob, Charles and Derek, and three girls, Alice, Elizabeth and Felicia are all standing in one line. Bob and Derek are each adjacent to precisely one girl, while Felicia is next to two boys. If Alice stands before Charles, who stands before Elizabeth, determine the number of possible ways they can stand in a line. [b]p14.[/b] A man $5$ foot, $10$ inches tall casts a $14$ foot shadow. $20$ feet behind the man, a flagpole casts ashadow that has a $9$ foot overlap with the man's shadow. How tall (in inches) is the flagpole? [b]p15.[/b] Alvin has a large bag of balls. He starts throwing away balls as follows: At each step, if he has $n$ balls and 3 divides $n$, then he throws away a third of the balls. If $3$ does not divide $n$ but $2$ divides $n$, then he throws away half of them. If neither $3$ nor $2$ divides $n$, he stops throwing away the balls. If he began with $1458$ balls, after how many steps does he stop throwing away balls? [b]p16.[/b] Oski has $50$ coins that total to a value of $82$ cents. You randomly steal one coin and find out that you took a quarter. As to not enrage Oski, you quickly put the coin back into the collection. However, you are both bored and curious and decide to randomly take another coin. What is the probability that this next coin is a penny? (Every coin is either a penny, nickel, dime or quarter). [b]p17.[/b] Let $ABC$ be a triangle. Let $M$ be the midpoint of $BC$. Suppose $\overline{MA} = \overline{MB} = \overline{MC} = 2$ and $\angle ACB = 30^o$. Find the area of the triangle. [b]p18.[/b] A spirited integer is a positive number representable in the form $20^n + 13k$ for some positive integer $n$ and any integer $k$. Determine how many spirited integers are less than $2013$. [b]p19. [/b]Circles of radii $20$ and $13$ are externally tangent at $T$. The common external tangent touches the circles at $A$, and $B$, respectively where $A \ne B$. The common internal tangent of the circles at $T$ intersects segment $AB$ at $X$. Find the length of $AX$. [b]p20.[/b] A finite set of distinct, nonnegative integers $\{a_1, ... , a_k\}$ is called admissible if the integer function $f(n) = (n + a_1) ... (n + a_k)$ has no common divisor over all terms; that is, $gcd \left(f(1), f(2),... f(n)\right) = 1$ for any integer$ n$. How many admissible sets only have members of value less than $10$? $\{4\}$ and $\{0, 2, 6\}$ are such sets, but $\{4, 9\}$ and $\{1, 3, 5\}$ are not. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Consider a set $S$ of $16$ lattice points. The $16$ points of $S$ are divided into $8$ pairs in such a way that [i]for every point $A$ and any of the $7$ pairs of points $(B,C)$ where $A$ is not included, $A$ is at a distance of at most $\sqrt{5}$ from either $B$ or $C$[/i] Prove that any two points in the set $S$ are at a distance of at most $3\sqrt5$.

A [i]windmill[/i] is a closed line segment of unit length with a distinguished endpoint, the [i]pivot[/i]. Let $S$ be a finite set of $n$ points such that the distance between any two points of $S$ is greater than $c$. A configuration of $n$ windmills is [i]admissible[/i] if no two windmills intersect and each point of $S$ is used exactly once as a pivot. An admissible configuration of windmills is initially given to Geoff in the plane. In one operation Geoff can rotate any windmill around its pivot, either clockwise or counterclockwise and by any amount, as long as no two windmills intersect during the process. Show that Geoff can reach any other admissible configuration in finitely many operations, where (i) $c = \sqrt 3$, (ii) $c = \sqrt 2$. [i]Proposed by Michael Ren[/i]

Given a positive integer $n$, show that the set $\{1,2,...,n\}$ can be partitioned into $m$ sets, each with the same sum, if and only if m is a divisor of $\frac{n(n + 1)}{2}$ which does not exceed $\frac{n + 1}{2}$.

What is the ratio of the area of the shaded square to the area of the large square? (The figure is drawn to scale) [asy] draw((0,0)--(0,4)--(4,4)--(4,0)--cycle); draw((0,0)--(4,4)); draw((0,4)--(3,1)--(3,3)); draw((1,1)--(2,0)--(4,2)); fill((1,1)--(2,0)--(3,1)--(2,2)--cycle,black);[/asy] $ \text{(A)}\ \frac{1}{6}\qquad\text{(B)}\ \frac{1}{7}\qquad\text{(C)}\ \frac{1}{8}\qquad\text{(D)}\ \frac{1}{12}\qquad\text{(E)}\ \frac{1}{16} $

In $\triangle ABC$, $\angle C = 90^\circ, AC = 6$ and $BC = 8$. Points $D$ and $E$ are on $\overline{AB}$ and $\overline{BC}$, respectively, and $\angle BED = 90^\circ$. If $DE = 4$, then $BD =$ [asy] size(100); pathpen = linewidth(0.7); pointpen = black+linewidth(3); pair A = (0,0), C = (6,0), B = (6,8), D = (2*A+B)/3, E = (2*C+B)/3; D(D("A",A,SW)--D("B",B,NW)--D("C",C,SE)--cycle); D(D("D",D,NW)--D("E",E,plain.E)); D(rightanglemark(D,E,B,16)); D(rightanglemark(A,C,B,16));[/asy] $\mathbf{(A)}\;5\qquad \mathbf{(B)}\;\frac{16}{3}\qquad \mathbf{(C)}\; \frac{20}{3}\qquad \mathbf{(D)}\; \frac{15}{2}\qquad \mathbf{(E)}\; 8$

Given an expression $x^2 + ax + b$ where $a,b$ are integer coefficients. At any step, one can change the expression by adding either $1$ or $-1$ to only one of the two coefficients $a, b$. a) Suppose that the initial expression has $a =-7$ and $b = 19$. Show your modification steps to obtain a new expression that has zero value at some integer value of $x$. b) Starting from the initial expression as above, one gets the expression $x^2 - 17x + 9$ after $m$ modification steps. Prove that at a certain step $k$ with $k < m$, the obtained expression has zero value at some integer value of $x$.

Let $p(x)$ be a polynomial with integer coefficients such that both equations $p(x)=1$ and $p(x)=3$ have integer solutions. Can the equation $p(x)=2$ have two different integer solutions?

On a blackboard there are written the numbers $ 11 $ and $ 13. $ One [i]step[/i] means to sum two written numbers and write it. Show that: [b]a)[/b] after any number of steps, the number $ 86 $ will not be written. [b]b)[/b] after some number of steps, the number $ 2015 $ may be written.

Let $k$ be a positive integer and $a_1, a_2,... , a_k$ be nonnegative real numbers. Initially, there is a sequence of $n \geq k$ zeros written on a blackboard. At each step, Nicole chooses $k$ consecutive numbers written on the blackboard and increases the first number by $a_1$, the second one by $a_2$, and so on, until she increases the $k$-th one by $a_k$. After a positive number of steps, Nicole managed to make all the numbers on the blackboard equal. Prove that all the nonzero numbers among $a_1, a_2, . . . , a_k$ are equal.

A "[i]2-line[/i]" is the area between two parallel lines. Length of "2-line" is distance of two parallel lines. We have covered unit circle with some "2-lines". Prove sum of lengths of "2-lines" is at least 2.

Let $S_n=1-2+3-4+\cdots +(-1)^{n-1}n,\ n=1, 2, \cdots$. Then $S_{17}+S_{33}+S_{50}$ equals: $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ -1 \qquad\textbf{(E)}\ -2$

Let $ABC$ be an acute angled triangle with $AB<AC$. Let $M$ be the midpoint of side $BC$. On side $AB$, consider a point $D$ such that, if segment $CD$ intersects median $AM$ at point $E$, then $AD=DE$. Prove that $AB=CE$.

Do there exist 2018 positive irreducible fractions, each with a different denominator, so that the denominator of the difference of any two (after reducing the fraction) is less than the denominator of any of the initial 2018 fractions? (6 points) Maxim Didin

Prove that the polynomial $x^n+4$ can be expressed as a product of two polynomials (each with degree less than $n$) with integer coefficients, if and only if $n$ is divisible by $4$.

Nick is a runner, and his goal is to complete four laps around a circuit at an average speed of 10 mph. If he completes the first three laps at a constant speed of only 9 mph, what speed does he need to maintain in miles per hour on the fourth lap to achieve his goal?

Let $ABCD$ be a convex quadrilateral satisfying $\angle ADB + \angle ACB = \angle CAB + \angle DBA = 30^o$, $AD = BC$. Prove that there exists a right-angled triangle with side lengths $AC$, $BD$, $CD$.

Let $ABCD$ be a rectangle with sides $AB,BC,CD$ and $DA$. Let $K,L$ be the midpoints of the sides $BC,DA$ respectivily. The perpendicular from $B$ to $AK$ hits $CL$ at $M$. Find $$\frac{[ABKM]}{[ABCL]}$$

Solve in $ M_2(\mathbb{C})$ the equation $ X^2\equal{}\left( \begin{array}{cc} 1 & 2 \\ 3 & 6 \end{array} \right)$

If $a,b,c,d$ are positive reals such that $a^2+b^2=c^2+d^2$ and $a^2+d^2-ad=b^2+c^2+bc$, find the value of $\frac{ab+cd}{ad+bc}$

The value of $$\left(1-\frac{1}{2^2-1}\right)\left(1-\frac{1}{2^3-1}\right)\left(1-\frac{1}{2^4-1}\right)\dots\left(1-\frac{1}{2^{29}-1}\right)$$ can be written as $\tfrac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $2m - n.$

7. There are 100 chess bishops on white squares of a $100 \times 100$ chess board. Some of them are white and some of them are black. They can move in any order and capture the bishops of opposing color. What number of moves is sufficient for sure to retain only one bishop on the chess board?