[b]p1.[/b] What is $7\%$ of one half of $11\%$ of $20000$ ? [b]p2.[/b] Three circles centered at $A, B$, and $C$ are tangent to each other. Given that $AB = 8$, $AC = 10$, and $BC = 12$, find the radius of circle $ A$. [b]p3. [/b]How many positive integer values of $x$ less than $2012$ are there such that there exists an integer $y$ for which $\frac{1}{x} +\frac{2}{2y+1} =\frac{1}{y}$ ? [b]p4. [/b]The positive difference between $ 8$ and twice $x$ is equal to $11$ more than $x$. What are all possible values of $x$? [b]p5.[/b] A region in the coordinate plane is bounded by the equations $x = 0$, $x = 6$, $y = 0$, and $y = 8$. A line through $(3, 4)$ with slope $4$ cuts the region in half. Another line going through the same point cuts the region into fourths, each with the same area. What is the slope of this line? [b]p6.[/b] A polygon is composed of only angles of degrees $138$ and $150$, with at least one angle of each degree. How many sides does the polygon have? [b]p7.[/b] $M, A, T, H$, and $L$ are all not necessarily distinct digits, with $M \ne 0$ and $L \ne 0$. Given that the sum $MATH +LMT$, where each letter represents a digit, equals $2012$, what is the average of all possible values of the three-digit integer $LMT$? [b]p8. [/b]A square with side length $\sqrt{10}$ and two squares with side length $\sqrt{7}$ share the same center. The smaller squares are rotated so that all of their vertices are touching the sides of the larger square at distinct points. What is the distance between two such points that are on the same side of the larger square? [b]p9.[/b] Consider the sequence $2012, 12012, 20120, 20121, ...$. This sequence is the increasing sequence of all integers that contain “$2012$”. What is the $30$th term in this sequence? [b]p10.[/b] What is the coefficient of the $x^5$ term in the simplified expansion of $(x +\sqrt{x} +\sqrt[3]{x})^{10}$ ? PS. You had better use hide for answers.

Pavel and Sara roll two, fair six-sided dice (with faces labeled from $ 1$ to $6$) but do not look at the result. A third-party observer whispers the product of the face-up numbers to Pavel and the sum of the face-up numbers to Sara. Pavel and Sara are perfectly rational and truth-telling, and they both know this. Pavel says, “With the information I have, I am unable to deduce the sum of the two numbers rolled.” Sara responds, “Interesting! With the information I have, I am unable to deduce the product of the two numbers rolled.” Pavel responds, “Wow! I still cannot deduce the sum. But I’m sure you know the product by now!” What is the product?

Let $\sigma_n$ be a permutation of $\{1,\ldots,n\}$; that is, $\sigma_n(i)$ is a bijective function from $\{1,\ldots,n\}$ to itself. Define $f(\sigma)$ to be the number of times we need to apply $\sigma$ to the identity in order to get the identity back. For example, $f$ of the identity is just $1$, and all other permutations have $f(\sigma)>1$. What is the smallest $n$ such that there exists a $\sigma_n$ with $f(\sigma_n)=k$?

In a bag there are $1007$ black and $1007$ white balls, which are randomly numbered $1$ to $2014$. In every step we draw one ball and put it on the table; also if we want to, we may choose two different colored balls from the table and put them in a different bag. If we do that we earn points equal to the absolute value of their differences. How many points can we guarantee to earn after $2014$ steps?

Let $M$ be a finite subset of the plane such that for any two different points $A,B\in M$ there is a point $C\in M$ such that $ABC$ is equilateral. What is the maximal number of points in $M?$

Danielle divides a $30 \times30$ board into $100$ regions that are $3 \times 3$ squares squares each and then paint some squares black and the rest white. Then to each region assigns it the color that has the most squares painted with that color. a) If there are more black regions than white, what is the minimum number $N$ of cells that Danielle can paint black? b) In how many ways can Danielle paint the board if there are more black regions than white and she uses the minimum number $N$ of black squares?

Let $n \geq 2$ be a positive integer. Show that there are exactly $2^{n-3}n(n-1)$ $n$-tuples of integers $(a_1,a_2,\dots,a_n)$, which satisfy the conditions: (i) $a_1=0$; (ii) for each $m$, $2 \leq m \leq n$, there is an index in $m$, $1 \leq i_m <m$, such that $\left|a_{i_m}-a_m\right|\leq 1$; (iii) the $n$-tuple $(a_1,a_2,\dots,a_n)$ contains exactly $n-1$ different numbers.

[i]Round 5[/i] [b]p13.[/b] Kelvin Amphibian, a not-frog who lives on the coordinate plane, likes jumping around. Each step, he jumps either to the spot that is $1$ unit to the right and 2 units up, or the spot that is $2$ units to the right and $1$ unit up, from his current location. He chooses randomly among these two choices with equal probability. He starts at the origin and jumps for a long time. What is the probability that he lands on $(10, 8)$ at some time in his journey? [b]p14.[/b] Points $A, B, C$, and $D$ are randomly chosen on the circumference of a unit circle. What is the probability that line segments $AB$ and $CD$ intersect inside the circle? [b]p15.[/b] Let $P(x)$ be a quadratic polynomial with two consecutive integer roots. If it is also known that $\frac{P(2017)} {P(2016)} = \frac{2016}{2017}$ , find the larger root of $P(x)$. [u]Round 6[/u] [b]p16.[/b] Let $S_n$ be the sum of reciprocals of the integers between $1$ and $n$ inclusive. Find a triple $(a, b, c)$ of positive integers such that $S_{2017} \cdot S_{2017} - S_{2016} \cdot S_{2018} = \frac{S_a+S_b}{c}$ . [b]p17.[/b] Suppose that $m$ and $n$ are both positive integers. Alec has $m$ standard $6$-sided dice, each labelled $1$ to $6$ inclusive on the sides, while James has $n$ standard $12$-sided dice, each labelled $1$ to $12$ inclusive on the sides. They decide to play a game with their dice. They each toss all their dice simultaneously and then compute the sum of the numbers that come up on their dice. Whoever has a higher sum wins (if the sums are equal, they tie). Given that both players have an equal chance of winning, determine the minimum possible value of mn. [b]p18.[/b] Overlapping rectangles $ABCD$ and $BEDF$ are congruent to each other and both have area $1$. Given that $A,C,E, F$ are the vertices of a square, find the area of the square. [u]Round 7[/u] [b]p19.[/b] Find the number of solutions to the equation $$||| ... |||||x| + 1| - 2| + 3| - 4| +... - 98| + 99| - 100| = 0$$ [b]p20.[/b] A split of a positive integer in base $10$ is the separation of the integer into two nonnegative integers, allowing leading zeroes. For example, $2017$ can be split into $2$ and $017$ (or $17$), $20$ and $17$, or $201$ and $7$. A split is called squarish if both integers are nonzero perfect squares. $49$ and $169$ are the two smallest perfect squares that have a squarish split ($4$ and $9$, $16$ and $9$ respectively). Determine all other perfect squares less than $2017$ with at least one squarish split. [b]p21.[/b] Polynomial $f(x) = 2x^3 + 7x^2 - 3x + 5$ has zeroes $a, b$ and $c$. Cubic polynomial $g(x)$ with $x^3$-coefficient $1$ has zeroes $a^2$, $b^2$ and $c2$. Find the sum of coefficients of $g(x)$. [u]Round 8[/u] [b]p22.[/b] Two congruent circles, $\omega_1$ and $\omega_2$, intersect at points $A$ and $B$. The centers of $\omega_1$ and $\omega_2$ are $O_1$ and $O_2$ respectively. The arc $AB$ of $\omega_1$ that lies inside $\omega_2$ is trisected by points $P$ and $Q$, with the points lying in the order $A, P, Q,B$. Similarly, the arc $AB$ of $\omega_2$ that lies inside $\omega_1$ is trisected by points $R$ and $S$, with the points lying in the order $A,R, S,B$. Given that $PQ = 1$ and $PR =\sqrt2$, find the measure of $\angle AO_1B$ in degrees. [b]p23.[/b] How many ordered triples of $(a, b, c)$ of integers between $-10$ and $10$ inclusive satisfy the equation $-abc = (a + b)(b + c)(c + a)$? [b]p24.[/b] For positive integers $n$ and $b$ where $b > 1$, define $s_b(n)$ as the sum of digits in the base-$b$ representation of $n$. A positive integer $p$ is said to dominate another positive integer $q$ if for all positive integers $n$, $s_p(n)$ is greater than or equal to $s_q(n)$. Find the number of ordered pairs $(p, q)$ of distinct positive integers between $2$ and $100$ inclusive such that $p$ dominates $q$. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h2936487p26278546]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

An empire has a finite number of cities. Every two cities are connected by a natural number of roads . Every street connects exactly two cities. Show that you have the kingdom can be divided into a maximum of three republics so that within each republic there are just many streets run away. (We say a road runs within a republic if the two cities that it connects, both belonging to this republic. The republics must meet each other be disjoint, and cover all cities of the empire in total.) [hide=original wording in German]Ein Reich hat endlich viele St¨adte. Je zwei St¨adte sind durch eine natu¨rliche Anzahl von Straßen verbunden. Jede Straße verbindet genau zwei St¨adte. Man zeige, dass man das Reich so in h¨ochstens drei Republiken zerteilen kann, dass innerhalb jeder Republik gerade viele Straßen verlaufen. (Wir sagen, eine Straße verl¨auft innerhalb einer Republik, wenn die zwei St¨adte, die sie verbindet, beide dieser Republik angeh¨oren. Die Republiken mu¨ssen zueinander disjunkt sein, und insgesamt alle St¨adte des Reiches abdecken.)[/hide]

Determine all integers $n\geq 1$ for which the numbers $1,2,\ldots,n$ may be (re)ordered as $a_1,a_2,\ldots,a_n$ in such a way that the average $\dfrac {a_1+a_2+\cdots + a_k} {k}$ is an integer for all values $1\leq k\leq n$. (Dan Schwarz)

[b]p1.[/b] For positive real numbers $x, y$, the operation $\otimes$ is given by $x \otimes y =\sqrt{x^2 - y}$ and the operation $\oplus$ is given by $x \oplus y =\sqrt{x^2 + y}$. Compute $(((5\otimes 4)\oplus 3)\otimes2)\oplus 1$. [b]p2.[/b] Janabel is cutting up a pizza for a party. She knows there will either be $4$, $5$, or $6$ people at the party including herself, but can’t remember which. What is the least number of slices Janabel can cut her pizza to guarantee that everyone at the party will be able to eat an equal number of slices? [b]p3.[/b] If the numerator of a certain fraction is added to the numerator and the denominator, the result is $\frac{20}{19}$ . What is the fraction? [b]p4.[/b] Let trapezoid $ABCD$ be such that $AB \parallel CD$. Additionally, $AC = AD = 5$, $CD = 6$, and $AB = 3$. Find $BC$. [b]p5.[/b] AtMerrick’s Ice Cream Parlor, customers can order one of three flavors of ice cream and can have their ice cream in either a cup or a cone. Additionally, customers can choose any combination of the following three toppings: sprinkles, fudge, and cherries. How many ways are there to buy ice cream? [b]p6.[/b] Find the minimum possible value of the expression $|x+1|+|x-4|+|x-6|$. [b]p7.[/b] How many $3$ digit numbers have an even number of even digits? [b]p8.[/b] Given that the number $1a99b67$ is divisible by $7$, $9$, and $11$, what are $a$ and $b$? Express your answer as an ordered pair. [b]p9.[/b] Let $O$ be the center of a quarter circle with radius $1$ and arc $AB$ be the quarter of the circle’s circumference. Let $M$,$N$ be the midpoints of $AO$ and $BO$, respectively. Let $X$ be the intersection of $AN$ and $BM$. Find the area of the region enclosed by arc $AB$, $AX$,$BX$. [b]p10.[/b] Each square of a $5$-by-$1$ grid of squares is labeled with a digit between $0$ and $9$, inclusive, such that the sum of the numbers on any two adjacent squares is divisible by $3$. How many such labelings are possible if each digit can be used more than once? [b]p11.[/b] A two-digit number has the property that the difference between the number and the sum of its digits is divisible by the units digit. If the tens digit is $5$, how many different possible values of the units digit are there? [b]p12.[/b] There are $2019$ red balls and $2019$ white balls in a jar. One ball is drawn and replaced with a ball of the other color. The jar is then shaken and one ball is chosen. What is the probability that this ball is red? [b]p13.[/b] Let $ABCD$ be a square with side length $2$. Let $\ell$ denote the line perpendicular to diagonal $AC$ through point $C$, and let $E$ and $F$ be themidpoints of segments $BC$ and $CD$, respectively. Let lines $AE$ and $AF$ meet $\ell$ at points $X$ and $Y$ , respectively. Compute the area of $\vartriangle AXY$ . [b]p14.[/b] Express $\sqrt{21-6\sqrt6}+\sqrt{21+6\sqrt6}$ in simplest radical form. [b]p15.[/b] Let $\vartriangle ABC$ be an equilateral triangle with side length two. Let $D$ and $E$ be on $AB$ and $AC$ respectively such that $\angle ABE =\angle ACD = 15^o$. Find the length of $DE$. [b]p16.[/b] $2018$ ants walk on a line that is $1$ inch long. At integer time $t$ seconds, the ant with label $1 \le t \le 2018$ enters on the left side of the line and walks among the line at a speed of $\frac{1}{t}$ inches per second, until it reaches the right end and walks off. Determine the number of ants on the line when $t = 2019$ seconds. [b]p17.[/b] Determine the number of ordered tuples $(a_1,a_2,... ,a_5)$ of positive integers that satisfy $a_1 \le a_2 \le ... \le a_5 \le 5$. [b]p18.[/b] Find the sum of all positive integer values of $k$ for which the equation $$\gcd (n^2 -n -2019,n +1) = k$$ has a positive integer solution for $n$. [b]p19.[/b] Let $a_0 = 2$, $b_0 = 1$, and for $n \ge 0$, let $$a_{n+1} = 2a_n +b_n +1,$$ $$b_{n+1} = a_n +2b_n +1.$$ Find the remainder when $a_{2019}$ is divided by $100$. [b]p20.[/b] In $\vartriangle ABC$, let $AD$ be the angle bisector of $\angle BAC$ such that $D$ is on segment $BC$. Let $T$ be the intersection of ray $\overrightarrow{CB}$ and the line tangent to the circumcircle of $\vartriangle ABC$ at $A$. Given that $BD = 2$ and $TC = 10$, find the length of $AT$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Eight guests arrive to a hotel with four rooms. Each guest dislikes at most three other guests and doesn’t want to share a room with any of them (this feeling is mutual). Show that the guests can reside in the four rooms, with two persons in each room

A rabbit is placed on a $2n\times 2n$ chessboard. Every time the rabbit moves to one of the adjacent squares. (Adjacent means sharing an edge). It is known that the rabbit went through every square and came back to the place where the rabbit started, and the path of the rabbit form a polygon $\mathcal{P}$. Find the maximum possible number of the vertices of $\mathcal{P}$. For example the answer for the case $n=2$ would be $12$. [asy] /* Geogebra to Asymptote conversion, documentation at artofproblemsolving.com/Wiki go to User:Azjps/geogebra */ import graph; size(2cm); real labelscalefactor = 0.5; /* changes label-to-point distance */ pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); /* default pen style */ pen dotstyle = black; /* point style */ real xmin = -11.3, xmax = 27.16, ymin = -11.99, ymax = 10.79; /* image dimensions */ /* draw figures */ draw((5.14,3.19)--(8.43,3.22), linewidth(1)); draw((8.43,3.22)--(11.72,3.25), linewidth(1)); draw((11.72,3.25)--(11.75,-0.04), linewidth(1)); draw((11.75,-0.04)--(11.78,-3.33), linewidth(1)); draw((11.78,-3.33)--(8.49,-3.36), linewidth(1)); draw((8.49,-3.36)--(5.2,-3.39), linewidth(1)); draw((5.2,-3.39)--(5.17,-0.1), linewidth(1)); draw((5.17,-0.1)--(5.14,3.19), linewidth(1)); draw((6.785,3.205)--(6.845,-3.375), linewidth(1)); draw((8.43,3.22)--(8.49,-3.36), linewidth(1)); draw((10.075,3.235)--(10.135,-3.345), linewidth(1)); draw((5.155,1.545)--(11.735,1.605), linewidth(1)); draw((5.17,-0.1)--(11.75,-0.04), linewidth(1)); draw((11.765,-1.685)--(5.185,-1.745), linewidth(1)); draw((5.97,2.375)--(10.905,2.42), linewidth(1)); draw((10.905,2.42)--(10.92,0.775), linewidth(1)); draw((10.92,0.775)--(9.275,0.76), linewidth(1)); draw((9.275,0.76)--(9.29,-0.885), linewidth(1)); draw((9.29,-0.885)--(10.935,-0.87), linewidth(1)); draw((10.935,-0.87)--(10.95,-2.515), linewidth(1)); draw((10.95,-2.515)--(6.015,-2.56), linewidth(1)); draw((6.015,-2.56)--(6,-0.915), linewidth(1)); draw((6,-0.915)--(7.645,-0.9), linewidth(1)); draw((7.645,-0.9)--(7.63,0.745), linewidth(1)); draw((7.63,0.745)--(5.985,0.73), linewidth(1)); draw((5.985,0.73)--(5.97,2.375), linewidth(1)); /* dots and labels */ dot((5.97,2.375),linewidth(4pt) + dotstyle); dot((5.985,0.73),linewidth(4pt) + dotstyle); dot((6,-0.915),linewidth(4pt) + dotstyle); dot((6.015,-2.56),linewidth(4pt) + dotstyle); dot((7.645,-0.9),linewidth(4pt) + dotstyle); dot((7.63,0.745),linewidth(4pt) + dotstyle); dot((9.275,0.76),linewidth(4pt) + dotstyle); dot((9.29,-0.885),linewidth(4pt) + dotstyle); dot((10.95,-2.515),linewidth(4pt) + dotstyle); dot((10.935,-0.87),linewidth(4pt) + dotstyle); dot((10.92,0.775),linewidth(4pt) + dotstyle); dot((10.905,2.42),linewidth(4pt) + dotstyle); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); /* end of picture */ [/asy]

p1. One day, a researcher placed two groups of species that were different, namely amoeba and bacteria in the same medium, each in a certain amount (in unit cells). The researcher observed that on the next day, which is the second day, it turns out that every cell species divide into two cells. On the same day every cell amoeba prey on exactly one bacterial cell. The next observation carried out every day shows the same pattern, that is, each cell species divides into two cells and then each cell amoeba prey on exactly one bacterial cell. Observation on day $100$ shows that after each species divides and then each amoeba cell preys on exactly one bacterial cell, it turns out kill bacteria. Determine the ratio of the number of amoeba to the number of bacteria on the first day. p2. It is known that $n$ is a positive integer. Let $f(n)=\frac{4n+\sqrt{4n^2-1}}{\sqrt{2n+1}+\sqrt{2n-1}}$. Find $f(13) + f(14) + f(15) + ...+ f(112).$ p3. Budi arranges fourteen balls, each with a radius of $10$ cm. The first nine balls are placed on the table so that form a square and touch each other. The next four balls placed on top of the first nine balls so that they touch each other. The fourteenth ball is placed on top of the four balls, so that it touches the four balls. If Bambang has fifty five balls each also has a radius of $10$ cm and all the balls are arranged following the pattern of the arrangement of the balls made by Budi, calculate the height of the center of the topmost ball is measured from the table surface in the arrangement of the balls done by Bambang. p4. Given a triangle $ABC$ whose sides are $5$ cm, $ 8$ cm, and $\sqrt{41}$ cm. Find the maximum possible area of ​​the rectangle can be made in the triangle $ABC$. p5. There are $12$ people waiting in line to buy tickets to a show with the price of one ticket is $5,000.00$ Rp.. Known $5$ of them they only have $10,000$ Rp. in banknotes and the rest is only has a banknote of $5,000.00$ Rp. If the ticket seller initially only has $5,000.00$ Rp., what is the probability that the ticket seller have enough change to serve everyone according to their order in the queue?

The numbers $1,2,...,n$ ($n \ge 5$) are written on the circle in the clockwise order. Per move it is allowed to exchange any couple of consecutive numbers $a, b$ to the couple $\frac{a+b}{2}, \frac{a+b}{2}$. Is it possible to make all numbers equal using these operations?

[b]p1.[/b] Suppose $\frac{x}{y} = 0.\overline{ab}$ where $x$ and $y$ are relatively prime positive integers and $ab + a + b + 1$ is a multiple of $12$. Find the sum of all possible values of $y$. [b]p2.[/b] Let $A$ be the set of points $\{(0, 0), (2, 0), (0, 2),(2, 2),(3, 1),(1, 3)\}$. How many distinct circles pass through at least three points in $A$? [b]p3.[/b] Jack and Jill need to bring pails of water home. The river is the $x$-axis, Jack is initially at the point $(-5, 3)$, Jill is initially at the point $(6, 1)$, and their home is at the point $(0, h)$ where $h > 0$. If they take the shortest paths home given that each of them must make a stop at the river, they walk exactly the same total distance. What is $h$? [b]p4.[/b] What is the largest perfect square which is not a multiple of $10$ and which remains a perfect square if the ones and tens digits are replaced with zeroes? [b]p5.[/b] In convex polygon $P$, each internal angle measure (in degrees) is a distinct integer. What is the maximum possible number of sides $P$ could have? [b]p6.[/b] How many polynomials $p(x)$ of degree exactly $3$ with real coefficients satisfy $$p(0), p(1), p(2), p(3) \in \{0, 1, 2\}?$$ [b]p7.[/b] Six spheres, each with radius $4$, are resting on the ground. Their centers form a regular hexagon, and adjacent spheres are tangent. A seventh sphere, with radius $13$, rests on top of and is tangent to all six of these spheres. How high above the ground is the center of the seventh sphere? [b]p8.[/b] You have a paper square. You may fold it along any line of symmetry. (That is, the layers of paper must line up perfectly.) You then repeat this process using the folded piece of paper. If the direction of the folds does not matter, how many ways can you make exactly eight folds while following these rules? [b]p9.[/b] Quadrilateral $ABCD$ has $\overline{AB} = 40$, $\overline{CD} = 10$, $\overline{AD} = \overline{BC}$, $m\angle BAD = 20^o$, and $m \angle ABC = 70^o$. What is the area of quadrilateral $ABCD$? [b]p10.[/b] We say that a permutation $\sigma$ of the set $\{1, 2,..., n\}$ preserves divisibilty if $\sigma (a)$ divides $\sigma (b)$ whenever $a$ divides $b$. How many permutations of $\{1, 2,..., 40\}$ preserve divisibility? (A permutation of $\{1, 2,..., n\}$ is a function $\sigma$ from $\{1, 2,..., n\}$ to itself such that for any $b \in \{1, 2,..., n\}$, there exists some $a \in \{1, 2,..., n\}$ satisfying $\sigma (a) = b$.) [b]p11.[/b] In the diagram shown at right, how many ways are there to remove at least one edge so that some circle with an “A” and some circle with a “B” remain connected? [img]https://cdn.artofproblemsolving.com/attachments/8/7/fde209c63cc23f6d3482009cc6016c7cefc868.png[/img] [b]p12.[/b] Let $S$ be the set of the $125$ points in three-dimension space of the form $(x, y, z)$ where $x$, $y$, and $z$ are integers between $1$ and $5$, inclusive. A family of snakes lives at the point $(1, 1, 1)$, and one day they decide to move to the point $(5, 5, 5)$. Snakes may slither only in increments of $(1,0,0)$, $(0, 1, 0)$, and $(0, 0, 1)$. Given that at least one snake has slithered through each point of $S$ by the time the entire family has reached $(5, 5, 5)$, what is the smallest number of snakes that could be in the family? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A beetle crawls along the edges of an $n$-lateral pyramid, starting and ending at the midpoint $A$ of a base edge and passing through each point at most once. How many ways are there for the beetle to do this (two ways are said to be equal if they go through the same vertices)? Show that the sum of the numbers of passed vertices (over all these ways) equals $1^2 +2^2 +\ldots +n^2. $

Three boxes contain 600 balls each. The first box contains 600 identical red balls, the second box contains 600 identical white balls and the third box contains 600 identical blue balls. From these three boxes, 900 balls are chosen. In how many ways can the balls be chosen? For example, one can choose 250 red balls, 187 white balls and 463 balls, or one can choose 360 red balls and 540 blue balls.

$mn$ students all have different heights. They are arranged in $m > 1$ rows of $n > 1$. In each row select the shortest student and let $A$ be the height of the tallest such. In each column select the tallest student and let $B$ be the height of the shortest such. Which of the following are possible: $A < B$, $A = B$, $A > B$? If a relation is possible, can it always be realized by a suitable arrangement of the students?

We color one of the numbers $1,...,8$ with white or black according to the following rules: i) number $4$ gets colored white and one at lest of the following numbers gets colored black ii) if two numbers $a,b$ are colored in a different color and $a+b\le 8$, then number $a+b$ gets colored black. iii) if two numbers $a,b$ are colored in a different color and $a\cdot b\le 8$, then number $a\cdot b$ gets colored white. If by those rules, all numbers get colored, find the color of each number.

Let $F$ be the set of all $n$-tuples $(A_1, \ldots, A_n)$ such that each $A_{i}$ is a subset of $\{1, 2, \ldots, 1998\}$. Let $|A|$ denote the number of elements of the set $A$. Find \[ \sum_{(A_1, \ldots, A_n)\in F} |A_1\cup A_2\cup \cdots \cup A_n| \]

One of the numbers $1$ or $-1$ is assigned to each vertex of a cube. To each face of the cube is assigned the integer which is the product of the four integers at the vertices of the face. Is it possible that the sum of the $14$ assigned integers is $0$? (G. Galperin)

Let $n$ be a positive integer. Prove that the number of lines which go through the origin and precisely one other point with integer coordinates $(x,y),0\le x,y\le n$, is at least $\frac{n^2}{4}$.

[u]Round 1[/u] [b]p1.[/b] The alphabet of the Aau-Bau language consists of two letters: A and B. Two words have the same meaning if one of them can be constructed from the other by replacing any AA with A, replacing any BB with B, or by replacing any ABA with BAB. For example, the word AABA means the same thing as ABA, and AABA also means the same thing as ABAB. In this language, is it possible to name all seven days of the week? [b]p2.[/b] A museum has a $4\times 4$ grid of rooms. Every two rooms that share a wall are connected by a door. Each room contains some paintings. The total number of paintings along any path of $7$ rooms from the lower left to the upper right room is always the same. Furthermore, the total number of paintings along any path of $7$ rooms from the lower right to the upper left room is always the same. The guide states that the museum has exactly $500$ paintings. Show that the guide is mistaken. [img]https://cdn.artofproblemsolving.com/attachments/7/6/0fd93a0deaa71a5bb1599d2488f8b4eac5d0eb.jpg[/img] [b]p3.[/b] A playground has a swing-set with exactly three swings. When 3rd and 4th graders from Dr. Anna’s math class play during recess, she has a rule that if a $3^{rd}$ grader is in the middle swing there must be $4^{th}$ graders on that person’s left and right. And if there is a $4^{th}$ grader in the middle, there must be $3^{rd}$ graders on that person’s left and right. Dr. Anna calculates that there are $350$ different ways her students can arrange themselves on the three swings with no empty seats. How many students are in her class? [img]https://cdn.artofproblemsolving.com/attachments/5/9/4c402d143646582376d09ebbe54816b8799311.jpg[/img] [b]p4.[/b] The archipelago Artinagos has $19$ islands. Each island has toll bridges to at least $3$ other islands. An unsuspecting driver used a bad mapping app to plan a route from North Noether Island to South Noether Island, which involved crossing $12$ bridges. Show that there must be a route with fewer bridges. [img]https://cdn.artofproblemsolving.com/attachments/e/3/4eea2c16b201ff2ac732788fe9b78025004853.jpg[/img] [b]p5.[/b] Is it possible to place the numbers from $1$ to $121$ in an $11\times 11$ table so that numbers that differ by $1$ are in horizontally or vertically adjacent cells and all the perfect squares $(1, 4, 9, ... , 121)$ are in one column? [u]Round 2[/u] [b]p6.[/b] Hungry and Sneaky have opened a rectangular box of chocolates and are going to take turns eating them. The chocolates are arranged in a $2m \times 2n$ grid. Hungry can take any two chocolates that are side-by-side, but Sneaky can take only one at a time. If there are no more chocolates located side-by-side, all remaining chocolates go to Sneaky. Hungry goes first. Each player wants to eat as many chocolates as possible. What is the maximum number of chocolates Sneaky can get, no matter how Hungry picks his? [img]https://cdn.artofproblemsolving.com/attachments/b/4/26d7156ca6248385cb46c6e8054773592b24a3.jpg[/img] [b]p7.[/b] There is a thief hiding in the sultan’s palace. The palace contains $2019$ rooms connected by doors. One can walk from any room to any other room, possibly through other rooms, and there is only one way to do this. That is, one cannot walk in a loop in the palace. To catch the thief, a guard must be in the same room as the thief at the same time. Prove that $11$ guards can always find and catch the thief, no matter how the thief moves around during the search. [img]https://cdn.artofproblemsolving.com/attachments/a/b/9728ac271e84c4954935553c4d58b3ff4b194d.jpg[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The positive integer $n$ is given and for all positive integers $k$, $1\leq k\leq n$, denote by $a_{kn}$ the number of all ordered sequences $(i_1,i_2,\ldots,i_k)$ of positive integers which verify the following two conditions: a) $1\leq i_1<i_2< \cdots i_k \leq n$; b) $i_{r+1}-i_r \equiv 1 \pmod 2$, for all $r \in\{1,2,\ldots,k-1\}$. Compute the number $a(n) = \sum\limits_{k=1}^n a_{kn}$. [i]Ioan Tomescu[/i]