$n\geq2$ and $E=\left \{ 1,2,...,n \right \}. A_1,A_2,...,A_k$ are subsets of $E$, such that for all $1\leq{i}<{j}\leq{k}$ Exactly one of $A_i\cap{A_j},A_i'\cap{A_j},A_i\cap{A_j'},A_i'\cap{A_j'}$ is empty set. What is the maximum possible $k$?

Suppose that there are $2001$ golf balls which are numbered from $1$ to $2001$ respectively, and some of these golf balls are placed inside a box. It is known that the difference between the two numbers of any two golf balls inside the box is neither $5$ nor $8$. How many such golf balls the box can contain at most? Justify your answer.

A convex polyhedron has $n$ faces that are all congruent triangles with angles $36^{\circ}, 72^{\circ}$, and $72^{\circ}$. Determine, with proof, the maximum possible value of $n$.

Let $A_1B_1C_1D_1E_1$ be a regular pentagon.For $ 2 \le n \le 11$, let $A_nB_nC_nD_nE_n$ be the pentagon whose vertices are the midpoint of the sides $A_{n-1}B_{n-1}C_{n-1}D_{n-1}E_{n-1}$. All the $5$ vertices of each of the $11$ pentagons are arbitrarily coloured red or blue. Prove that four points among these $55$ points have the same colour and form the vertices of a cyclic quadrilateral.

On the $n\times n$ checker board, several cells were marked in such a way that lower left ($L$) and upper right($R$) cells are not marked and that for any knight-tour from $L$ to $R$, there is at least one marked cell. For which $n>3$, is it possible that there always exists three consective cells going through diagonal for which at least two of them are marked?

Let S be the set of line segments between any two vertices of a regular $21$-gon. If we select two distinct line segments from $S$ at random, what is the probability they intersect? Note that line segments are considered to intersect if they share a common vertex.

A table is covered by $15$ pieces of paper. Show that we can remove $7$ pieces so that the remaining $8$ cover at least $8/15$ of the table.

Let $a_{i,j}\enspace(\forall\enspace 1\leq i\leq n, 1\leq j\leq n)$ be $n^2$ real numbers such that $a_{i,j}+a_{j,i}=0\enspace\forall i, j$ (in particular, $a_{i,i}=0\enspace\forall i$). Prove that $$ {1\over n}\sum_{i=1}^{n}\left(\sum_{j=1}^{n} a_{i,j}\right)^2\leq{1\over2}\sum_{i=1}^{n}\sum_{j=1}^{n} a_{i,j}^2. $$

Prove that a graph containing a copy of each possible tree on $n$ vertices as a subgraph has at least $n(\ln n - 2)$ edges.

Each side face of a regular hexagonal prism is colored in one of three colors (for example, red, yellow, blue), and the adjacent prism faces have different colors. In how many different ways can the edges of the prism be colored (using all three colors is optional)?

On the real number line, paint red all points that correspond to integers of the form $81x+100y$, where $x$ and $y$ are positive integers. Paint the remaining integer point blue. Find a point $P$ on the line such that, for every integer point $T$, the reflection of $T$ with respect to $P$ is an integer point of a different colour than $T$.

Let $M= \{ 1, 2, \cdots, 19 \}$ and $A = \{ a_{1}, a_{2}, \cdots, a_{k}\}\subseteq M$. Find the least $k$ so that for any $b \in M$, there exist $a_{i}, a_{j}\in A$, satisfying $b=a_{i}$ or $b=a_{i}\pm a_{i}$ ($a_{i}$ and $a_{j}$ do not have to be different) .

In an election between $\text{A}$ and $\text{B}$, during the counting of the votes, neither candidate was more than $2$ votes ahead, and the vote ended in a tie, $6$ votes to $6$ votes. Two votes for the same candidate are indistinguishable. In how many orders could the votes have been counted? One possibility is $\text{AABBABBABABA}$.

p1. Given the set $H = \{(x, y)|(x -y)^2 + x^2 - 15x + 50 = 0$ where x and y are natural numbers $\}$. Find the number of subsets of $H$. p2. A magician claims to be an expert at guessing minds with following show. One of the viewers was initially asked to hidden write a five-digit number, then subtract it with the sum of the digits that make up the number, then name four of the five digits that make up the resulting number (in order of any). Then the magician can guess the numbers hidden. For example, if the audience mentions four numbers result: $0, 1, 2, 3$, then the magician will know that the hidden number is $3$. a. Give an example of your own from the above process. b. Explain mathematically the general form of the process. p3. In a fruit basket there are $20$ apples, $18$ oranges, $16$ mangoes, $10$ pineapples and $6$ papayas. If someone wants to take $10$ pieces from the basket. After that, how many possible compositions of fruit are drawn? p4. Inside the Equator Park, a pyramid-shaped building will be made with base of an equilateral triangle made of translucent material with a side length of the base $8\sqrt3$ m long and $8$ m high. A globe will be placed in a pyramid the. Ignoring the thickness of the pyramidal material, determine the greatest possible length of the radius of the globe that can be made. p5. What is the remainder of $2012^{2012} + 2014^{2012}$ divided by $2013^2$?

[b][b]p1.[/b][/b] Find the perimeter of a regular hexagon with apothem $3$. [b]p2.[/b] Concentric circles of radius $1$ and r are drawn on a circular dartboard of radius $5$. The probability that a randomly thrown dart lands between the two circles is $0.12$. Find $r$. [b]p3.[/b] Find all ordered pairs of integers $(x, y)$ with $0 \le x \le 100$, $0 \le y \le 100$ satisfying $$xy = (x - 22) (y + 15) .$$ [b]p4.[/b] Points $A_1$,$A_2$,$...$,$A_{12}$ are evenly spaced around a circle of radius $1$, but not necessarily in order. Given that chords $A_1A_2$, $A_3A_4$, and $A_5A_6$ have length $2$ and chords $A_7A_8$ and $A_9A_{10}$ have length $2 sin (\pi / 12)$, find all possible lengths for chord $A_{11}A_{12}$. [b]p5.[/b] Let $a$ be the number of digits of $2^{1998}$, and let $b$ be the number of digits in $5^{1998}$. Find $a + b$. [b]p6.[/b] Find the volume of the solid in $R^3$ defined by the equations $$x^2 + y^2 \le 2$$ $$x + y + |z| \le 3.$$ [b]p7.[/b] Positive integer $n$ is such that $3n$ has $28$ positive divisors and $4n$ has $36$ positive divisors. Find the number of positive divisors of $n$. [b]p8.[/b] Define functions $f$ and $g$ by $f (x) = x +\sqrt{x}$ and $g (x) = x + 1/4$. Compute $$g(f(g(f(g(f(g(f(3)))))))).$$ (Your answer must be in the form $a + b \sqrt{ c}$ where $a$, $b$, and $c$ are rational.) [b]p9.[/b] Sequence $(a_1, a_2,...)$ is defined recursively by $a_1 = 0$, $a_2 = 100$, and $a_n = 2a_{n-1}-a_{n-2}-3$. Find the greatest term in the sequence $(a_1, a_2,...)$. [b]p10.[/b] Points $X = (3/5, 0)$ and $Y = (0, 4/5)$ are located on a Cartesian coordinate system. Consider all line segments which (like $\overline{XY}$ ) are of length 1 and have one endpoint on each axis. Find the coordinates of the unique point $P$ on $\overline{XY}$ such that none of these line segments (except $\overline{XY}$ itself) pass through $P$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] There are $2000$ cans of paint. Show that at least one of the following two statements must be true. There are at least $45$ cans of the same color. There are at least $45$ cans all of different colors. [b]p2.[/b] The measures of the $3$ angles of one triangle are all different from each other but are the same as the measures of the $3$ angles of a second triangle. The lengths of $2$ sides of the first triangle are different from each other but are the same as the lengths of $2$ sides of the second triangle. Must the length of the remaining side of the first triangle be the same as the length of the remaining side of the second triangle? If yes, prove it. If not, provide an example. [b]p3.[/b] Consider the sequence $a_1=1$, $a_2=2$, $a_3=5/2$, ... satisfying $a_{n+1}=a_n+(a_n)^{-1}$ for $n>1$. Show that $a_{10000}>141$. [b]p4.[/b] Prove that no matter how $250$ points are placed in a disk of radius $1$, there is a disk of radius $1/10$ that contains at least $3$ of the points. [b]p5.[/b] Prove that: Given any $11$ integers (not necessarily distinct), one can select $6$ of them so that their sum is divisible by $6$. Given any $71$ integers (not necessarily distinct), one can select $36$ of them so that their sum is divisible by $36$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a football season, even number $n$ of teams plays a simple series, i.e. each team plays once against each other team. Show that ona can group the series into $n-1$ rounds such that in every round every team plays exactly one match.

There are $60$ towns in $Graphland$ every two countries of which are connected by only a directed way. Prove that we can color four towns to red and four towns to green such that every way between green and red towns are directed from red to green

A regular hexagon is split into $6$ congruent equilateral triangles by drawing in the $3$ main diagonals. Each triangle is colored $1$ of $4$ distinct colors. Rotations and reflections of the figure are considered nondistinct. Find the number of possible distinct colorings.

Define a sequence $ < a_n > _{n\geq0}$ by $ a_0 \equal{} 0$, $ a_1 \equal{} 1$ and \[ a_n \equal{} 2a_{n \minus{} 1} \plus{} a_{n \minus{} 2},\] for $ n\geq2.$ $ (a)$ For every $ m > 0$ and $ 0\leq j\leq m,$ prove that $ 2a_m$ divides $ a_{m \plus{} j} \plus{} ( \minus{} 1)^ja_{m \minus{} j}$. $ (b)$ Suppose $ 2^k$ divides $ n$ for some natural numbers $ n$ and $ k$. Prove that $ 2^k$ divides $ a_n.$

Evin picks distinct points $A, B, C, D, E$, and $F$ on a circle. What is the probability that there are exactly two intersections among the line segments $AB$, $CD$, and $EF$? [i]Proposed by Evin Liang[/i]

Five points are given in space, no four of which are coplanar. Each of the segments connecting two of them is painted in white, green or red, so that all the colors are used and no three segments of the same color form a triangle. Prove that among these five points there is one at which segments of all the three colors meet.

Consider a sequence of numbers $(a_1, a_2, \ldots , a_{2^n}).$ Define the operation \[S\biggl((a_1, a_2, \ldots , a_{2^n})\biggr) = (a_1a_2, a_2a_3, \ldots , a_{2^{n-1}a_{2^n}, a_{2^n}a_1).}\] Prove that whatever the sequence $(a_1, a_2, \ldots , a_{2^n})$ is, with $a_i \in \{-1, 1\}$ for $i = 1, 2, \ldots , 2^n,$ after finitely many applications of the operation we get the sequence $(1, 1, \ldots, 1).$

Anna and Bob play the following game. In the beginning, Bob writes down the numbers $1, 2, ... , 2022$ on a piece of paper, such that half of the numbers are on the left and half on the right. Furthermore, we assume that the $1011$ numbers on both sides are written in some order. After Bob does this, Anna has the opportunity to swap the positions of the two numbers lying on different sides of the paper if they have different parity. Anna wins if, after finitely many moves, all odd numbers end up on the left, in increasing order, and all even ones end up on the right, in increasing order. Can Bob write down a arrangement of numbers for which Anna cannot win? For example, Bob could write down numbers in the following way: $$4, 2, 5, 7, 9, ... , 2021\,\,\,\,\,\,\,\,\,\,,\, \,\,\,\,\,\,\,\,\,\,,\, 3, 1, 6, 8, 10, ... , 2022$$ Then Anna could swap the numbers $1, 4$ and then swap $2, 3$ to win. However, if Anna swapped the pairs $3, 4$ and $1, 2$, the resulting numbers on the left and on the right would not be in increasing order, and hence Anna would not win.

For any integer $n\geq 2$, let $N(n)$ be the maxima number of triples $(a_i, b_i, c_i)$, $i=1, \ldots, N(n)$, consisting of nonnegative integers $a_i$, $b_i$ and $c_i$ such that the following two conditions are satisfied: [list][*] $a_i+b_i+c_i=n$ for all $i=1, \ldots, N(n)$, [*] If $i\neq j$ then $a_i\neq a_j$, $b_i\neq b_j$ and $c_i\neq c_j$[/list] Determine $N(n)$ for all $n\geq 2$. [i]Proposed by Dan Schwarz, Romania[/i]