Compute the remainder when $222!^{111} + 111^{222!} + 111!^{222} + 222^{111!}$ is divided by $2007$.

How many multiples of $11$ of four digits, of the form $\overline{abcd}$, satisfy that $a\neq b, b\neq c$ and $c\neq a$?

Determine all real functions $f(x)$ that are defined and continuous on the interval $(-1, 1)$ and that satisfy the functional equation \[f(x+y)=\frac{f(x)+f(y)}{1-f(x) f(y)} \qquad (x, y, x + y \in (-1, 1)).\]

Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f^{(19)}(n)+97f(n)=98n+232.\]

If $a_1,a_2,a_3\ldots a_n$ are positive numbers, find the maximum value of \[\frac{a_1a_2\ldots a_{n-1}a_n}{(1+a_1)(a_1+a_2)\ldots (a_{n-1}+a_n)(a_n+2^{n+1})} \]

[u]Round 1[/u] [b]p1.[/b] Alice and Bob compiled a list of movies that exactly one of them saw, then Cindy and Dale did the same. To their surprise, these two lists were identical. Prove that if Alice and Cindy list all movies that exactly one of them saw, this list will be identical to the one for Bob and Dale. [b]p2.[/b] Several whole rounds of cheese were stored in a pantry. One night some rats sneaked in and consumed $10$ of the rounds, each rat eating an equal portion. Some were satisfied, but $7$ greedy rats returned the next night to finish the remaining rounds. Their portions on the second night happened to be half as large as on the first night. How many rounds of cheese were initially in the pantry? [b]p3.[/b] You have $100$ pancakes, one with a single blueberry, one with two blueberries, one with three blueberries, and so on. The pancakes are stacked in a random order. Count the number of blueberries in the top pancake, and call that number N. Pick up the stack of the top N pancakes, and flip it upside down. Prove that if you repeat this counting-and-flipping process, the pancake with one blueberry will eventually end up at the top of the stack. [b]p4.[/b] There are two lemonade stands along the $4$-mile-long circular road that surrounds Sour Lake. $100$ children live in houses along the road. Every day, each child buys a glass of lemonade from the stand that is closest to her house, as long as she does not have to walk more than one mile along the road to get there. A stand's [u]advantage [/u] is the difference between the number of glasses it sells and the number of glasses its competitor sells. The stands are positioned such that neither stand can increase its advantage by moving to a new location, if the other stand stays still. What is the maximum number of kids who can't buy lemonade (because both stands are too far away)? [b]p5.[/b] Merlin uses several spells to move around his $64$-room castle. When Merlin casts a spell in a room, he ends up in a different room of the castle. Where he ends up only depends on the room where he cast the spell and which spell he cast. The castle has the following magic property: if a sequence of spells brings Merlin from some room $A$ back to room $A$, then from any other room $B$ in the castle, that same sequence brings Merlin back to room $B$. Prove that there are two different rooms $X$ and $Y$ and a sequence of spells that both takes Merlin from $X$ to $Y$ and from $Y$ to $X$. [u]Round 2[/u] [b]p6.[/b] Captains Hook, Line, and Sinker are deciding where to hide their treasure. It is currently buried at the $X$ in the map below, near the lairs of the three pirates. Each pirate would prefer that the treasure be located as close to his own lair as possible. You are allowed to propose a new location for the treasure to the pirates. If at least two out of the three pirates prefer the new location (because it moves closer to their own lairs), then the treasure will be moved there. Assuming the pirates’ lairs form an acute triangle, is it always possible to propose a sequence of new locations so that the treasure eventually ends up in your backyard (wherever that is)? [img]https://cdn.artofproblemsolving.com/attachments/c/c/a9e65624d97dec612ef06f8b30be5540cfc362.png[/img] [b]p7.[/b] Homer went on a Donut Diet for the month of May ($31$ days). He ate at least one donut every day of the month. However, over any stretch of $7$ consecutive days, he did not eat more than $13$ donuts. Prove that there was some stretch of consecutive days over which Homer ate exactly $30$ donuts. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Equilateral triangle $ T$ is inscribed in circle $ A$, which has radius $ 10$. Circle $ B$ with radius $ 3$ is internally tangent to circle $ A$ at one vertex of $ T$. Circles $ C$ and $ D$, both with radius $ 2$, are internally tangent to circle $ A$ at the other two vertices of $ T$. Circles $ B$, $ C$, and $ D$ are all externally tangent to circle $ E$, which has radius $ \frac {m}{n}$, where $ m$ and $ n$ are relatively prime positive integers. Find $ m \plus{} n$. [asy]unitsize(2.2mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); dotfactor=4; pair A=(0,0), D=8*dir(330), C=8*dir(210), B=7*dir(90); pair Ep=(0,4-27/5); pair[] dotted={A,B,C,D,Ep}; draw(Circle(A,10)); draw(Circle(B,3)); draw(Circle(C,2)); draw(Circle(D,2)); draw(Circle(Ep,27/5)); dot(dotted); label("$E$",Ep,E); label("$A$",A,W); label("$B$",B,W); label("$C$",C,W); label("$D$",D,E);[/asy]

Prove that the number $ (\underbrace{9999 \dots 99}_{2005}) ^{2009}$ can be obtained by erasing some digits of $ (\underbrace{9999 \dots 99}_{2008}) ^{2009}$ (both in decimal representation). [i]Yudi Satria, Jakarta[/i]

Suppose the real number $\lambda \in \left( 0,1\right),$ and let $n$ be a positive integer. Prove that the modulus of all the roots of the polynomial $$f\left ( x \right )=\sum_{k=0}^{n}\binom{n}{k}\lambda^{k\left ( n-k \right )}x^{k}$$ are $1.$

Let $\triangle ABC$ be a triangle with $AB = 7$, $BC = 8$, and $AC = 9$. Point $D$ is on side $\overline{AC}$ such that $\angle CBD$ has measure $45^\circ$. What is the length of $\overline{BD}$?

Solve the equations : $$\begin{cases} a + b + c = 0 \\ a^2 + b^2 + c^2 = 1\\a^3 + b^3 +c^3 = 4abc \end{cases}$$ for $ a,b,$ and $c. $

Altitude $AH$ and median $AM$ of the triangle $ABC$ satisfy the relation: $\angle ABM = \angle CBH$. Prove that triangle $ABC$ is isosceles or right-angled.

For a positive integer $n$, define the set $S_n$ as $S_n =\{(a, b)|a, b \in N, lcm[a, b] = n\}$ . Let $f(n)$ be the sum of $\phi (a)\phi (b)$ for all $(a, b) \in S_n$. If a prime $p$ relatively prime to $n$ is a divisor of $f(n)$, prove that there exists a prime $q|n$ such that $p|q^2 - 1$.

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

The owner of a hardware store bought a quantity of screws in closed boxes and sells the screws separately. He never has more than one open box. At the end of the day Monday there are $2208$ screws left, at the end of the day Tuesday there are still $1616$ screws and at the end of Wednesday there are still $973$ screws. To control the employees, every night he writes down the number of screws that are in the only open box. The amount entered on Tuesday is double that of Monday. How many screws are there in each closed box if it is known that they are less than $500$?

Find all quadruples of positive integers $(p, q, a, b)$, where $p$ and $q$ are prime numbers and $a > 1$, such that $$p^a = 1 + 5q^b.$$

Let $n \geq 2$ be a positive integer. Show that there are exactly $2^{n-3}n(n-1)$ $n$-tuples of integers $(a_1,a_2,\dots,a_n)$, which satisfy the conditions: (i) $a_1=0$; (ii) for each $m$, $2 \leq m \leq n$, there is an index in $m$, $1 \leq i_m <m$, such that $\left|a_{i_m}-a_m\right|\leq 1$; (iii) the $n$-tuple $(a_1,a_2,\dots,a_n)$ contains exactly $n-1$ different numbers.

We are having  99 equal circles in a row and in the interior, we write inside them all the numbers from 1 up to 99 (one number in each circle).We color each of the circles with one of the two colors available: red and green. A coloring is good if it has the ability: Red circles lying in the interval of the numbers from 1 up to 50  are more than the red circles lying in the interval of the numbers from 51  up to 99 . a) Find how many different colorings can be constructed. b) Find how many different good colorings can be constructed. (Note: Two colorings are different, if they have different color in at least one of their circles.)

Mark has six boxes lined up in a straight line. Inside each of the first three boxes are a red ball, a blue ball, and a green ball. He randomly selects a ball from each of the three boxes and puts them into a fourth box. Then, he randomly selects a ball from each of the four boxes and puts them into a fifth box. Next, he randomly selects a ball from each of the five boxes and puts them into a sixth box, arriving at three boxes with $1, 3,$ and $5$ balls, respectively. The probability that the box with $3$ balls has each type of color is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [i]Proposed by [b]AOPS12142015[/b][/i]

How many integers can be expressed in the form: $\pm 1 \pm 2 \pm 3 \pm 4 \pm \cdots \pm 2018$?

$25$ students are on exams. Exam consists of some questions with $5$ variants of answer. Every two students gave same answer for not more than $1$ question. Prove, that there are not more than $6$ questions in exam.

If integers $a$, $b$, $c$, and $d$ satisfy $ bc + ad = ac + 2bd = 1 $, find all possible values of $ \frac {a^2 + c^2}{b^2 + d^2} $.

Let the four real solutions to the equation $x^2 + \frac{144}{x^2} = 25$ be $r_1, r_2, r_3$, and $r_4$. Find $|r_1| +|r_2| +|r_3| +|r_4|$.

A circle cuts off four right-angled triangles from rectangle $ABCD$.Let $A_0, B_0, C_0$ and $D_0$ be the midpoints of the correspondent hypotenuses. Prove that $A_0C_0 = B_0D_0$ [i]Proosed by L.Shteingarts[/i]

For how many ordered pairs $(x,y)$ of integers is it true that $0<x<y<10^{6}$ and that the arithmetic mean of $x$ and $y$ is exactly $2$ more than the geometric mean of $x$ and $y?$