The positive integer $n$ has the property that, in any set of $n$ integers, chosen from the integers $1,2, \ldots, 1988,$ twenty-nine of them form an arithmetic progression. Prove that $n > 1788.$

Determine all natural numbers $n \ge 2$ with the property that there are two permutations $(a_1, a_2,... , a_n) $ and $(b_1, b_2,... , b_n)$ of the numbers $1, 2,..., n$ such that $(a_1 + b_1, a_2 +b_2,..., a_n + b_n)$ are consecutive natural numbers. [i](Walther Janous)[/i]

[u]Round 1[/u] [b]p1.[/b] What is the smallest number equal to its cube? [b]p2.[/b] Fhomas has $5$ red spaghetti and $5$ blue spaghetti, where spaghetti are indistinguishable except for color. In how many different ways can Fhomas eat $6$ spaghetti, one after the other? (Two ways are considered the same if the sequence of colors are identical) [b]p3.[/b] Jocelyn labels the three corners of a triangle with three consecutive natural numbers. She then labels each edge with the sum of the two numbers on the vertices it touches, and labels the center with the sum of all three edges. If the total sum of all labels on her triangle is $120$, what is the value of the smallest label? [u]Round 2[/u] [b]p4.[/b] Adam cooks a pie in the shape of a regular hexagon with side length $12$, and wants to cut it into right triangular pieces with angles $30^o$, $60^o$, and $90^o$, each with shortest side $3$. What is the maximum number of such pieces he can make? [b]p5.[/b] If $f(x) =\frac{1}{2-x}$ and $g(x) = 1-\frac{1}{x}$ , what is the value of $f(g(f(g(... f(g(f(2019))) ...))))$, where there are $2019$ functions total, counting both $f$ and $g$? [b]p6.[/b] Fhomas is buying spaghetti again, which is only sold in two types of boxes: a $200$ gram box and a $500$ gram box, each with a fixed price. If Fhomas wants to buy exactly $800$ grams, he must spend $\$8:80$, but if he wants to buy exactly 900 grams, he only needs to spend $\$7:90$! In dollars, how much more does the $500$ gram box cost than the $200$ gram box? [u]Round 3[/u] [b]p7.[/b] Given that $$\begin{cases} a + 5b + 9c = 1 \\ 4a + 2b + 3c = 2 \\ 7a + 8b + 6c = 9\end{cases}$$ what is $741a + 825b + 639c$? [b]p8.[/b] Hexagon $JAMESU$ has line of symmetry $MU$ (i.e., quadrilaterals $JAMU$ and $SEMU$ are reflections of each other), and $JA = AM = ME = ES = 1$. If all angles of $JAMESU$ are $135$ degrees except for right angles at $A$ and $E$, find the length of side $US$. [b]p9.[/b] Max is parked at the $11$ mile mark on a highway, when his pet cheetah, Min, leaps out of the car and starts running up the highway at its maximum speed. At the same time, Max starts his car and starts driving down the highway at $\frac12$ his maximum speed, driving all the way to the $10$ mile mark before realizing that his cheetah is gone! Max then immediately reverses directions and starts driving back up the highway at his maximum speed, nally catching up to Min at the $20$ mile mark. What is the ratio between Max's max speed and Min's max speed? [u]Round 4[/u] [b]p10.[/b] Kevin owns three non-adjacent square plots of land, each with side length an integer number of meters, whose total area is $2019$ m$^2$. What is the minimum sum of the perimeters of his three plots, in meters? [b]p11.[/b] Given a $5\times 5$ array of lattice points, how many squares are there with vertices all lying on these points? [b]p12.[/b] Let right triangle $ABC$ have $\angle A = 90^o$, $AB = 6$, and $AC = 8$. Let points $D,E$ be on side $AC$ such that $AD = EC = 2$, and let points $F,G$ be on side $BC$ such that $BF = FG = 3$. Find the area of quadrilateral $FGED$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949413p26408203]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $n$ MOPpers $p_1,...,p_n$ designing a carpool system to attend their morning class. Each $p_i$'s car fits $\chi (p_i)$ people ($\chi : \{p_1,...,p_n\} \to \{1,2,...,n\}$). A $c$-fair carpool system is an assignment of one or more drivers on each of several days, such that each MOPper drives $c$ times, and all cars are full on each day. (More precisely, it is a sequence of sets $(S_1, ...,S_m)$ such that $|\{k: p_i\in S_k\}|=c$ and $\sum_{x\in S_j} \chi(x) = n$ for all $i,j$. ) Suppose it turns out that a $2$-fair carpool system is possible but not a $1$-fair carpool system. Must $n$ be even? [i]Proposed by Nathan Ramesh and Palmer Mebane

Each integer has been colored in one of three colors. Prove that exist two different numbers of the same color, whose difference is a perfect square.

i) Show there exist (not necessarily distinct) non-negative real numbers $a_1,a_2,\ldots,a_{10}$; $b_1,b_2,\ldots,b_{10}$, with $a_k+b_k \leq 4$ for all $1\leq k \leq 10$, such that $\max\{|a_i-a_j|, |b_i-b_j|\} \geq \dfrac{4}{3} > 1$ for all $1\leq i < j \leq 10$. ii) Prove for any (not necessarily distinct) non-negative real numbers $a_1,a_2,\ldots,a_{11}$; $b_1,b_2,\ldots,b_{11}$, with $a_k+b_k \leq 4$ for all $1\leq k \leq 11$, there exist $1\leq i < j \leq 11$ such that $\max\{|a_i-a_j|, |b_i-b_j|\} \leq 1$. ([i]Dan Schwarz[/i])

Consider on the coordinate plane all rectangles whose (i) vertices have integer coordinates; (ii) edges are parallel to coordinate axes; (iii) area is $2^k$, where $k = 0,1,2....$ Is it possible to color all points with integer coordinates in two colors so that no such rectangle has all its vertices of the same color?

A convex polygon is divided into some triangles. Let $V$ and $E$ be respectively the set of vertices and the set of egdes of all triangles (each vertex in $V$ may be some vertex of the polygon or some point inside the polygon). The polygon is said to be [i]good [/i] if the following conditions hold: i. There are no $3$ vertices in $V$ which are collinear. ii. Each vertex in $V$ belongs to an even number of edges in $E$. Find all good polygon.

Red, blue, and green children are arranged in a circle. When a teacher asked the red children that have a green neighbor to raise their hands, $20$ children raised their hands. When she asked the blue children that have a green neighbor to raise their hands, $25$ children raised their hands. Prove that some child that raised her hand had two green neighbors.

On the board, the numbers from $1$ to $n$ are written. Achka (A) and Bavachka (B) play the following game. First, A erases one number, then B erases two consecutive numbers, then A erases three consecutive numbers, and finally B erases four consecutive numbers. What is the smallest $n$ such that B can definitely make her moves, no matter how A plays?

Let $n$ be an even positive integer. There are $n$ real numbers written on the blackboard. In every step, we choose two numbers, erase them, and replace each of them with their product. Show that for any initial $n$-tuple it is possible to obtain $n$ equal numbers on the blackboard after a finite number of steps.

A random permutation $a = (a_1, a_2,...,a_{40})$ of $(1, 2,...,40)$ is chosen, with all permutations being equally likely. William writes down a $20 \times 20$ grid of numbers $b_{ij}$ such that $b_{ij} = \max (a_i, a_{j+20})$ for all $1 \le i, j \le 20$, but then forgets the original permutation $a$. Compute the probability that, given the values of $b_{ij}$ alone, there are exactly $2$ permutations $a$ consistent with the grid.

A sequence composed by $0$s and $1$s has at most two consecutive $0$s. How many sequences of length $10$ exist?

What greatest number of triples of points can be selected from $1955$ given points, so that each two triples have one common point?

Using cardboard equilateral triangles of side length $1$, an equilateral triangle of side length $2^{2004}$ is formed. An equilateral triangle of side $1$ whose center coincides with the center of the large triangle is removed. Determine if it is possible to completely cover the remaining surface, without overlaps or holes, using only pieces in the shape of an isosceles trapezoid, each of which is created by joining three equilateral triangles of side $1$.

Let be a sequence of $ 51 $ natural numbers whose sum is $ 100. $ Show that for any natural number $ 1\le k<100 $ there are some consecutive numbers from this sequence whose sum is $ k $ or $ 100-k. $

Wendy eats sushi for lunch. She wants to eat six pieces of sushi arranged in a $23$ rectangular grid, but sushi is sticky, and Wendy can only eat a piece if it is adjacent to (not counting diagonally) at most two other pieces. In how many orders can Wendy eat the six pieces of sushi, assuming that the pieces of sushi are distinguishable?

The plan considers $51$ points of integer coordinates, so that the distances between any two points are natural numbers. Show that at least $49\%$ of the distances are even.

Three persons $A,B,C$, are playing the following game: A $k$-element subset of the set $\{1, . . . , 1986\}$ is randomly chosen, with an equal probability of each choice, where $k$ is a fixed positive integer less than or equal to $1986$. The winner is $A,B$ or $C$, respectively, if the sum of the chosen numbers leaves a remainder of $0, 1$, or $2$ when divided by $3$. For what values of $k$ is this game a fair one? (A game is fair if the three outcomes are equally probable.)

a) $101$ numbers are selected from the set $1, 2, . . . , 200$. Prove that among the numbers selected there is a pair in which one number is divisible by the other. b) One number less than $16$, and $99$ other numbers are selected from the set $1, 2, . . . , 200$. Prove that among the selected numbers there are two such that one divides the other.

Consider a sequence of equilateral triangles $T_{n}$ as represented below: [asy] defaultpen(linewidth(0.8));size(350); real r=sqrt(3); path p=origin--(2,0)--(1,sqrt(3))--cycle; int i,j,k; for(i=1; i<5; i=i+1) { for(j=0; j<i; j=j+1) { for(k=0; k<j; k=k+1) { draw(shift(5*i-5+(i-2)*(i-1)*1,0)*shift(2(j-k)+k, k*r)*p); }}}[/asy] The length of the side of the smallest triangles is $1$. A triangle is called a delta if its vertex is at the top; for example, there are $10$ deltas in $T_{3}$. A delta is said to be perfect if the length of its side is even. How many perfect deltas are there in $T_{20}$?

Six decks of $n$ cards, numbered from $1$ to $n$, are given. Melanie arranges each of the decks in some order, such that for any distinct numbers $x$, $y$, and $z$ in $\{1, 2, . . . , n\}$, there is exactly one deck where card $x$ is above card $y$ and card $y$ is above card $z$. Show that there is some $n$ for which Melanie cannot arrange these six decks of cards with this property.

Consider the following $3\times 2$ array formed by using the numbers $1,2,3,4,5,6$, $$\begin{pmatrix} a_{11}& a_{12}\\a_{21}& a_{22}\\ a_{31}& a_{32}\end{pmatrix}=\begin{pmatrix}1& 6\\2& 5\\ 3& 4\end{pmatrix}.$$ Observe that all row sums are equal, but the sum of the square of the squares is not the same for each row. Extend the above array to a $3\times k$ array $(a_{ij})_{3\times k}$ for a suitable $k$, adding more columns, using the numbers $7,8,9,\dots ,3k$ such that $$\sum_{j=1}^k a_{1j}=\sum_{j=1}^k a_{2j}=\sum_{j=1}^k a_{3j}~~\text{and}~~\sum_{j=1}^k (a_{1j})^2=\sum_{j=1}^k (a_{2j})^2=\sum_{j=1}^k (a_{3j})^2$$

Within a group of $ 2009$ people, every two people has exactly one common friend. Find the least value of the difference between the person with maximum number of friends and the person with minimum number of friends.

There are $16$ cities in a certain kingdom. The king wants to have a system of roads constructed so that one can go along those roads from any city to any other one without going through more than one intermediate city and so that no more than $5$ roads go out of any city. (a) Prove that this is possible. (b) Prove that if we replace the number $5$ by the number $4$ in the statement of the problem the king’s desire will become unrealizable. (D. Fomin, Leningrad)