Let [n] be the set {1, 2,. . . , n}. For any $a, b \in N$, denote $G (a, b)$ by a graph (not directed) defined by the following rule: the vertices have the form (i, f), where $i \in [a]$, and $f: [a] \to [b]$. A vertex (i, f) and a vertex (j, g) are connected if $i \neq j$, and $f (k) \neq g (k)$ holds exactly for k strictly between i and j. Prove that for any $c \in N$ there is $a, b \in N$ such that the vertices of G (a, b) cannot be well-colored with $c$ colors.

[u]Set 1[/u] [b]p1.[/b] Farmer John has $4000$ gallons of milk in a bucket. On the first day, he withdraws $10\%$ of the milk in the bucket for his cows. On each following day, he withdraws a percentage of the remaining milk that is $10\%$ more than the percentage he withdrew on the previous day. For example, he withdraws $20\%$ of the remaining milk on the second day. How much milk, in gallons, is left after the tenth day? [b]p2.[/b] Will multiplies the first four positive composite numbers to get an answer of $w$. Jeremy multiplies the first four positive prime numbers to get an answer of $j$. What is the positive difference between $w$ and $j$? [b]p3.[/b] In Nathan’s math class of $60$ students, $75\%$ of the students like dogs and $60\%$ of the students like cats. What is the positive difference between the maximum possible and minimum possible number of students who like both dogs and cats? [u]Set 2[/u] [b]p4.[/b] For how many integers $x$ is $x^4 - 1$ prime? [b]p5.[/b] Right triangle $\vartriangle ABC$ satisfies $\angle BAC = 90^o$. Let $D$ be the foot of the altitude from $A$ to $BC$. If $AD = 60$ and $AB = 65$, find the area of $\vartriangle ABC$. [b]p6.[/b] Define $n! = n \times (n - 1) \times ... \times 1$. Given that $3! + 4! + 5! = a^2 + b^2 + c^2$ for distinct positive integers $a, b, c$, find $a + b + c$. [u]Set 3[/u] [b]p7.[/b] Max nails a unit square to the plane. Let M be the number of ways to place a regular hexagon (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Vincent, on the other hand, nails a regular unit hexagon to the plane. Let $V$ be the number of ways to place a square (of any size) in the same plane such that the square and hexagon share at least $2$ vertices. Find the nonnegative difference between $M$ and $V$ . [b]p8.[/b] Let a be the answer to this question, and suppose $a > 0$. Find $\sqrt{a +\sqrt{a +\sqrt{a +...}}}$ . [b]p9.[/b] How many ordered pairs of integers $(x, y)$ are there such that $x^2 - y^2 = 2019$? [u]Set 4[/u] [b]p10.[/b] Compute $\frac{p^3 + q^3 + r^3 - 3pqr}{p + q + r}$ where $p = 17$, $q = 7$, and $r = 8$. [b]p11.[/b] The unit squares of a $3 \times 3$ grid are colored black and white. Call a coloring good if in each of the four $2 \times 2$ squares in the $3 \times 3$ grid, there is either exactly one black square or exactly one white square. How many good colorings are there? Consider rotations and reflections of the same pattern distinct colorings. [b]p12.[/b] Define a $k$-[i]respecting [/i]string as a sequence of $k$ consecutive positive integers $a_1$, $a_2$, $...$ , $a_k$ such that $a_i$ is divisible by $i$ for each $1 \le i \le k$. For example, $7$, $8$, $9$ is a $3$-respecting string because $7$ is divisible by $1$, $8$ is divisible by $2$, and $9$ is divisible by $3$. Let $S_7$ be the set of the first terms of all $7$-respecting strings. Find the sum of the three smallest elements in $S_7$. [u]Set 5[/u] [b]p13.[/b] A triangle and a quadrilateral are situated in the plane such that they have a finite number of intersection points $I$. Find the sum of all possible values of $I$. [b]p14.[/b] Mr. DoBa continuously chooses a positive integer at random such that he picks the positive integer $N$ with probability $2^{-N}$ , and he wins when he picks a multiple of 10. What is the expected number of times Mr. DoBa will pick a number in this game until he wins? [b]p15.[/b] If $a, b, c, d$ are all positive integers less than $5$, not necessarily distinct, find the number of ordered quadruples $(a, b, c, d)$ such that $a^b - c^d$ is divisible by $5$. PS. You had better use hide for answers. Last 4 sets have been posted [url=https://artofproblemsolving.com/community/c4h2777362p24370554]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

$2017$ voters vote by submitting a ranking of the integers $\{1, 2, ..., 38\}$ from favorite (a vote for that value in $1$st place) to least favorite (a vote for that value in $38$th/last place). Let $a_k$ be the integer that received the most $k$th place votes (the smallest such integer if there is a tie). Find the maximum possible value of $\Sigma_{k=1}^{38} a_k$.

In a group of 21 persons, every two person communicate with different radio frequency. It's possible for two person to not communicate (means there's no frequency occupied to connect them). Only one frequency used by each couple, and it's unique for every couple. In every 3 persons, exactly two of them is not communicating to each other. Determine the maximum number of frequency required for this group. Explain your answer.

We have $98$ cards, in each one we will write one of the numbers: $1, 2, 3, 4,...., 97, 98$. We can order the $98$ cards, in a sequence such that two consecutive numbers $X$ and $Y$ and the number $X - Y$ is greater than $48$, determine how and how many ways we can make this sequence!!

How many (possibly empty) sets of lattice points $\{P_1, P_2, ... , P_M\}$, where each point $P_i =(x_i, y_i)$ for $x_i , y_i \in \{0, 1, 2, 3, 4, 5, 6\}$, satisfy that the slope of the line $P_iP_j$ is positive for each $1 \le i < j \le M$ ? An infinite slope, e.g. $P_i$ is vertically above $P_j$ , does not count as positive.

Each unit square of a $5 \times 5$ board is colored blue or yellow. Prove that there is a rectangle with sides parallel to the sides. axes of the board, such that its four corners are the same color.

Find all integers $ n \ge 2 $ for which it is possible to divide any triangle $ T $ in triangles $ T_1, T_2, \cdots, T_n $ and choose medians $ m_1, m_2, \cdots, m_n $, one in each of these triangles, so that these $ n $ medians have equal length.

Wendy randomly chooses a positive integer less than or equal to $2020$. The probability that the digits in Wendy's number add up to $10$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Find $m + n$.

a) A game master divides a group of $12$ players into two teams of six. The players do not know what the teams are, however the master gives each player a card containing the names of two other players: one of them is a teammate and the other is not, but the master does not tell the player which is which. Can the master write the names on the cards in such a way that the players can determine the teams? (All of the players can work together to do so.) b) On the next occasion, the game master writes the names of $3$ teammates and $1$ opposing player on each card (possibly in a mixed up order). Now he wants to write the names in such away that the players together cannot determine the two teams. Is it possible for him to achieve this? c) Can he write the names in such a way that the players together cannot determine the two teams, if now each card contains the names of $4$ teammates and $1$ opposing player (possibly in a mixed up order)?

Let $E$ be a set of $n$ points in the plane $(n \geq 3)$ whose coordinates are integers such that any three points from $E$ are vertices of a nondegenerate triangle whose centroid doesnt have both coordinates integers. Determine the maximal $n.$

On the table there are $2n$ coins that look the same. It is known that $n$ of them weigh 9 g. each, while the remaining $n$ weigh 10 g. each. It is required to split the coins into $n$ pairs with total weight of each pair 19 g. Prove that this can be done in less than $n$ weighings using a balance without additional weights (the balance shows which pan is heavier or that their weight is equal).

[b]p1.[/b] $p, q, r$ are prime numbers such that $p^q + 1 = r$. Find $p + q + r$. [b]p2.[/b] $2014$ apples are distributed among a number of children such that each child gets a different number of apples. Every child gets at least one apple. What is the maximum possible number of children who receive apples? [b]p3.[/b] Cathy has a jar containing jelly beans. At the beginning of each minute he takes jelly beans out of the jar. At the $n$-th minute, if $n$ is odd, he takes out $5$ jellies. If n is even he takes out $n$ jellies. After the $46$th minute there are only $4$ jellies in the jar. How many jellies were in the jar in the beginning? [b]p4.[/b] David is traveling to Budapest from Paris without a cellphone and he needs to use a public payphone. He only has two coins with him. There are three pay-phones - one that never works, one that works half of the time, and one that always works. The first phone that David tries does not work. Assuming that he does not use the same phone again, what is the probability that the second phone that he uses will work? [b]p5.[/b] Let $a, b, c, d$ be positive real numbers such that $$a^2 + b^2 = 1$$ $$c^2 + d^2 = 1;$$ $$ad - bc =\frac17$$ Find $ac + bd$. [b]p6.[/b] Three circles $C_A,C_B,C_C$ of radius $1$ are centered at points $A,B,C$ such that $A$ lies on $C_B$ and $C_C$, $B$ lies on $C_C$ and $C_A$, and $C$ lies on $C_A$ and $C_B$. Find the area of the region where $C_A$, $C_B$, and $C_C$ all overlap. [b]p7.[/b] Two distinct numbers $a$ and $b$ are randomly and uniformly chosen from the set $\{3, 8, 16, 18, 24\}$. What is the probability that there exist integers $c$ and $d$ such that $ac + bd = 6$? [b]p8.[/b] Let $S$ be the set of integers $1 \le N \le 2^{20}$ such that $N = 2^i + 2^j$ where $i, j$ are distinct integers. What is the probability that a randomly chosen element of $S$ will be divisible by $9$? [b]p9.[/b] Given a two-pan balance, what is the minimum number of weights you must have to weigh any object that weighs an integer number of kilograms not exceeding $100$ kilograms? [b]p10.[/b] Alex, Michael and Will write $2$-digit perfect squares $A,M,W$ on the board. They notice that the $6$-digit number $10000A + 100M +W$ is also a perfect square. Given that $A < W$, find the square root of the $6$-digit number. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

At every vertex $A_k(1\le k\le n)$ of a regular $n$-gon, $k$ coins are placed. We can do the following operation: in each step, one can choose two arbitrarily coins and move them to their adjacent vertices respectively, one clockwise and one anticlockwise. Find all positive integers $n$ such that after a finite number of operations, we can reach the following configuration: there are $n+1-k$ coins at vertex $A_k$ for all $1\le k\le n$.

Consider the number obtained by writing the numbers $1,2,\ldots,1990$ one after another. In this number every digit on an even position is omitted; in the so obtained number, every digit on an odd position is omitted; then in the new number every digit on an even position is omitted, and so on. What will be the last remaining digit?

Given an ordered $n$-tuple $A=(a_1,a_2,\cdots ,a_n)$ of real numbers, where $n\ge 2$, we define $b_k=\max{a_1,\ldots a_k}$ for each k. We define $B=(b_1,b_2,\cdots ,b_n)$ to be the “[i]innovated tuple[/i]” of $A$. The number of distinct elements in $B$ is called the “[i]innovated degree[/i]” of $A$. Consider all permutations of $1,2,\ldots ,n$ as an ordered $n$-tuple. Find the arithmetic mean of the first term of the permutations whose innovated degrees are all equal to $2$

On a table there are 2004 boxes, and in each box a ball lies. I know that some the balls are white and that the number of white balls is even. In each case I may point to two arbitrary boxes and ask whether in the box contains at least a white ball lies. After which minimum number of questions I can indicate two boxes for sure, in which white balls lie?

The faces of an icosahedron are painted into $5$ colors in such a way that two faces painted into the same color have no common points, even a vertices. Prove that for any point lying inside the icosahedron the sums of the distances from this point to the red faces and the blue faces are equal.

The numbers from$ 1$ to $2016$ are divided into three (disjoint) subsets $A, B$ and $C$, each one contains exactly $672$ numbers. Prove that you can find three numbers, each from a different subset, such that the sum of two of them is equal to the third. [hide=original wording]Skaitļi no 1 līdz 2016 ir sadalīti trīs (nešķeļošās) apakškopās A, B un C, katranotām satur tieši 672 skaitļus. Pierādīt, ka var atrast trīs tādus skaitļus, katru no citas apakškopas, ka divu no tiem summa ir vienāda ar trešo. [/hide]

Initially there are $n+1$ monomials on the blackboard: $1,x,x^2, \ldots, x^n $. Every minute each of $k$ boys simultaneously write on the blackboard the sum of some two polynomials that were written before. After $m$ minutes among others there are the polynomials $S_1=1+x,S_2=1+x+x^2,S_3=1+x+x^2+x^3,\ldots ,S_n=1+x+x^2+ \ldots +x^n$ on the blackboard. Prove that $ m\geq \frac{2n}{k+1} $.

Alberto and Bianca play a game on a square board. Alberto begins. On their turn, players place a $1 \times 2$ or $2 \times 1$ domino on two empty squares on the board. The player who cannot put a domino loses. Determine who has a winning strategy (and prove it) if the board is: i) $3 \times 3$ ii) $3 \times 4$

$10.$ A $2\times 3$ rectangle and a $3 \times 4$ rectangle are contained within a square without overlapping at any interior point, and the sides of the square are parallel to the sides of the two given rectangles. What is the smallest possible area of the square $?$

Let $N$ be a positive integer. In each of the $N^2$ unit squares of an $N\times N$ board, one of the two diagonals is drawn. The drawn diagonals divide the $N\times N$ board into $K$ regions. For each $N$, determine the smallest and the largest possible values of $K$. [asy] draw((0,0)--(3,0)--(3,3)--(0,3)--cycle); draw((1,0)--(1,3), dotted); draw((2,0)--(2,3), dotted); draw((0,1)--(3,1), dotted); draw((0,2)--(3,2), dotted); draw((1,0)--(0,1)--(2,3)--(3,2)--(2,1)--(0,3)); draw((1,1)--(2,0)--(3,1)); label("$1$",(0.35,2)); label("$2$",(1,2.65)); label("$3$",(2,2)); label("$4$",(2.65,2.65)); label("$5$",(0.35,0.35)); label("$6$",(1.3,1.3)); label("$7$",(2.65,0.35)); label("Example with $N=3$, $K=7$",(0,-0.3)--(3,-0.3),S); [/asy]

For what integers $n > 1$ can it happen that in a group of $n +1$ girls and $n$ boys, all the girls know a different number of boys while all the boys know the same number of girls? (NB Vassiliev)

Let $n$ be a positive integer relatively prime to $6$. We paint the vertices of a regular $n$-gon with three colours so that there is an odd number of vertices of each colour. Show that there exists an isosceles triangle whose three vertices are of different colours.