Let $m$, $n$ be two positive integers greater than 3. Consider the table of size $m\times n$ ($m$ rows and $n$ columns) formed with unit squares. We are putting marbles into unit squares of the table following the instructions: $-$ each time put 4 marbles into 4 unit squares (1 marble per square) such that the 4 unit squares formes one of the followings 4 pictures (click [url=http://www.mathlinks.ro/Forum/download.php?id=4425]here[/url] to view the pictures). In each of the following cases, answer with justification to the following question: Is it possible that after a finite number of steps we can set the marbles into all of the unit squares such that the numbers of marbles in each unit square is the same? a) $m=2004$, $n=2006$; b) $m=2005$, $n=2006$.

Cities $P_1,...,P_{1025}$ are connected to each other by airlines $A_1,...,A_{10}$ so that for any two distinct cities $P_k$ and $P_m$ there is an airline offering a direct flight between them. Prove that one of the airlines can offer a round trip with an odd number of flights.

Each vertex of a cube is assigned $1$ or $-1$. Each face is assigned the product of the four numbers at its vertices. Determine all possible values that can be obtained as the sum of all the $14$ assigned numbers.

Suppose that each of $n$ people knows exactly one piece of information and all $n$ pieces are different. Every time person $A$ phones person $B$, $A$ tells $B$ everything he knows, while tells $A$ nothing. What is the minimum of phone calls between pairs of people needed for everyone to know everything?

A lottery ticket is a choice of $5$ distinct numbers from $1, 2,3,...,90$. Suppose that $5^5$ distinct lottery tickets are such that any two of them have a common number. Prove that one can find four numbers such that every ticket contains at least one of the four.

[u]Round 1[/u] [b]1.1.[/b] There are $99$ dogs sitting in a long line. Starting with the third dog in the line, if every third dog barks three times, and all the other dogs each bark once, how many barks are there in total? [b]1.2.[/b] Indigo notices that when she uses her lucky pencil, her test scores are always $66 \frac23 \%$ higher than when she uses normal pencils. What percent lower is her test score when using a normal pencil than her test score when using her lucky pencil? [b]1.3.[/b] Bill has a farm with deer, sheep, and apple trees. He mostly enjoys looking after his apple trees, but somehow, the deer and sheep always want to eat the trees' leaves, so Bill decides to build a fence around his trees. The $60$ trees are arranged in a $5\times 12$ rectangular array with $5$ feet between each pair of adjacent trees. If the rectangular fence is constructed $6$ feet away from the array of trees, what is the area the fence encompasses in feet squared? (Ignore the width of the trees.) [u]Round 2[/u] [b]2.1.[/b] If $x + 3y = 2$, then what is the value of the expression $9^x * 729^y$? [b]2.2.[/b] Lazy Sheep loves sleeping in, but unfortunately, he has school two days a week. If Lazy Sheep wakes up each day before school's starting time with probability $1/8$ independent of previous days, then the probability that Lazy Sheep wakes up late on at least one school day over a given week is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]2.3.[/b] An integer $n$ leaves remainder $1$ when divided by $4$. Find the sum of the possible remainders $n$ leaves when divided by $20$. [u]Round 3[/u] [b]3.1. [/b]Jake has a circular knob with three settings that can freely rotate. Each minute, he rotates the knob $120^o$ clockwise or counterclockwise at random. The probability that the knob is back in its original state after $4$ minutes is $p/q$ for relatively prime positive integers $p, q$. Find $p + q$. [b]3.2.[/b] Given that $3$ not necessarily distinct primes $p, q, r$ satisfy $p+6q +2r = 60$, find the sum of all possible values of $p + q + r$. [b]3.3.[/b] Dexter's favorite number is the positive integer $x$, If $15x$ has an even number of proper divisors, what is the smallest possible value of $x$? (Note: A proper divisor of a positive integer is a divisor other than itself.) [u]Round 4[/u] [b]4.1.[/b] Three circles of radius $1$ are each tangent to the other two circles. A fourth circle is externally tangent to all three circles. The radius of the fourth circle can be expressed as $\frac{a\sqrt{b}-\sqrt{c}}{d}$ for positive integers $a, b, c, d$ where $b$ is not divisible by the square of any prime and $a$ and $d$ are relatively prime. Find $a + b + c + d$. [b]4.2. [/b]Evaluate $$\frac{\sqrt{15}}{3} \cdot \frac{\sqrt{35}}{5} \cdot \frac{\sqrt{63}}{7}... \cdot \frac{\sqrt{5475}}{73}$$ [b]4.3.[/b] For any positive integer $n$, let $f(n)$ denote the number of digits in its base $10$ representation, and let $g(n)$ denote the number of digits in its base $4$ representation. For how many $n$ is $g(n)$ an integer multiple of $f(n)$? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784571p24468619]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

All the numbers $1,2,...,9$ are written in the cells of a $3\times 3$ table (exactly one number in a cell) . Per move it is allowed to choose an arbitrary $2\times2$ square of the table and either decrease by $1$ or increase by $1$ all four numbers of the square. After some number of such moves all numbers of the table become equal to some number $a$. Find all possible values of $a$. I.Voronovich

Show that every subset of {1,2,...,99,100} with 55 elements contains at least 2 numbers with a difference of 9.

Let $n$ be a positive integer. In an $n\times4$ table, each row is equal to \[\begin{tabular}{| c | c | c | c |} \hline 2 & 0 & 1 & 0 \\ \hline \end{tabular}\] A [i]change[/i] is taking three consecutive boxes in the same row with different digits in them and changing the digits in these boxes as follows: \[0\to1\text{, }1\to2\text{, }2\to0\text{.}\] For example, a row $\begin{tabular}{| c | c | c | c |}\hline 2 & 0 & 1 & 0 \\ \hline\end{tabular}$ can be changed to the row $\begin{tabular}{| c | c | c | c |}\hline 0 & 1 & 2 & 0 \\ \hline\end{tabular}$ but not to $\begin{tabular}{| c | c | c | c |}\hline 2 & 1 & 2 & 1 \\ \hline\end{tabular}$ because $0$, $1$, and $0$ are not distinct. Changes can be applied as often as wanted, even to items already changed. Show that for $n<12$, it is not possible to perform a finite number of changes so that the sum of the elements in each column is equal.

There are $n=1681$ children, $a_1,a_2,...,a_{n}$ seated clockwise in a circle on the floor. The teacher walks behind the children in the clockwise direction with a box of $1000$ candies. She drops a candy behind the first child $a_1$. She then skips one child and drops a candy behind the third child, $a_3$. Now she skips two children and drops a candy behind the next child, $a_6$. She continues this way, at each stage skipping one child more than at the preceding stage before dropping a candy behind the next child. How many children will never receive a candy? Justify your answer.

Any two vertices $A,B$ of a regular $n$-gon are connected by an oriented segment (i.e. either $A\to B$ or $B\to A$). Find the maximum possible number of quadruples $(A,B,C,D)$ of vertices such that $A\to B\to C\to D\to A$.

There are 300 apples, any two of which differ in weight by no more than three times. Prove that they can be arranged into bags of four apples each so that any two bags differ in weight by no more than than one and a half times.

A rectangle is drawn on checkered paper, the sides of which form angles of $45^o$ with the grid lines, and the vertices do not lie on the grid lines. Can an odd number of grid lines intersect each side of a rectangle?

[url=https://artofproblemsolving.com/community/c675547][b]Greece JBMO TST 2017[/b][/url] [url=http://artofproblemsolving.com/community/c6h1663730p10567608][b]Problem 1[/b][/url]. Positive real numbers $a,b,c$ satisfy $a+b+c=1$. Prove that $$(a+1)\sqrt{2a(1-a)} + (b+1)\sqrt{2b(1-b)} + (c+1)\sqrt{2c(1-c)} \geq 8(ab+bc+ca).$$ Also, find the values of $a,b,c$ for which the equality happens. [url=http://artofproblemsolving.com/community/c6h1663731p10567619][b]Problem 2[/b][/url]. Let $ABC$ be an acute-angled triangle inscribed in a circle $\mathcal C (O, R)$ and $F$ a point on the side $AB$ such that $AF < AB/2$. The circle $c_1(F, FA)$ intersects the line $OA$ at the point $A'$ and the circle $\mathcal C$ at $K$. Prove that the quadrilateral $BKFA'$ is cyclic and its circumcircle contains point $O$. [url=http://artofproblemsolving.com/community/c6h1663732p10567627][b]Problem 3[/b][/url]. Prove that for every positive integer $n$, the number $A_n = 7^{2n} -48n - 1$ is a multiple of $9$. [url=http://artofproblemsolving.com/community/c6h1663734p10567640][b]Problem 4[/b][/url]. Let $ABC$ be an equilateral triangle of side length $a$, and consider $D$, $E$ and $F$ the midpoints of the sides $(AB), (BC)$, and $(CA)$, respectively. Let $H$ be the the symmetrical of $D$ with respect to the line $BC$. Color the points $A, B, C, D, E, F, H$ with one of the two colors, red and blue. [list=1] [*] How many equilateral triangles with all the vertices in the set $\{A, B, C, D, E, F, H\}$ are there? [*] Prove that if points $B$ and $E$ are painted with the same color, then for any coloring of the remaining points there is an equilateral triangle with vertices in the set $\{A, B, C, D, E, F, H\}$ and having the same color. [*] Does the conclusion of the second part remain valid if $B$ is blue and $E$ is red? [/list]

Prove that from a set of ten distinct two-digit numbers, it is always possible to find two disjoint subsets whose members have the same sum.

Is there a circle which passes through five points with integer co-ordinates?

In the diagram shown, how many pathways are there from point $A$ to point $B$ if you are only allowed to travel due East, Southeast, or Southwest? [img]https://cdn.artofproblemsolving.com/attachments/9/1/0a1219fb430c402fef4b7555ddff7c88fec47e.jpg[/img]

Let $M$ be a set of $13$ positive integers with the property that $\forall \ m\in M, \ 100\leq m\leq 999$. Prove that there exists a subset $S\subset M$ and a combination of arithmetic operations (addition, subtraction, multiplication, division – without using parentheses) between the elements of $S$, such that the value of the resulting expression is a rational number in the interval $(3,4)$.

We have placed $n>3$ cards around a circle, facing downwards. In one step we may perform the following operation with three consecutive cards. Calling the one on the center $B$, the two on the ends $A$ and $C$, we put card $C$ in the place of $A$, then move $A$ and $B$ to the places originally occupied by $B$ and $C$, respectively. Meanwhile, we flip the cards $A$ and $B$. Using a number of these steps, is it possible to move each card to its original place, but facing upwards?

Cells of $11\times 11$ table are colored with $n$ colors (each cell is colored with exactly one color). For each color, the total amount of the cells of this color is not less than $7$ and not greater than $13$. Prove that there exists at least one row or column which contains cells of at least four different colors. [i](N. Sedrakyan)[/i]

[b]p1.[/b] Fun facts! We know that $1008^2-1007^2 = 1008+1007$ and $1009^2-1008^2 = 1009+1008$. Now compute the following: $$1010^2 - 1009^2 - 1.$$ [b]p2.[/b] Let $m$ be the smallest positive multiple of $2018$ such that the fraction $m/2019$ can be simplified. What is the number $m$? [b]p3.[/b] Given that $n$ satisfies the following equation $$n + 3n + 5n + 7n + 9n = 200,$$ find $n$. [b]p4.[/b] Grace and Somya each have a collection of coins worth a dollar. Both Grace and Somya have quarters, dimes, nickels and pennies. Serena then observes that Grace has the least number of coins possible to make one dollar and Somya has the most number of coins possible. If Grace has $G$ coins and Somya has $S$ coins, what is $G + S$? [b]p5.[/b] What is the ones digit of $2018^{2018}$? [b]p6.[/b] Kaitlyn plays a number game. Each time when Kaitlyn has a number, if it is even, she divides it by $2$, and if it is odd, she multiplies it by $5$ and adds $1$. Kaitlyn then takes the resulting number and continues the process until she reaches $1$. For example, if she begins with $3$, she finds the sequence of $6$ numbers to be $$3, 3 \cdot 5 + 1 = 16, 16/2 = 8, 8/2 = 4, 4/2 = 2, 2/2 = 1.$$ If Kaitlyn's starting number is $51$, how many numbers are in her sequence, including the starting number and the number $1$? [b]p7.[/b] Andrew likes both geometry and piano. His piano has $88$ keys, $x$ of which are white and $y$ of which are black. Each white key has area $3$ and each black key has area $11$. If the keys of his piano have combined area $880$, how many black keys does he have? [b]p8.[/b] A six-sided die contains the numbers $1$, $2$, $3$, $4$, $5$, and $6$ on its faces. If numbers on opposite faces of a die always sum to $7$, how many distinct dice are possible? (Two dice are considered the same if one can be rotated to obtain the other.) [b]p9.[/b] In $\vartriangle ABC$, $AB$ is $12$ and $AC$ is $15$. Alex draws the angle bisector of $BAC$, $AD$, such that $D$ is on $BC$. If $CD$ is $10$, then the area of $\vartriangle ABC$ can be expressed in the form $\frac{m \sqrt{n}}{p}$ where $m, p$ are relatively prime and $n$ is not divisible by the square of any prime. Find $m + n + p$. [b]p10.[/b] Find the smallest positive integer that leaves a remainder of $2$ when divided by $5$, a remainder of $3$ when divided by $6$, a remainder of $4$ when divided by $7$, and a remainder of $5$ when divided by $8$. [b]p11.[/b] Chris has a bag with $4$ marbles. Each minute, Chris randomly selects a marble out of the bag and flips a coin. If the coin comes up heads, Chris puts the marble back in the bag, while if the coin comes up tails, Chris sets the marble aside. What is the expected number of seconds it will take Chris to empty the bag? [b]p12.[/b] A real fixed point $x$ of a function $f(x)$ is a real number such that $f(x) = x$. Find the absolute value of the product of the real fixed points of the function $f(x) = x^4 + x - 16$. [b]p13.[/b] A triangle with angles $30^o$, $75^o$, $75^o$ is inscribed in a circle with radius $1$. The area of the triangle can be expressed as $\frac{a+\sqrt{b}}{c}$ where $b$ is not divisible by the square of any prime. Find $a + b + c$. [b]p14.[/b] Dora and Charlotte are playing a game involving flipping coins. On a player's turn, she first chooses a probability of the coin landing heads between $\frac14$ and $\frac34$ , and the coin magically flips heads with that probability. The player then flips this coin until the coin lands heads, at which point her turn ends. The game ends the first time someone flips heads on an odd-numbered flip. The last player to flip the coin wins. If both players are playing optimally and Dora goes first, let the probability that Charlotte win the game be $\frac{a}{b}$ . Find $a \cdot b$. [b]p15.[/b] Jonny is trying to sort a list of numbers in ascending order by swapping pairs of numbers. For example, if he has the list $1$, $4$, $3$, $2$, Jonny would swap $2$ and $4$ to obtain $1$, $2$, $3$, $4$. If Jonny is given a random list of $400$ distinct numbers, let $x$ be the expected minimum number of swaps he needs. Compute $\left \lfloor \frac{x}{20} \right \rfloor$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Prove that there exists a four-coloring of the set $M = \{1, 2, \cdots, 1987\}$ such that any arithmetic progression with $10$ terms in the set $M$ is not monochromatic. [b][i]Alternative formulation[/i][/b] Let $M = \{1, 2, \cdots, 1987\}$. Prove that there is a function $f : M \to \{1, 2, 3, 4\}$ that is not constant on every set of $10$ terms from $M$ that form an arithmetic progression. [i]Proposed by Romania[/i]

Form the infinite graph $A$ by taking the set of primes $p$ congruent to $1\pmod{4}$, and connecting $p$ and $q$ if they are quadratic residues modulo each other. Do the same for a graph $B$ with the primes $1\pmod{8}$. Show $A$ and $B$ are isomorphic to each other. [i]Linus Hamilton.[/i]

There are $999$ black points marked on a circle, dividing it into $999$ arcs of length $1$. We need to place $d$ arcs of lengths $1, 2, \dots, d$ such that each arc starts and ends at two black points, and none of the $d$ arcs is contained within another. Find the maximum value of $d$ for which this construction is possible. [b]Note:[/b] Two arcs can have one or more black points in common.

A finite list of rational numbers is written on a blackboard. In an [i]operation[/i], we choose any two numbers $a$, $b$, erase them, and write down one of the numbers \[ a + b, \; a - b, \; b - a, \; a \times b, \; a/b \text{ (if $b \neq 0$)}, \; b/a \text{ (if $a \neq 0$)}. \] Prove that, for every integer $n > 100$, there are only finitely many integers $k \ge 0$, such that, starting from the list \[ k + 1, \; k + 2, \; \dots, \; k + n, \] it is possible to obtain, after $n - 1$ operations, the value $n!$.