When rolling a certain unfair six-sided die with faces numbered $1, 2, 3, 4, 5$, and $6$, the probability of obtaining face $F$ is greater than $\frac{1}{6}$, the probability of obtaining the face opposite is less than $\frac{1}{6}$, the probability of obtaining any one of the other four faces is $\frac{1}{6}$, and the sum of the numbers on opposite faces is $7$. When two such dice are rolled, the probability of obtaining a sum of $7$ is $\frac{47}{288}$. Given that the probability of obtaining face $F$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Suppose that $a_0, a_1, \cdots $ and $b_0, b_1, \cdots$ are two sequences of positive integers such that $a_0, b_0 \ge 2$ and \[ a_{n+1} = \gcd{(a_n, b_n)} + 1, \qquad b_{n+1} = \operatorname{lcm}{(a_n, b_n)} - 1. \] Show that the sequence $a_n$ is eventually periodic; in other words, there exist integers $N \ge 0$ and $t > 0$ such that $a_{n+t} = a_n$ for all $n \ge N$.

Let $n>k \geq 1$ be integers and let $p$ be a prime dividing $\tbinom{n}{k}$. Prove that the $k$-element subsets of $\{1,\ldots,n\}$ can be split into $p$ classes of equal size, such that any two subsets with the same sum of elements belong to the same class. [i]Ankan Bhattacharya[/i]

Let $N$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$, and let $M$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3 + 1\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$. Prove that $N >M.$

For a set $A$ of integers, define $f(A)=\{x^2+xy+y^2: x,y\in A\}$. Is there a constant $c$ such that for all positive integers $n$, there exists a set $A$ of size $n$ such that $|f(A)|\le cn$? [i]David Yang.[/i]

Let $g(n)$ be the number of all $n$-digit natural numbers each consisting only of digits $0,1,2,3$ (but not nessesarily all of them) such that the sum of no two neighbouring digits equals $2$. Determine whether $g(2010)$ and $g(2011)$ are divisible by $11$. I.Kozlov

For which prime numbers $p$ and $q$ is $(p+1)^q$ a perfect square?

Find all positive integers $n\geq1$ such that there exists a pair $(a,b)$ of positive integers, such that $a^2+b+3$ is not divisible by the cube of any prime, and $$n=\frac{ab+3b+8}{a^2+b+3}.$$

Find all triples $(p, q, r)$ of prime numbers for which $4q - 1$ is a prime number and $$\frac{p + q}{p + r} = r - p$$ holds. [i](Walther Janous)[/i]

Let $n$ be a positive integer and $p$ a fixed prime. We have a deck of $n$ cards, numbered $1,\ 2,\ldots,\ n$ and $p$ boxes for put the cards on them. Determine all posible integers $n$ for which is possible to distribute the cards in the boxes in such a way the sum of the numbers of the cards in each box is the same.

From each set $ \{a_1,a_2,...,a_7\} \subset Z$ one can choose a number of elements whose sum is a multiple of $7$.

Let $n$ be an arbitrary positive integer. (a) For every positive integers $a$ and $b$, show that $gcd(n^a + 1, n^b + 1) \le n^{gcd(a,b)} + 1$. (b) Show that there exist infinitely many composite pairs ($a, b)$, such that each of them is not a multiply of the other number and equality holds in (a).

[b]p1.[/b] Farmer John wants to bring some cows to a pasture with grass that grows at a constant rate. Initially, the pasture has some nonzero amount of grass and it will stop growing if there is no grass left. The pasture sustains $100$ cows for ten days. The pasture can also sustain $100$ cows for five days, and then $120$ cows for three more days. If cows eat at a constant rate, fund the maximum number of cows Farmer John can bring to the pasture so that they can be sustained indefinitely. [b]p2.[/b] Sam is learning basic arithmetic. He may place either the operation $+$ or $-$ in each of the blank spots between the numbers below: $$5\,\, \_ \,\, 8\,\, \_ \,\,9\,\, \_ \,\,7\,\,\_ \,\,2\,\,\_ \,\,3$$ In how many ways can he place the operations so the result is divisible by $3$? [b]p3.[/b] Will loves the color blue, but he despises the color red. In the $5\times 6$ rectangular grid below, how many rectangles are there containing at most one red square and with sides contained in the gridlines? [img]https://cdn.artofproblemsolving.com/attachments/1/7/7ce55bdc9e05c7c514dddc7f8194f3031b93c4.png[/img] [b]p4.[/b] Let $r_1, r_2, r_3$ be the three roots of a cubic polynomial $P(x)$. Suppose that $$\frac{P(2) + P(-2)}{P(0)}= 200.$$ If $\frac{1}{r_1r_2}+ \frac{1}{r_2r_3}+\frac{1}{r_3r_1}= \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m + n$. [b]p5.[/b] Consider a rectangle $ABCD$ with $AB = 3$ and $BC = 1$. Let $O$ be the intersection of diagonals $AC$ and $BD$. Suppose that the circumcircle of $ \vartriangle ADO$ intersects line $AB$ again at $E \ne A$. Then, the length $BE$ can be written as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Find $m + n$. [b]p6.[/b] Let $ABCD$ be a square with side length $100$ and $M$ be the midpoint of side $AB$. The circle with center $M$ and radius $50$ intersects the circle with center $D$ and radius $100$ at point $E$. $CE$ intersects $AB$ at $F$. If $AF = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $m + n$. [b]p7.[/b] How many pairs of real numbers $(x, y)$, with $0 < x, y < 1$ satisfy the property that both $3x + 5y$ and $5x + 2y$ are integers? [b]p8.[/b] Sebastian is coloring a circular spinner with $4$ congruent sections. He randomly chooses one of four colors for each of the sections. If two or more adjacent sections have the same color, he fuses them and considers them as one section. (Sections meeting at only one point are not adjacent.) Suppose that the expected number of sections in the final colored spinner is equal to $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$. Compute $m + n$. [b]p9.[/b] Let $ABC$ be a triangle and $D$ be a point on the extension of segment $BC$ past $C$. Let the line through $A$ perpendicular to $BC$ be $\ell$. The line through $B$ perpendicular to $AD$ and the line through $C$ perpendicular to $AD$ intersect $\ell$ at $H_1$ and $H_2$, respectively. If $AB = 13$, $BC = 14$, $CA = 15$, and $H_1H_2 = 1001$, find $CD$. [b]p10.[/b] Find the sum of all positive integers $k$ such that $$\frac21 -\frac{3}{2 \times 1}+\frac{4}{3\times 2\times 1} + ...+ (-1)^{k+1} \frac{k+1}{k\times (k - 1)\times ... \times 2\times 1} \ge 1 + \frac{1}{700^3}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]p1.[/b] Find the largest possible number of consecutive $9$’s in which an integer between $10,000,000$ and $13,371,337$ can end. For example, $199$ ends in two $9$’s, while $92,999$ ends in three $9$’s. [b]p2.[/b] Let $ABCD$ be a square of side length $2$. Equilateral triangles $ABP$, $BCQ$, $CDR$, and $DAS$ are constructed inside the square. Compute the area of quadrilateral $PQRS$. [b]p3.[/b] Evaluate the expression $7 \cdot 11 \cdot 13 \cdot 1003 - 3 \cdot 17 \cdot 59 \cdot 331$. [b]p4.[/b] Compute the number of positive integers $c$ such that there is a non-degenerate obtuse triangle with side lengths $21$, $29$, and $c$. [b]p5.[/b] Consider a $5\times 5$ board, colored like a chessboard, such that the four corners are black. Determine the number of ways to place $5$ rooks on black squares such that no two of the rooks attack one another, given that the rooks are indistinguishable and the board cannot be rotated. (Two rooks attack each other if they are in the same row or column.) [b]p6.[/b] Let $ABCD$ be a trapezoid of height $6$ with bases $AB$ and $CD$. Suppose that $AB = 2$ and $CD = 3$, and let $F$ and $G$ be the midpoints of segments $AD$ and $BC$, respectively. If diagonals $AC$ and $BD$ intersect at point $E$, compute the area of triangle $FGE$. [b]p7.[/b] A regular octahedron is a solid with eight faces that are congruent equilateral triangles. Suppose that an ant is at the center of one face of a regular octahedron of edge length $10$. The ant wants to walk along the surface of the octahedron to reach the center of the opposite face. (Two faces of an octahedron are said to be opposite if they do not share a vertex.) Determine the minimum possible distance that the ant must walk. [b]p8.[/b] Let $A_1A_2A_3$, $B_1B_2B_3$, $C_1C_2C_3$, and $D_1D_2D_3$ be triangles in the plane. All the sides of the four triangles are extended into lines. Determine the maximum number of pairs of these lines that can meet at $60^o$ angles. [b]p9.[/b] For an integer $n$, let $f_n(x)$ denote the function $f_n(x) =\sqrt{x^2 - 2012x + n}+1006$. Determine all positive integers $a$ such that $f_a(f_{2012}(x)) = x$ for all $x \ge 2012$. [b]p10.[/b] Determine the number of ordered triples of integers $(a, b, c)$ such that $(a + b)(b + c)(c + a) = 1800$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[u]Round 1[/u] [b]p1.[/b] In a chemical lab there are three vials: one that can hold $1$ oz of fluid, another that can hold $2$ oz, and a third that can hold $3$ oz. The first is filled with grape juice, the second with sulfuric acid, and the third with water. There are also $3$ empty vials in the cupboard, also of sizes $1$ oz, $2$ oz, and $3$ oz. In order to save the world with grape-flavored acid, James Bond must make three full bottles, one of each size, filled with a mixture of all three liquids so that each bottle has the same ratio of juice to acid to water. How can he do this, considering he was silly enough not to bring any equipment? [b]p2.[/b] Twelve people, some are knights and some are knaves, are sitting around a table. Knaves always lie and knights always tell the truth. At some point they start up a conversation. The first person says, “There are no knights around this table.” The second says, “There is at most one knight at this table.” The third – “There are at most two knights at the table.” And so on until the $12$th says, “There are at most eleven knights at the table.” How many knights are at the table? Justify your answer. [b]p3.[/b] Aquaman has a barrel divided up into six sections, and he has placed a red herring in each. Aquaman can command any fish of his choice to either ‘jump counterclockwise to the next sector’ or ‘jump clockwise to the next sector.’ Using a sequence of exactly $30$ of these commands, can he relocate all the red herrings to one sector? If yes, show how. If no, explain why not. [img]https://cdn.artofproblemsolving.com/attachments/0/f/956f64e346bae82dee5cbd1326b0d1789100f3.png[/img] [b]p4.[/b] Is it possible to place $13$ integers around a circle so that the sum of any $3$ adjacent numbers is exactly $13$? [b]p5.[/b] Two girls are playing a game. The first player writes the letters $A$ or $B$ in a row, left to right, adding one letter on her turn. The second player switches any two letters after each move by the first player (the letters do not have to be adjacent), or does nothing, which also counts as a move. The game is over when each player has made $2011$ moves. Can the second player plan her moves so that the resulting letters form a palindrome? (A palindrome is a sequence that reads the same forward and backwards, e.g. $AABABAA$.) [u]Round 2[/u] [b]p6.[/b] Eight students participated in a math competition. There were eight problems to solve. Each problem was solved by exactly five people. Show that there are two students who solved all eight problems between them. [b]p7.[/b] There are $3n$ checkers of three different colors: $n$ red, $n$ green and $n$ blue. They were used to randomly fill a board with $3$ rows and $n$ columns so that each square of the board has one checker on it. Prove that it is possible to reshuffle the checkers within each row so that in each column there are checkers of all three colors. Moving checkers to a different row is not allowed. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The table size $8 \times 8$ contains the numbers $1,2,...,8$ in each amount as much as you want provided that two numbers that are adjacent vertically, horizontally, diagonally are relative primes. Prove that some number appears in the table at least $12$ times. [i](PP-nine)[/i]

Find the smallest natural number $n$ for which the number $n^2-n+11$ has exactly four prime factors (not necessarily distinct).

Given integers $0 < a_1 < a_2 <... < a_{101} < 5050$, prove that one can always choose for different numbers $a_k,a_l,a_m,a_n$ such that $5050 | a_k +a_l -a_m -a_n$

For a positive integer $n$, denote by $\tau (n)$ the number of its positive divisors. For a positive integer $n$, if $\tau (m) < \tau (n)$ for all $m < n$, we call $n$ a good number. Prove that for any positive integer $k$, there are only finitely many good numbers not divisible by $k$.

Let $n\geq2$ be a positive integer, with divisors $1=d_1<d_2<\,\ldots<d_k=n$. Prove that $d_1d_2+d_2d_3+\,\ldots\,+d_{k-1}d_k$ is always less than $n^2$, and determine when it is a divisor of $n^2$.

Tita the Frog sits on the number line. She is initially on the integer number $k>1$. If she is sitting on the number $n$, she hops to the number $f(n)+g(n)$, where $f(n)$ and $g(n)$ are, respectively, the biggest and smallest positive prime numbers that divide $n$. Find all values of $k$ such that Tita can hop to infinitely many distinct integers.

The prime numbers $a,b$ and $c$ are such that $a+b^2=4c^2$. Determine the sum of all possible values of $a+b+c$.

Let $n$ be a natural number and $p, q$ be prime numbers such that the following statements hold: $$pq | n^p + 2$$ $$n + 2 | n^p + q^p.$$ Show that there is a natural number $m$ such that $q|4^mn + 2$ holds.

Find all polynomials $f\in \mathbb{Z}[X]$ such that if $p$ is prime then $f(p)$ is also prime.

For some positive integers $m,n$, the system $x+y^2 = m$ and $x^2+y = n$ has exactly one integral solution $(x,y)$. Determine all possible values of $m-n$.