[b]p1.[/b] The length of the first side of a triangle is $1$, the length of the second side is $11$, and the length of the third side is an integer. Find that integer. [b]p2.[/b] Suppose $a, b$, and $c$ are positive numbers such that $a + b + c = 1$. Prove that $ab + ac + bc \le \frac13$. [b]p3.[/b] Prove that $1 +\frac12+\frac13+\frac14+ ... +\frac{1}{100}$ is not an integer. [b]p4.[/b] Find all of the four-digit numbers n such that the last four digits of $n^2$ coincide with the digits of $n$. [b]p5.[/b] (Bonus) Several ants are crawling along a circle with equal constant velocities (not necessarily in the same direction). If two ants collide, both immediately reverse direction and crawl with the same velocity. Prove that, no matter how many ants and what their initial positions are, they will, at some time, all simultaneously return to the initial positions. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

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]

In a $9\times9$ board, the squares are labeled from 11 to 99, with the first digit indicating the row and the second digit indicating the column. One would like to paint the squares in black or white in a way that each black square is adjacent to at most one other black square and each white square is adjacent to at most one other white square. Two squares are adjacent if they share a common side. How many ways are there to paint the board such that the squares $44$ and $49$ are both black?

Alberto, Bernardo, and Carlos are collectively listening to three different songs. Each is simultaneously listening to exactly two songs, and each song is being listened to by exactly two people. In how many ways can this occur?

Determine the smallest positive integer $n$ such that, for any coloring of the elements of the set $\{2,3,...,n\}$ with two colors, the equation $x + y = z$ has a monochrome solution with $x \ne y$. (We say that the equation $x + y = z$ has a monochrome solution if there exist $a, b, c$ distinct, having the same color, such that $a + b = c$.)

Does there exist a nonconvex polyhedron such that not one of its vertices is visible from a point $M$ outside it? (The polyhedron is made out of an opaque material.) (AY Belov, S Markelov)

For any nonempty set $S$, we define $\sigma(S)$ and $\pi(S)$ as sum and product of all elements from set $S$, respectively. Prove that $a)$ $\sum \limits_{} \frac{1}{\pi(S)} =n$ $b)$ $\sum \limits_{} \frac{\sigma(S)}{\pi(S)} =(n^2+2n)-\left(1+\frac{1}{2}+\frac{1}{3}+...+\frac{1}{n}\right)(n+1)$ where $\sum$ denotes sum by all nonempty subsets $S$ of set $\{1,2,...,n\}$

A [i]lattice point[/i] is a point whose coordinates are both integers. Suppose Johann walks in a line from the point $(0, 2004)$ to a random lattice point in the interior (not on the boundary) of the square with vertices $(0, 0)$, $(0, 99)$, $(99,99)$, $(99, 0)$. What is the probability that his path, including the endpoints, contains an even number of lattice points?

Positive numbers are written in the squares of a 10 × 10 table. Frogs sit in five squares and cover the numbers in these squares. Kostya found the sum of all visible numbers and got 10. Then each frog jumped to an adjacent square and Kostya’s sum changed to $10^2$. Then the frogs jumped again, and the sum changed to $10^3$ and so on: every new sum was 10 times greater than the previous one. What maximum sum can Kostya obtain?

There are $n \geq 3$ islands in a city. Initially, the ferry company offers some routes between some pairs of islands so that it is impossible to divide the islands into two groups such that no two islands in different groups are connected by a ferry route. After each year, the ferry company will close a ferry route between some two islands $X$ and $Y$. At the same time, in order to maintain its service, the company will open new routes according to the following rule: for any island which is connected to a ferry route to exactly one of $X$ and $Y$, a new route between this island and the other of $X$ and $Y$ is added. Suppose at any moment, if we partition all islands into two nonempty groups in any way, then it is known that the ferry company will close a certain route connecting two islands from the two groups after some years. Prove that after some years there will be an island which is connected to all other islands by ferry routes.

If the set $S = \{1,2,3,…,16\}$ is partitioned into $n$ subsets, there must be a subset in which elements $a, b, c$ (can be the same) exist, satisfying $a+ b=c$. Find the maximum value of $n$.

Let $n \ge 3$ be an integer and $A$ be a subset of the real numbers of size n. Denote by $B$ the set of real numbers that are of the form $ x \cdot y$, where $x, y \in A$ and $x\ne y$. At most how many distinct positive primes could $B$ contain (depending on $n$)?

Each of the six boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$, $B_6$ initially contains one coin. The following operations are allowed Type 1) Choose a non-empty box $B_j$, $1\leq j \leq 5$, remove one coin from $B_j$ and add two coins to $B_{j+1}$; Type 2) Choose a non-empty box $B_k$, $1\leq k \leq 4$, remove one coin from $B_k$ and swap the contents (maybe empty) of the boxes $B_{k+1}$ and $B_{k+2}$. Determine if there exists a finite sequence of operations of the allowed types, such that the five boxes $B_1$, $B_2$, $B_3$, $B_4$, $B_5$ become empty, while box $B_6$ contains exactly $2010^{2010^{2010}}$ coins. [i]Proposed by Hans Zantema, Netherlands[/i]

In the land of Binary , the unit of currency is called Ben and currency notes are available in denominations $1,2,2^2,2^3,..$ Bens. The rules of the Government of Binary stipulate that one can not use more than two notes of any one denomination in any transaction. For example, one can give change for $2$ Bens in two ways : $2$ one Ben notes or $1$ two Ben note. For $5$ Ben one can given $1$ one Ben and $1$ four Ben note or $1$ Ben note and $2$ two Ben notes. Using $5$ one Ben notes or $3$ one Ben notes and $1$ two Ben notes for a $5$ Ben transaction is prohibited. Find the number of ways in which one can give a change $100$ Bens following the rules of the Government.

In the $n \times n$ table in every cell there is one child. Every child looks in neigbour cell. So every child sees ear or back of the head of neighbour. What is minimal number children, that see ear ?

Suppose we have a simple polygon (that is it does not intersect itself, but not necessarily convex). Show that this polygon has a diameter which is completely inside the polygon and the two arcs it creates on the polygon perimeter (the two arcs have 2 vertices in common) both have at least one third of the vertices of the polygon.

The following game is played on a rectangular chessboard $ 5 \times 9$ (with five rows and nine columns). Initially, a number of discs are randomly placed on some of the squares of the chessboard, with at most one disc on each square. A complete move consists of the moving every disc subject to the following rules: $ (1)$ Each disc may be moved one square up, down, left or right; $ (2)$ If a particular disc is moved up or down as part of a complete move, then it must be moved left or right in the next complete move; $ (3)$ If a particular disc is moved left or right as part of a complete move, then it must be moved up or down in the next complete move; $ (4)$ At the end of a complete move, no two discs can be on the same square. The game stops if it becomes impossible to perform a complete move. Prove that if initially $ 33$ discs are placed on the board then the game must eventually stop. Prove also that it is possible to place $ 32$ discs on the boards in such a way that the game could go on forever.

Let $P$ be the power set of $\{1, 2, 3, 4\}$ (meaning the elements of P are the subsets of $\{1, 2, 3, 4\}$). How many subsets $S$ of $P$ are there such that no two distinct integers $a, b \in \{1, 2, 3, 4\}$ appear together in exactly one element of $S$?

You have a $7\times 7$ board divided into $49$ boxes. Mateo places a coin in a box. a) Prove that Mateo can place the coin so that it is impossible for Emi to completely cover the $48$ remaining squares, without gaps or overlaps, using $15$ $3\times1$ rectangles and a cubit of three squares, like those in the figure. [img]https://cdn.artofproblemsolving.com/attachments/6/9/a467439094376cd95c6dfe3e2ad3e16fe9f124.png[/img] b) Prove that no matter which square Mateo places the coin in, Emi will always be able to cover the 48 remaining squares using $14$ $3\times1$ rectangles and two cubits of three squares.

Drawing all diagonals in a regular $2013$-gon, the regular $2013$-gon is divided into non-overlapping polygons. Prove that there exist exactly one $2013$-gon out of all such polygons.

Prove that the number of pairs $ \left(\alpha,S\right)$ of a permutation $ \alpha$ of $ \{1,2,\dots,n\}$ and a subset $ S$ of $ \{1,2,\dots,n\}$ such that \[ \forall x\in S: \alpha(x)\not\in S\] is equal to $ n!F_{n \plus{} 1}$ in which $ F_n$ is the Fibonacci sequence such that $ F_1 \equal{} F_2 \equal{} 1$

Let $ r$, $ s$ be two positive integers and $ P$ a 'chessboard' with $ r$ rows and $ s$ columns. Let $ M$ denote the maximum value of rooks placed on $ P$ such that no two of them attack each other. (a) Determine $ M$. (b) How many ways to place $ M$ rooks on $ P$ such that no two of them attack each other? [Note: In chess, a rook moves and attacks in a straight line, horizontally or vertically.]

A $ 9 \times 12$ rectangle is partitioned into unit squares. The centers of all the unit squares, except for the four corner squares and eight squares sharing a common side with one of them, are coloured red. Is it possible to label these red centres $ C_1,C_2,\ldots ,C_{96}$ in such way that the following to conditions are both fulfilled i) the distances $C_1C_2,\ldots ,C_{95}C_{96}, C_{96}C_{1}$ are all equal to $ \sqrt {13}$, ii) the closed broken line $ C_1C_2\ldots C_{96}C_1$ has a centre of symmetry? [i]Bulgaria[/i]