There are three piles of coins, with $a,b$ and $c$ coins respectively, where $a,b,c\geq2015$ are positive integers. The following operations are allowed: (1) Choose a pile with an even number of coins and remove all coins from this pile. Add coins to each of the remaining two piles with amount equal to half of that removed; or (2) Choose a pile with an odd number of coins and at least 2017 coins. Remove 2017 coins from this pile. Add 1009 coins to each of the remaining two piles. Suppose there are sufficiently many spare coins. Find all ordered triples $(a,b,c)$ such that after some finite sequence of allowed operations. There exists a pile with at least $2017^{2017}$ coins.

Let $n$ be a positive integer. Prove that in a regular $6n$-gon, we can draw $3n$ diagonals with pairwise distinct ends and partition the drawn diagonals into $n$ triplets so that: [list] [*] the diagonals in each triplet intersect in one interior point of the polygon and [*] all these $n$ intersection points are distinct. [/list]

In CMI, each person has atmost $3$ friends. A disease has infected exactly $2023$ peoplein CMI . Each day, a person gets infected if and only if atleast two of their friends were infected on the previous day. Once someone is infected, they can neither die nor be cured. Given that everyone in CMI eventually got infected, what is the maximum possible number of people in CMI?

4031 lines are drawn on a plane, no two parallel or perpendicular, and no three lines meet at a point. Determine the maximum number of acute-angled triangles that may be formed.

Prove that if we erase $n-3$ diagonals of a regular $n$-gon, then we may still choose $n-3$ of the remaining diagonals such that they don't intersect inside the $n$-gon; but it is possible to erase $n-2$ diagonals such that this statement doesn't hold.

A rectangle is divided into $200\times 3$ unit squares. Prove that the number of ways of splitting this rectangle into rectangles of size $1\times 2$ is divisible by $3$.

We call a diagonal of a polygon [i]nice[/i], if it is entirely inside the polygon or entirely outside the polygon. Let $P$ be an $n$–gon with no three of its vertices being on the same line. Prove that $P$ has at least $3(n-3)/2$ nice diagonals. [i]Proposed by Bálint Hujter, Budapest and Gábor Szűcs, Szikszó[/i]

There is a bacterium in one of the cells of a $10 \times 10{}$ checkered board. At the first move, the bacterium shifts to a cell adjacent by side to the original one, and divides into two bacteria (both stay in the same cell). Then again, one of the bacteria on the board shifts to a cell adjacent by side and divides into two bacteria, and so on. Is it possible that after some number of such moves the number of bacteria in each cell of the board is the same? [i]Alexandr Gribalko[/i]

[b]p1.[/b] David runs at $3$ times the speed of Alice. If Alice runs $2$ miles in $30$ minutes, determine how many minutes it takes for David to run a mile. [b]p2.[/b] Al has $2019$ red jelly beans. Bob has $2018$ green jelly beans. Carl has $x$ blue jelly beans. The minimum number of jelly beans that must be drawn in order to guarantee $2$ jelly beans of each color is $4041$. Compute $x$. [b]p3.[/b] Find the $7$-digit palindrome which is divisible by $7$ and whose first three digits are all $2$. [b]p4.[/b] Determine the number of ways to put $5$ indistinguishable balls in $6$ distinguishable boxes. [b]p5.[/b] A certain reduced fraction $\frac{a}{b}$ (with $a,b > 1$) has the property that when $2$ is subtracted from the numerator and added to the denominator, the resulting fraction has $\frac16$ of its original value. Find this fraction. [b]p6.[/b] Find the smallest positive integer $n$ such that $|\tau(n +1)-\tau(n)| = 7$. Here, $\tau(n)$ denotes the number of divisors of $n$. [b]p7.[/b] Let $\vartriangle ABC$ be the triangle such that $AB = 3$, $AC = 6$ and $\angle BAC = 120^o$. Let $D$ be the point on $BC$ such that $AD$ bisect $\angle BAC$. Compute the length of $AD$. [b]p8.[/b] $26$ points are evenly spaced around a circle and are labeled $A$ through $Z$ in alphabetical order. Triangle $\vartriangle LMT$ is drawn. Three more points, each distinct from $L, M$, and $T$ , are chosen to form a second triangle. Compute the probability that the two triangles do not overlap. [b]p9.[/b] Given the three equations $a +b +c = 0$ $a^2 +b^2 +c^2 = 2$ $a^3 +b^3 +c^3 = 19$ find $abc$. [b]p10.[/b] Circle $\omega$ is inscribed in convex quadrilateral $ABCD$ and tangent to $AB$ and $CD$ at $P$ and $Q$, respectively. Given that $AP = 175$, $BP = 147$,$CQ = 75$, and $AB \parallel CD$, find the length of $DQ$. [b]p11. [/b]Let $p$ be a prime and m be a positive integer such that $157p = m^4 +2m^3 +m^2 +3$. Find the ordered pair $(p,m)$. [b]p12.[/b] Find the number of possible functions $f : \{-2,-1, 0, 1, 2\} \to \{-2,-1, 0, 1, 2\}$ that satisfy the following conditions. (1) $f (x) \ne f (y)$ when $x \ne y$ (2) There exists some $x$ such that $f (x)^2 = x^2$ [b]p13.[/b] Let $p$ be a prime number such that there exists positive integer $n$ such that $41pn -42p^2 = n^3$. Find the sum of all possible values of $p$. [b]p14.[/b] An equilateral triangle with side length $ 1$ is rotated $60$ degrees around its center. Compute the area of the region swept out by the interior of the triangle. [b]p15.[/b] Let $\sigma (n)$ denote the number of positive integer divisors of $n$. Find the sum of all $n$ that satisfy the equation $\sigma (n) =\frac{n}{3}$. [b]p16[/b]. Let $C$ be the set of points $\{a,b,c\} \in Z$ for $0 \le a,b,c \le 10$. Alice starts at $(0,0,0)$. Every second she randomly moves to one of the other points in $C$ that is on one of the lines parallel to the $x, y$, and $z$ axes through the point she is currently at, each point with equal probability. Determine the expected number of seconds it will take her to reach $(10,10,10)$. [b]p17.[/b] Find the maximum possible value of $$abc \left( \frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)^3$$ where $a,b,c$ are real such that $a +b +c = 0$. [b]p18.[/b] Circle $\omega$ with radius $6$ is inscribed within quadrilateral $ABCD$. $\omega$ is tangent to $AB$, $BC$, $CD$, and $DA$ at $E, F, G$, and $H$ respectively. If $AE = 3$, $BF = 4$ and $CG = 5$, find the length of $DH$. [b]p19.[/b] Find the maximum integer $p$ less than $1000$ for which there exists a positive integer $q$ such that the cubic equation $$x^3 - px^2 + q x -(p^2 -4q +4) = 0$$ has three roots which are all positive integers. [b]p20.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle ABC = 60^o$,$\angle ACB = 20^o$. Let $P$ be the point such that $CP$ bisects $\angle ACB$ and $\angle PAC = 30^o$. Find $\angle PBC$. PS. You had better use hide for answers.

The cells of a square $2011 \times 2011$ array are labelled with the integers $1,2,\ldots, 2011^2$, in such a way that every label is used exactly once. We then identify the left-hand and right-hand edges, and then the top and bottom, in the normal way to form a torus (the surface of a doughnut). Determine the largest positive integer $M$ such that, no matter which labelling we choose, there exist two neighbouring cells with the difference of their labels at least $M$. (Cells with coordinates $(x,y)$ and $(x',y')$ are considered to be neighbours if $x=x'$ and $y-y'\equiv\pm1\pmod{2011}$, or if $y=y'$ and $x-x'\equiv\pm1\pmod{2011}$.) [i](Romania) Dan Schwarz[/i]

For a sequence $\{a_i\}_{i\ge1}$ consisting of only positive integers, prove that if for all different positive integers $i$ and $j$, we have $a_i\nmid a_j$, then $$\{p\mid p\text{ is a prime and }p\mid a_i\text{ for some }i\}$$is a infinite set.

Let $n\ge 3$ be an integer. Let $s(n)$ be the number of (ordered) pairs $(a;b)$ consisting of positive integers $a,b$ from the set $\{1,2,\dots ,n\}$ which satisfy $\gcd (a,b,n)=1$. Prove that $s(n)$ is divisible by $4$ for all $n\ge 3$. [i] (Vlad Robu) [/i]

Five distinct numbers are drawn successively and at random from the set $\{1, \cdots , n\}$. Show that the probability of a draw in which the first three numbers as well as all five numbers can be arranged to form an arithmetic progression is greater than $\frac{6}{(n-2)^3}$

In an $n\times{n}$ grid, there are some cats living in each cell (the number of cats in a cell must be a non-negative integer). Every midnight, the manager chooses one cell: (a) The number of cats living in the chosen cell must be greater than or equal to the number of neighboring cells of the chosen cell. (b) For every neighboring cell of the chosen cell, the manager moves one cat from the chosen cell to the neighboring cell. (Two cells are called "neighboring" if they share a common side, e.g. there are only $2$ neighboring cells for a cell in the corner of the grid) Find the minimum number of cats living in the whole grid, such that the manager is able to do infinitely many times of this process.

Fix an integer $n \geq 2$. An $n\times n$ sieve is an $n\times n$ array with $n$ cells removed so that exactly one cell is removed from every row and every column. A stick is a $1\times k$ or $k\times 1$ array for any positive integer $k$. For any sieve $A$, let $m(A)$ be the minimal number of sticks required to partition $A$. Find all possible values of $m(A)$, as $A$ varies over all possible $n\times n$ sieves. [i]Palmer Mebane[/i]

[b]p1.[/b] Prove that the equation $x^6 - 143x^5 - 917x^4 + 51x^3 + 77x^2 + 291x + 1575 = 0$ has no integer solutions. [b]p2.[/b] There are $81$ wheels in a storage marked by their two types, say first and second type. Wheels of the same type weigh equally. Any wheel of the second type is much lighter than a wheel of the first type. It is known that exactly one wheel is marked incorrectly. Show that it can be detected with certainty after four measurements on a balance scale. [b]p3.[/b] Rob and Ann multiplied the numbers from $1$ to $100$ and calculated the sum of digits of this product. For this sum, Rob calculated the sum of its digits as well. Then Ann kept repeating this operation until he got a one-digit number. What was this number? [b]p4.[/b] Rui and Jui take turns placing bishops on the squares of the $ 8\times 8$ chessboard in such a way that bishops cannot attack one another. (In this game, the color of the rooks is irrelevant.) The player who cannot place a rook loses the game. Rui takes the first turn. Who has a winning strategy, and what is it? [b]p5.[/b] The following figure can be cut along sides of small squares into several (more than one) identical shapes. What is the smallest number of such identical shapes you can get? [img]https://cdn.artofproblemsolving.com/attachments/8/e/9cd09a04209774dab34bc7f989b79573453f35.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $2019$ cities in the country of Balticwayland. Some pairs of cities are connected by non-intersecting bidirectional roads, each road connecting exactly 2 cities. It is known that for every pair of cities $A$ and $B$ it is possible to drive from $A$ to $B$ using at most $2$ roads. There are $62$ cops trying to catch a robber. The cops and robber all know each others’ locations at all times. Each night, the robber can choose to stay in her current city or move to a neighbouring city via a direct road. Each day, each cop has the same choice of staying or moving, and they coordinate their actions. The robber is caught if she is in the same city as a cop at any time. Prove that the cops can always catch the robber

Five guys are eating hamburgers. Each one puts a top half and a bottom half of a hamburger bun on the grill. When the buns are toasted, each guy randomly takes two pieces of bread off of the grill. What is the probability that each guy gets a top half and a bottom half?

The elements of the set $F$ are some subsets of $\left\{1,2,\ldots ,n\right\}$ and satisfy the conditions: i) if $A$ belongs to $F$, then $A$ has three elements; ii)if $A$ and $B$ are distinct elements of $F$ , then $A$ and $B$ have at most one common element. Let $f(n)$ be the greatest possible number of elements of $F$. Prove that $\frac{n^{2}-4n}{6}\leq f(n) \leq \frac{n^{2}-n}{6}$

A substitute teacher lead a groop of students to go for a trip. The teacher who in charge of the groop of the students told the substitude teacher that there are two students who always lie, and the others always tell the truth. But the substitude teacher don't know who are the two students always lie. They get lost in a forest. Finally the are in a crossroad which has four roads. The substitute teacher knows that their camp is on one road, and the distence is $20$ minutes' walk. The students have to go to the camp before it gets dark. $(1)$ If there are $8$ students, and $60$ minutes before it gets dark, give a plan that all students can get back to the camp. $(2)$ If there are $4$ students, and $100$ minutes before it gets dark, is there a plan that all students can get back to the camp?

In a building there are $119$ inhabitants who live in $120$ apartments (several inhabitants can live in the same apartment). We call an apartment [i]overcrowded [/i] if $15$ or more people live in it. Every day in some overcrowded apartment (if there is one) its inhabitants have a fight and yes they all go to live in a different apartment (which may or may not be already inhabited). Should you always terminate this process?

[b]p1.[/b] What is the last digit of $$1! + 2! + ... + 10!$$ where $n!$ is defined to equal $1 \cdot 2 \cdot ... \cdot n$? [b]p2.[/b] What pair of positive real numbers, $(x, y)$, satisfies $$x^2y^2 = 144$$ $$(x - y)^3 = 64?$$ [b]p3.[/b] Paul rolls a standard $6$-sided die, and records the results. What is the probability that he rolls a $1$ ten times before he rolls a $6$ twice? [b]p4.[/b] A train is approaching a $1$ kilometer long tunnel at a constant $40$ km/hr. It so happens that if Roger, who is inside, runs towards either end of the tunnel at a contant $10$ km/hr, he will reach that end at the exact same time as the train. How far from the center of the tunnel is Roger? [b]p5.[/b] Let $ABC$ be a triangle with $A$ being a right angle. Let $w$ be a circle tangent to $\overline{AB}$ at $A$ and tangent to $\overline{BC}$ at some point $D$. Suppose $w$ intersects $\overline{AC}$ again at $E$ and that $\overline{CE} = 3$, $\overline{CD} = 6$. Compute $\overline{BD}$. [b]p6.[/b] In how many ways can $1000$ be written as a sum of consecutive integers? [b]p7.[/b] Let $ABC$ be an isosceles triangle with $\overline{AB} = \overline{AC} = 10$ and $\overline{BC} = 6$. Let $M$ be the midpoint of $\overline{AB}$, and let $\ell$ be the line through $A$ parallel to $\overline{BC}$. If $\ell$ intersects the circle through $A$, $C$ and $M$ at $D$, then what is the length of $\overline{AD}$? [b]p8.[/b] How many ordered triples of pairwise relatively prime, positive integers, $\{a, b, c\}$, have the property that $a + b$ is a multiple of $c$, $b + c$ is a multiple of $a$, and $a + c$ is a multiple of $b$? [b]p9.[/b] Consider a hexagon inscribed in a circle of radius $r$. If the hexagon has two sides of length $2$, two sides of length $7$, and two sides of length $11$, what is $r$? [b]p10.[/b] Evaluate $$\sum^{\infty}_{i=0} \sum^{\infty}_{j=0} \frac{\left( (-1)^i + (-1)^j\right) \cos (i) \sin (j)}{i!j!} ,$$ where angles are measured in degrees, and $0!$ is defined to equal $1$. PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In a $ 19\times 19$ board, a piece called [i]dragon[/i] moves as follows: It travels by four squares (either horizontally or vertically) and then it moves one square more in a direction perpendicular to its previous direction. It is known that, moving so, a dragon can reach every square of the board. The [i]draconian distance[/i] between two squares is defined as the least number of moves a dragon needs to move from one square to the other. Let $ C$ be a corner square, and $ V$ the square neighbor of $ C$ that has only a point in common with $ C$. Show that there exists a square $ X$ of the board, such that the draconian distance between $ C$ and $ X$ is greater than the draconian distance between $ C$ and $ V$.

Prove there exists a constant $c$ (independent of $n$) such that for any graph $G$ with $n>2$ vertices, we can split $G$ into a forest and at most $cf(n)$ disjoint cycles, where a) $f(n)=n\ln{n}$; b) $f(n)=n$. [i]David Yang.[/i]

A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$