$ABC$ is an acute triangle. (angle $C$ is bigger than angle $B$) Let $O$ be a center of the circle which passes $B$ and tangents to $AC$ at $C$. $O$ meets the segment $AB$ at $D$. $CO$ meets the circle $(O)$ again at $P$, a line, which passes $P$ and parallel to $AO$, meets $AC$ at $E$, and $EB$ meets the circle $(O)$ again at $L$. A perpendicular bisector of $BD$ meets $AC$ at $F$ and $LF$ meets $CD$ at $K$. Prove that two lines $EK$ and $CL$ are parallel.

It is known that every student of the class for Sunday once visited the rink, and every boy met there with every girl. Prove that there was a point in time when all the boys, or all the girls of the class were simultaneously on the rink.

Let $n$, $i$, and $j$ be integers, for which $0<i<j<n$. Is it always true that the binomial coefficients $\binom{n}{i}$ and $\binom{n}{j}$ have a common divisor greater than 1?

A sequence $(x_n)_{n\ge 0}$ is defined as follows: $x_0=a,x_1=2$ and $x_n=2x_{n-1}x_{n-2}-x_{n-1}-x_{n-2}+1$ for all $n>1$. Find all integers $a$ such that $2x_{3n}-1$ is a perfect square for all $n\ge 1$.

For positive real numbers $a,b,c$, $\frac{1}{a}+\frac{1}{b} + \frac{1}{c} \ge \frac{3}{abc}$ is true. Prove that: $$ \frac{a^2+b^2}{a^2+b^2+1}+\frac{b^2+c^2}{b^2+c^2+1}+\frac{c^2+a^2}{c^2+a^2+1} \ge 2$$

Let $a_n$ be the number of unordered sets of three distinct bijections $f, g, h : \{1, 2, ..., n\} \to \{1, 2, ..., n\}$ such that the composition of any two of the bijections equals the third. What is the largest value in the sequence $a_1, a_2, ...$ which is less than $2021$?

Find the remainder after division of $10^{10} + 10^{10^2} + 10^{10^3} + ... + 10^{10^{10}}$ by $7$.

Let $a_1$, $a_2$, ..., $a_{2004}$ be non-negative real numbers such that $a_1+...+ a_{2004} \le 25$. Prove that among them there exist at least two numbers $a_i$ and $a_j$ ($i \neq j$) such that $|\sqrt{a_i}-\sqrt{a_j}| \le \frac{5}{2003}$.

Bianca has a rectangle whose length and width are distinct primes less than 100. Let $P$ be the perimeter of her rectangle, and let $A$ be the area of her rectangle. What is the least possible value of $\frac{P^2}{A}$?

A triangle has sides of length $48$, $55$, and $73$. Let $a$ and $b$ be relatively prime positive integers such that $a/b$ is the length of the shortest altitude of the triangle. Find the value of $a+b$.

You are racing an Artificially Intelligent Robot, called Al, that you built. You can run at a constant speed of $10$ m/s throughout the race. Meanwhile, Al starts running at a constant speed of $ 1$ m/s. Thereafter, when exactly $ 1$ second has passed from when Al last changed its speed, Al’s speed instantaneously becomes $1$ m/s faster, so that Al runs at a constant speed of $k$ m/s in the kth second of the race. (Start counting seconds at $ 1$). Suppose Al beats you by exactly $1$ second. How many meters was the race?

There is a ruble coin in each cell of the board with $2\times 200$. Dasha and Sonya play, taking turns making moves, Dasha starts. In one move, it is allowed to select any coin and move it: Dasha moves the coin to a diagonally adjacent cell, Sonya is to the side adjacent. If two coins end up in the same cell, one of them is immediately removed from the board and goes to Sonya. Sonya can stop the game at any time and take all the coins she has received. What is the biggest win she can get, no matter how she plays Dasha? [i]A. Kuznetsov[/i]

There exists a function $G(x)$ such that $G(x)+G\left(\frac{x-\sqrt{3}}{x\sqrt{3}+1}\right)=\sqrt{2}+x$. Find $G(x)$. [i]Proposed by beanielove2.[/i]

It is said that a set of three different numbers is an [i]arithmetical set[/i] if one of the three numbers is the average of the other two. Consider the set $A_n = \{1, 2,..., n\}$, where $n $ is a positive integer, $n\ge 3$. a) How many [i]arithmetical sets[/i] are in $A_{10}$? b) Find the smallest $n$, such that the number of [i]arithmetical sets[/i] in $A_n$ is greater than $2004$.

We have $2^m$ sheets of paper, with the number $1$ written on each of them. We perform the following operation. In every step we choose two distinct sheets; if the numbers on the two sheets are $a$ and $b$, then we erase these numbers and write the number $a + b$ on both sheets. Prove that after $m2^{m -1}$ steps, the sum of the numbers on all the sheets is at least $4^m$ . [i]Proposed by Abbas Mehrabian, Iran[/i]

Let $E$ be a point on the median $CD$ of a triangle $ABC$. The circle $\mathcal S_1$ passing through $E$ and touching $AB$ at $A$ meets the side $AC$ again at $M$. The circle $S_2$ passing through $E$ and touching $AB$ at $B$ meets the side $BC$ at $N$. Prove that the circumcircle of $\triangle CMN$ is tangent to both $\mathcal S_1$ and $\mathcal S_2$.

Determine, with proof, if there exists an odd prime $p$ such that the following equation holds: $$\sum_{n = 1}^{\frac{p-1}{2}} \cot\left(\frac{\pi n^2}{p}\right) = 69\sqrt{p}$$ [i]Proposed by Chris Bao[/i]

Let $(x_n)$, $n=1,2, \ldots $ be a sequence defined by $x_1=2008$ and \begin{align*} x_1 +x_2 + \ldots + x_{n-1} = \left( n^2-1 \right) x_n \qquad ~ ~ ~ \forall n \geq 2 \end{align*} Let the sequence $a_n=x_n + \frac{1}{n} S_n$, $n=1,2,3, \ldots $ where $S_n$ $=$ $x_1+x_2 +\ldots +x_n$. Determine the values of $n$ for which the terms of the sequence $a_n$ are perfect squares of an integer.

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}$.