[b]p1.[/b] Find the smallest positive integer $N$ such that $N!$ is a multiple of $10^{2010}$. [b]p2.[/b] An equilateral triangle $T$ is externally tangent to three mutually tangent unit circles, as shown in the diagram. Find the area of $T$. [b]p3. [/b]The polynomial $p(x) = x^3 + ax^2 + bx + c$ has the property that the average of its roots, the product of its roots, and the sum of its coefficients are all equal. If $p(0) = 2$, find $b$. [b]p4.[/b] A regular pentagon $P = A_1A_2A_3A_4A_5$ and a square $S = B_1B_2B_3B_4$ are both inscribed in the unit circle. For a given pentagon $P$ and square $S$, let $f(P, S)$ be the minimum length of the minor arcs AiBj , for $1 \le i \le 5$ and $1 \le j \le 4$. Find the maximum of $f(P, S)$ over all pairs of shapes. [b]p5.[/b] Let $ a, b, c$ be three three-digit perfect squares that together contain each nonzero digit exactly once. Find the value of $a + b + c$. [b]p6. [/b]There is a big circle $P$ of radius $2$. Two smaller circles $Q$ and $R$ are drawn tangent to the big circle $P$ and tangent to each other at the center of the big circle $P$. A fourth circle $S$ is drawn externally tangent to the smaller circles $Q$ and $R$ and internally tangent to the big circle $P$. Finally, a tiny fifth circle $T$ is drawn externally tangent to the $3$ smaller circles $Q, R, S$. What is the radius of the tiny circle $T$? [b]p7.[/b] Let $P(x) = (1 +x)(1 +x^2)(1 +x^4)(1 +x^8)(...)$. This infinite product converges when $|x| < 1$. Find $P\left( \frac{1}{2010}\right)$. [b]p8.[/b] $P(x)$ is a polynomial of degree four with integer coefficients that satisfies $P(0) = 1$ and $P(\sqrt2 + \sqrt3) = 0$. Find $P(5)$. [b]p9.[/b] Find all positive integers $n \ge 3$ such that both roots of the equation $$(n - 2)x^2 + (2n^2 - 13n + 38)x + 12n - 12 = 0$$ are integers. [b]p10.[/b] Let $a, b, c, d, e, f$ be positive integers (not necessarily distinct) such that $$a^4 + b^4 + c^4 + d^4 + e^4 = f^4.$$ Find the largest positive integer $n$ such that $n$ is guaranteed to divide at least one of $a, b, c, d, e, f$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Mary writes $5$ numbers on the blackboard. On each step John replaces one of the numbers on the blackboard by the number $x + y - z$, where $x, y$ and $z$ are three of the four other numbers on the blackboard. Can John make all five numbers on the blackboard equal, regardless of the numbers initially written by Mary?

There are $n\leq 99$ people around a circular table. At every moment everyone can either be truthful (always says the truth) or a liar (always lies). Initially some of people (possibly none) are truthful and the rest are liars. At every minute everyone answers at the same time the question "Is your left neighbour truthful or a liar?" and then becomes the same type of person as his answer. Determine the largest $n$ for which, no matter who are the truthful people in the beginning, at some point everyone will become truthful forever.

Each cell of the 4x4 board has a grasshopper. When a grasshopper jumps, it moves to one of the adjacent cells (down, up, right, or left). The grasshopper cannot move diagonally or go off the board. At most how many cells can remain empty after each grasshopper jumps once?

You want to color a flag like the one shown in the following image, for which four different colors are available. Two regions of the flag that share a side (or a segment of a side) must have different colors. The flag cannot be flipped, rotated, or reflected. How many different flags can be colored with these conditions? [img]https://cdn.artofproblemsolving.com/attachments/4/9/879d1e144acdbc63ee2ffe34cf13a920d5d836.png[/img]

A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time: [list] [*] Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged. [/list] Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user. [i]Proposed by Adrian Beker, Croatia[/i]

Determine the smallest positive integer n for that there are positive integers $x_1, x_2,. . . , x_n$ so that each natural number from 1001 to 2021 inclusive can be written as sum of one or more different terms $x_i$ (i = 1, 2,..., n).

Consider a $8\times 8$ chessboard where all $64$ unit squares are at the start white. Prove that, if any $12$ of the $64$ unit square get painted black, then we can find $4$ lines and $4$ rows that have all these $12$ unit squares.

The board used for playing a game consists of the left and right parts. In each part there are several fields and there’re several segments connecting two fields from different parts (all the fields are connected.) Initially, there is a violet counter on a field in the left part, and a purple counter on a field in the right part. Lyosha and Pasha alternatively play their turn, starting from Pasha, by moving their chip (Lyosha-violet, and Pasha-purple) over a segment to other field that has no chip. It’s prohibited to repeat a position twice, i.e. can’t move to position that already been occupied by some earlier turns in the game. A player losses if he can’t make a move. Is there a board and an initial positions of counters that Pasha has a winning strategy?

On a blackboard there are three positive integers. In each step the three numbers on the board are denoted as $a, b, c$ such that $a >gcd(b, c)$, then $a$ gets replaced by $ a-gcd(b, c)$. The game ends if there is no way to denote the numbers such that $a >gcd(b, c)$. Prove that the game always ends and that the last three numbers on the blackboard only depend on the starting numbers. (Theresia Eisenkölbl)

Given $5$ points in a plane, no three of them being collinear. Each two of these $5$ points are joined with a segment, and every of these segments is painted either red or blue; assume that there is no triangle whose sides are segments of equal color. [b]a.)[/b] Show that: [i](1)[/i] Among the four segments originating at any of the $5$ points, two are red and two are blue. [i](2)[/i] The red segments form a closed way passing through all $5$ given points. (Similarly for the blue segments.) [b]b.)[/b] Give a plan how to paint the segments either red or blue in order to have the condition (no triangle with equally colored sides) satisfied.

We are given $1998$ normal coins, $1$ heavy coin and $1$ light coin, which all look the same. We wish to determine whether the average weight of the two abnormal coins is less than, equal to, or greater than the weight of a normal coin. Show how to do this using a balance $4$ times or less.

MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations. (1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.) (2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?

A polygon with $1997$ vertices is given. Write a positive real number each vertex such that, each number equal to its right and left numbers' arithmetic or geometric mean. Prove that all numbers are equal.

Let $n>1$ be a given integer. Let $G$ be a finite simple graph with the property that each of its edges is contained in at most $n$ cycles. Prove that the chromatic number of the graph is at most $n+1$.

There are $ n$ points on the plane, no three of which are collinear. Each pair of points is joined by a red, yellow or green line. For any three points, the sides of the triangle they form consist of exactly two colours. Show that $ n<13$.

A cube of side length $n$ is divided into unit cubes by [i]partitions[/i] (each [i]partition[/i] separates a pair of adjacent unit cubes). What is the smallest number of [i]partitions[/i] that can be removed so that from each cube, one can reach the surface of the cube without passing through a partition ?

In a tournament with $55$ participants, one match is played at a time, with the loser dropping out. In each match, the numbers of wins so far of the two participants differ by not more than $1$. What is the maximal number of matches for the winner of the tournament?

The numbers $1, 2, 3$, $\ldots$, $n^2$ are arranged in an $n\times n$ array, so that the numbers in each row increase from left to right, and the numbers in each column increase from top to bottom. Let $a_{ij}$ be the number in position $i, j$. Let $b_j$ be the number of possible values for $a_{jj}$. Show that \[ b_1 + b_2 + \cdots + b_n = \frac{ n(n^2-3n+5) }{3} . \]

In a closed rectangular neighborhood there are: $S$ streets (these are straight roads of maximum length), $V$ four-arm intersections ( [img]https://cdn.artofproblemsolving.com/attachments/e/4/6a5974a30dc182b59a519a8ef4eb4f1412e05e.png[/img]), $H$ city blocks (these are rectangular areas bounded by four streets, which are no be intersected by another street) and $T$ represents the number of $T$-intersections ([img]https://cdn.artofproblemsolving.com/attachments/0/a/b390a30a0b27d83db681f70f633bdeed697163.png[/img] ). For example, in the neighborhood below, there are $15$ streets, $8$ four-arm intersections, $20$ city blocks and $22$ $T$-intersections. [img]https://cdn.artofproblemsolving.com/attachments/a/2/c1a5e463d0fb5671ac0702c91cfc2272d4e2c3.png[/img] Prove that in each district $S + V = H + 3$.

In the Martian language every finite sequence of letters of the Latin alphabet letters is a word. The publisher “Martian Words” makes a collection of all words in many volumes. In the first volume there are only one-letter words, in the second, two-letter words, etc., and the numeration of the words in each of the volumes continues the numeration of the previous volume. Find the word whose numeration is equal to the sum of numerations of the words Prague, Olympiad, Mathematics.

[b]p1.[/b] $2011$ distinct points are arranged along the perimeter of a circle. We choose without replacement four points $P$, $Q$, $R$, $S$. What is the probability that no two of the segments $P Q$, $QR$, $RS$, $SP$ intersect (disregarding the endpoints)? [b]p2.[/b] In Soviet Russia, all phone numbers are between three and six digits and contain only the digits $1$, $2$, and $3$. No phone number may be the prefix of another phone number, so, for example, we cannot have the phone numbers $123$ and $12332$. If the Soviet bureaucracy has preassigned $10$ phone numbers of length $3$, $20$ numbers of length $4$, and $77$ phone numbers of length $6$, what is the maximum number of phone numbers of length $5$ that the authorities can allocate? [b]p3.[/b] The sequence $\{a_n\}_{n\ge 1}$ is defined as follows: we have $a_1 = 1$, $a_2 = 0$, and for $n \ge 3$ we have $$a_n = \frac12 \sum\limits_{\substack{1\le i,j\\ i+j+k=n}} a_ia_ja_k.$$ Find $$\sum^{\infty}_{n=1} \frac{a_n}{2^n}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $10001$ students at an university. Some students join together to form several clubs (a student may belong to different clubs). Some clubs join together to form several societies (a club may belong to different societies). There are a total of $k$ societies. Suppose that the following conditions hold: [i]i.)[/i] Each pair of students are in exactly one club. [i]ii.)[/i] For each student and each society, the student is in exactly one club of the society. [i]iii.)[/i] Each club has an odd number of students. In addition, a club with ${2m+1}$ students ($m$ is a positive integer) is in exactly $m$ societies. Find all possible values of $k$. [i]Proposed by Guihua Gong, Puerto Rico[/i]

Let be three finite and nonempty sets $ A,B,C $ such that $ |A|=|C|\le |B| , $ and a bijection $ A\stackrel{\beta }{\longrightarrow } C. $ How many pairs of functions $ A\stackrel{f_2 }{\longrightarrow } B\stackrel{f_1 }{\longrightarrow } C $ that satisfy $ f_1\circ f_2=\beta $ are there?

In each field of 2009*2009 table you can write either 1 or -1. Denote Ak multiple of all numbers in k-th row and Bj the multiple of all numbers in j-th column. Is it possible to write the numbers in such a way that $ \sum_{i\equal{}1}^{2009}{Ai}\plus{} \sum_{i\equal{}1}^{2009}{Bi}\equal{}0$?