How many ways to fill the board $ 4\times 4$ by nonnegative integers, such that sum of the numbers of each row and each column is 3?

For any finite non empty set $X$ of integers, let $\max (X)$ denote the largest element of $X$ and $|X|$ denote the number of elements in $X$. If $N$ is the number of ordered pairs $(A, B)$ of finite non-empty sets of positive integers, such that $$ \begin{aligned} & \max (A) \times|B|=12 ; \text { and } \\ & |A| \times \max (B)=11 \end{aligned} $$ and $N$ can be written as $100 a+b$ where $a, b$ are positive integers less than 100 , find $a+b$.

$m,n$ are given integer numbers such that $m+n$ is an odd number. Edges of a complete bipartie graph $K_{m,n}$ are labeled by ${-1,1}$ such that the sum of all labels is $0$. Prove that there exists a spanning tree such that the sum of the labels of its edges is equal to $0$.

The plane is divided into unit cells, and each of the cells is painted in one of two given colors. Find the minimum possible number of cells in a figure consisting of entire cells which contains each of the $16$ possible colored $2\times2$ squares.

$3m$ balls numbered $1, 1, 1, 2, 2, 2, 3, 3, 3, \ldots, m, m, m$ are distributed into $8$ boxes so that any two boxes contain identical balls. Find the minimal possible value of $m$.

Let $N$ be a positive integer, and consider an $N \times N$ grid. A [i]right-down path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell below the previous cell in the sequence. A [i]right-up path[/i] is a sequence of grid cells such that each cell is either one cell to the right of or one cell above the previous cell in the sequence. Prove that the cells of the $N \times N$ grid cannot be partitioned into less than $N$ right-down or right-up paths. For example, the following partition of the $5 \times 5$ grid uses $5$ paths. [asy] size(4cm); draw((5,-1)--(0,-1)--(0,-2)--(5,-2)--(5,-3)--(0,-3)--(0,-4)--(5,-4),gray+linewidth(0.5)+miterjoin); draw((1,-5)--(1,0)--(2,0)--(2,-5)--(3,-5)--(3,0)--(4,0)--(4,-5),gray+linewidth(0.5)+miterjoin); draw((0,0)--(5,0)--(5,-5)--(0,-5)--cycle,black+linewidth(2.5)+miterjoin); draw((0,-1)--(3,-1)--(3,-2)--(1,-2)--(1,-4)--(4,-4)--(4,-3)--(2,-3)--(2,-2),black+linewidth(2.5)+miterjoin); draw((3,0)--(3,-1),black+linewidth(2.5)+miterjoin); draw((1,-4)--(1,-5),black+linewidth(2.5)+miterjoin); draw((4,-3)--(4,-1)--(5,-1),black+linewidth(2.5)+miterjoin); [/asy] [i]Proposed by Zixiang Zhou, Canada[/i]

There is a ruble coin in each cell of the board with $2\times 200$. Dasha and Sonya play, taking turns making moves, Dasha starts. In one move, it is allowed to select any coin and move it: Dasha moves the coin to a diagonally adjacent cell, Sonya is to the side adjacent. If two coins end up in the same cell, one of them is immediately removed from the board and goes to Sonya. Sonya can stop the game at any time and take all the coins she has received. What is the biggest win she can get, no matter how she plays Dasha? [i]A. Kuznetsov[/i]

[u]Round 5[/u] [b]p13.[/b] Given that $x^3 + y^3 = 208$ and $x + y = 4$, what is the value of $\frac{1}{x} +\frac{1}{y}$? [b]p14.[/b] Find the sum of all three-digit integers $n$ such that the value of $n$ is equal to the sum of the factorials of $n$’s digits. [b]p15.[/b] Three christmas lights are initially off. The Grinch decides to fiddle around with the lights, switching one of the lights each second. He wishes to get every possible combination of lights. After how many seconds can the Grinch complete his task? [u]Round 6[/u] [b]p16.[/b] A regular tetrahedron of side length $1$ has four similar tetrahedrons of side length $1/2$ chopped off, one from each of the four vertices. What is the sum of the numbers of vertices, edges, and faces of the remaining solid? [b]p17.[/b] Mario serves a pie in the shape of a regular $2013$-gon. To make each slice, he must cut in a straight line starting from one vertex and ending at another vertex of the pie. Every vertex of a slice must be a vertex of the original $2013$-gon. If every person eats at least one slice of pie regardless of the size, what is the maximum number of people the $2013$-gon pie can feed? [b]p18.[/b] Find the largest integer $x$ such that $x^2 + 1$ divides $x^3 + x - 1000$. [u]Round 7[/u] [b]p19.[/b] In $\vartriangle ABC$, $\angle B = 87^o$, $\angle C = 29^o$, and $AC = 37$. The perpendicular bisector of $\overline{BC}$ meets $\overline{AC}$ at point $T$. What is the value of $AB + BT$? [b]p20.[/b] Consider the sequence $f(1) = 1$, $f(2) = \frac12$ ,$ f(3) =\frac{1+3}{2}$, $f(4) =\frac{ 1+3}{2+4}$ ,$ f(5) = \frac{ 1+3+5}{2+4} . . . $ What is the minimum value of $n$, with $n > 1$, such that $|f(n) - 1| \le \frac{1}{10 }$. [b]p21.[/b] Three unit circles are centered at $(0, 0)$,$(0, 2)$, and $(2, 0)$. A line is drawn passing through $(0, 1)$ such that the region inside the circles and above the line has the same area as the region inside the circles and below the line. What is the equation of this line in $y = mx + b$ form? [u]Round 8[/u] [b]p22.[/b] The two walls of a pinball machine are positioned at a $45$ degree angle to each other. A pinball, represented by a point, is fired at a wall (but not at the intersection of the two walls). What is the maximum number of times the ball can bounce off the walls? [b]p23.[/b] Albert is fooling people with his weighted coin at a carnival. He asks his guests to guess how many times heads will show up if he flips the coin $4$ times. Richard decides to play the game and guesses that heads will show up $2$ times. In the previous game, Zach guessed that the heads would show up 3 times. In Zach’s game, there were least 3 heads, and given this information, Zach had a $\frac49$ chance of winning. What is the probability that Richard guessescorrectly? [b]p24.[/b] Let $S$ be the set of all positive integers relatively prime to $2013$ that have no prime factor greater than $15$. Find the sum of the reciprocals of all of the elements of $S$. PS. You should use hide for answers.Rounds 1-4 are [url=https://artofproblemsolving.com/community/c3h3134546p28406927]here[/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3137069p28442224]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Peter and Basil play the following game on a horizontal table $1\times{2019}$. Initially Peter chooses $n$ positive integers and writes them on a board. After that Basil puts a coin in one of the cells. Then at each move, Peter announces a number s among the numbers written on the board, and Basil needs to shift the coin by $s$ cells, if it is possible: either to the left, or to the right, by his decision. In case it is not possible to shift the coin by $s$ cells neither to the left, nor to the right, the coin stays in the current cell. Find the least $n$ such that Peter can play so that the coin will visit all the cells, regardless of the way Basil plays.

Let $n$ be an positive integer. Find the smallest integer $k$ with the following property; Given any real numbers $a_1 , \cdots , a_d $ such that $a_1 + a_2 + \cdots + a_d = n$ and $0 \le a_i \le 1$ for $i=1,2,\cdots ,d$, it is possible to partition these numbers into $k$ groups (some of which may be empty) such that the sum of the numbers in each group is at most $1$.

Some of the $n + 1$ cities in a country (including the capital city) are connected by one-way or two-way airlines. No two cities are connected by both a one-way airline and a two-way airline, but there may be more than one two-way airline between two cities. If $d_A$ denotes the number of airlines from a city $A$, then $d_A \le n$ for any city $A$ other than the capital city and $d_A + d_B \le n$ for any two cities $A$ and $B$ other than the capital city which are not connected by a two-way airline. Every airline has a return, possibly consisting of several connected flights. Find the largest possible number of two-way airlines and all configurations of airlines for which this largest number is attained.

A child lines up $2020^2$ pieces of bricks in a row, and then remove bricks whose positions are square numbers (i.e. the 1st, 4th, 9th, 16th, ... bricks). Then he lines up the remaining bricks again and remove those that are in a 'square position'. This process is repeated until the number of bricks remaining drops below $250$. How many bricks remain in the end?

For a sequence of $10$ coin flips, each pair of consecutive flips and count the number of “Heads-Heads”, “Heads-Tails”, “Tails-Heads”, and “Tails-Tails” sequences is recorded. These four numbers are then multiplied to get the [i]Tiger number[/i] of the sequence of flips. How many such sequences have a [i]Tiger number [/i] of $24$?

How many integers are there in $\{0,1, 2,..., 2014\}$ such that $C^x_{2014} \ge C^{999}{2014}$ ? (A): $15$, (B): $16$, (C): $17$, (D): $18$, (E) None of the above. Note: $C^{m}_{n}$ stands for $\binom {m}{n}$

Let $p$ be a prime number and let $X$ be a finite set containing at least $p$ elements. A collection of pairwise mutually disjoint $p$-element subsets of $X$ is called a $p$-family. (In particular, the empty collection is a $p$-family.) Let $A$(respectively, $B$) denote the number of $p$-families having an even (respectively, odd) number of $p$-element subsets of $X$. Prove that $A$ and $B$ differ by a multiple of $p$.

[b]p1.[/b] Find $20 \cdot 18 + 20 + 18 + 1$. [b]p2.[/b] Suzie’s Ice Cream has $10$ flavors of ice cream, $5$ types of cones, and $5$ toppings to choose from. An ice cream cone consists of one flavor, one cone, and one topping. How many ways are there for Sebastian to order an ice cream cone from Suzie’s? [b]p3.[/b] Let $a = 7$ and $b = 77$. Find $\frac{(2ab)^2}{(a+b)^2-(a-b)^2}$ . [b]p4.[/b] Sebastian invests $100,000$ dollars. On the first day, the value of his investment falls by $20$ percent. On the second day, it increases by $25$ percent. On the third day, it falls by $25$ percent. On the fourth day, it increases by $60$ percent. How many dollars is his investment worth by the end of the fourth day? [b]p5.[/b] Square $ABCD$ has side length $5$. Points $K,L,M,N$ are on segments $AB$,$BC$,$CD$,$DA$ respectively,such that $MC = CL = 2$ and $NA = AK = 1$. The area of trapezoid $KLMN$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Suppose that $p$ and $q$ are prime numbers. If $p + q = 30$, find the sum of all possible values of $pq$. [b]p7.[/b] Tori receives a $15 - 20 - 25$ right triangle. She cuts the triangle into two pieces along the altitude to the side of length $25$. What is the difference between the areas of the two pieces? [b]p8.[/b] The factorial of a positive integer $n$, denoted $n!$, is the product of all the positive integers less than or equal to $n$. For example, $1! = 1$ and $5! = 120$. Let $m!$ and $n!$ be the smallest and largest factorial ending in exactly $3$ zeroes, respectively. Find $m + n$. [b]p9.[/b] Sam is late to class, which is located at point $B$. He begins his walk at point $A$ and is only allowed to walk on the grid lines. He wants to get to his destination quickly; how many paths are there that minimize his walking distance? [img]https://cdn.artofproblemsolving.com/attachments/a/5/764e64ac315c950367357a1a8658b08abd635b.png[/img] [b]p10.[/b] Mr. Iyer owns a set of $6$ antique marbles, where $1$ is red, $2$ are yellow, and $3$ are blue. Unfortunately, he has randomly lost two of the marbles. His granddaughter starts drawing the remaining $4$ out of a bag without replacement. She draws a yellow marble, then the red marble. Suppose that the probability that the next marble she draws is blue is equal to $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positiveintegers. What is $m + n$? [b]p11.[/b] If $a$ is a positive integer, what is the largest integer that will always be a factor of $(a^3+1)(a^3+2)(a^3+3)$? [b]p12.[/b] What is the largest prime number that is a factor of $160,401$? [b]p13.[/b] For how many integers $m$ does the equation $x^2 + mx + 2018 = 0$ have no real solutions in $x$? [b]p14.[/b] What is the largest palindrome that can be expressed as the product of two two-digit numbers? A palindrome is a positive integer that has the same value when its digits are reversed. An example of a palindrome is $7887887$. [b]p15.[/b] In circle $\omega$ inscribe quadrilateral $ADBC$ such that $AB \perp CD$. Let $E$ be the intersection of diagonals $AB$ and $CD$, and suppose that $EC = 3$, $ED = 4$, and $EB = 2$. If the radius of $\omega$ is $r$, then $r^2 =\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Determine $m + n$. [b]p16.[/b] Suppose that $a, b, c$ are nonzero real numbers such that $2a^2 + 5b^2 + 45c^2 = 4ab + 6bc + 12ca$. Find the value of $\frac{9(a + b + c)^3}{5abc}$ . [b]p17.[/b] Call a positive integer n spicy if there exist n distinct integers $k_1, k_2, ... , k_n$ such that the following two conditions hold: $\bullet$ $|k_1| + |k_2| +... + |k_n| = n2$, $\bullet$ $k_1 + k_2 + ...+ k_n = 0$. Determine the number of spicy integers less than $10^6$. [b]p18.[/b] Consider the system of equations $$|x^2 - y^2 - 4x + 4y| = 4$$ $$|x^2 + y^2 - 4x - 4y| = 4.$$ Find the sum of all $x$ and $y$ that satisfy the system. [b]p19.[/b] Determine the number of $8$ letter sequences, consisting only of the letters $W,Q,N$, in which none of the sequences $WW$, $QQQ$, or $NNNN$ appear. For example, $WQQNNNQQ$ is a valid sequence, while $WWWQNQNQ$ is not. [b]p20.[/b] Triangle $\vartriangle ABC$ has $AB = 7$, $CA = 8$, and $BC = 9$. Let the reflections of $A,B,C$ over the orthocenter H be $A'$,$B'$,$C'$. The area of the intersection of triangles $ABC$ and $A'B'C'$ can be expressed in the form $\frac{a\sqrt{b}}{c}$ , where $b$ is squarefree and $a$ and $c$ are relatively prime. determine $a+b+c$. (The orthocenter of a triangle is the intersection of its three altitudes.) PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

In [i]Terra Brasilis[/i] there are $n$ houses where $n$ goblins live, each in a house. There are one-way routes such that: - each route joins two houses, - in each house exactly one route begins, - in each house exactly one route ends. If a route goes from house $A$ to house $B$, then we will say that house $B$ is next to house $A$. This relationship is not symmetric, that is: in this situation, not necessarily house $A$ is next to house $B$. Every day, from day $1$, each goblin leaves the house where he is and arrives at the next house. A legend of [i]Terra Brasilis[/i] says that when all the goblins return to the original position, the world will end. a) Show that the world will end. b) If $n = 98$, show that it is possible for elves to build and guide the routes so that the world does not end before $300,000$ years.

Prove that there are two numbers $u$ and $v$, between any $101$ real numbers that apply $100 |u - v| \cdot |1 - uv| \le (1 + u^2)(1 + v^2)$

a) We are playing the following game on this table: In each move we select a row or a column of the table, reduce two neighboring numbers in that row or column by $1$ and increase the third one by $1$. After some of these moves can we get to a table with all the same entries? b) This time we have the choice to arrange the integers from $1$ to $9$ in the$ 3 \times3$ table. Still using the same moves now our aim is to create a table with all the same entries, maximising the value of the entries. What is the highest possible number we can achieve?

How many 6-tuples $ (a_1,a_2,a_3,a_4,a_5,a_6)$ are there such that each of $ a_1,a_2,a_3,a_4,a_5,a_6$ is from the set $ \{1,2,3,4\}$ and the six expressions \[ a_j^2 \minus{} a_ja_{j \plus{} 1} \plus{} a_{j \plus{} 1}^2\] for $ j \equal{} 1,2,3,4,5,6$ (where $ a_7$ is to be taken as $ a_1$) are all equal to one another?

The number 2013 is written on a blackboard. Two players participate, alternating in turns, in the next game. A movement consists in changing the number that is on the board for the difference of this number and one of its divisors. The player who writes a zero loses. Which of the two players can guarantee victory?

Among a set of $32$ coins , all identical in appearance, $30$ are real and $2$ are fake. Any two real coins have the same weight . The fake coins have the same weight , which is different from the weight of a real coin. How can one divide the coins into two groups of equal total weight by using a balance at most $4$ times? (A Shapovalov)

For any nonempty set of integers $X$, define the function $$f(X) = \frac{(-1)^{|X|}}{ \left(\prod_{k\in X} k \right)^2}$$ where $|X|$ denotes the number of elements in $X$. Consider the set $S = \{2, 3, . . . , 13\}$ . Note that $1$ is not an element of $S$. Compute $$\sum_{T\subseteq S, T \ne \emptyset} f(T).$$ where the sum is taken over all nonempty subsets $T$ of $S$.

For $2n$ positive integers a matching (i.e. dividing them into $n$ pairs) is called {\it non-square} if the product of two numbers in each pair is not a perfect square. Prove that if there is a non-square matching, then there are at least $n!$ non-square matchings. (By $n!$ denote the product $1\cdot 2\cdot 3\cdot \ldots \cdot n$.)

A graph $G(V,E)$ is triangle-free, but adding any edges to the graph will form a triangle. It's given that $|V|=2019$, $|E|>2018$, find the minimum of $|E|$ .