[b]p1.[/b] A [i]multimagic [/i] square is a $3 \times 3$ array of distinct positive integers with the property that the product of the $3$ numbers in each row, each column, and each of the two diagonals of the array is always the same. (a) Prove that the numbers $1, 2, 3, . . . , 9$ cannot be used to form a multimagic square. (b) Give an example of a multimagic square. [b]p2.[/b] A sequence $a_1, a_2, a_3, ... , a_n$ of real numbers is called an arithmetic progression if $$a_1 - a_2 = a_2 - a_3 = ... = a_{n-1} - a_n.$$ Prove that there exist distinct positive integers $n_1, n_2, n_3, ... , n_{2014}$ such that $$\frac{1}{n_1},\frac{1}{n_2}, ... ,\frac{1}{n_{2014}}$$ is an arithmetic progression. [b]p3.[/b] Let $\lfloor x \rfloor$ be the largest integer that is less than or equal to $x$. For example, $\lfloor 3.9 \rfloor = 3$ and $\lfloor 4\rfloor = 4$. Determine (with proof) all real solutions of the equation $$x^2 - 25 \lfloor x\rfloor + 100 = 0.$$ [b]p4.[/b] An army has $10$ cannons and $8$ carts. Each cart can carry at most one cannon. It takes one day for a cart to cross the desert. What is the least number of days that it takes to get the cannons across the desert? (Cannons can be left part way and picked up later during the procedure.) Prove that the amount of time that your solution requires to move the cannons across the desert is the smallest possible. [b]p5.[/b] Let $C$ be a convex polygon with $4031$ sides. Let $p$ be the length of its perimeter and let $d$ be the sum of the lengths of its diagonals. Show that $$\frac{d}{p}> 2014.$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Justin throws a standard six-sided die three times in a row and notes the number of dots on the top face after each roll. How many different sequences of outcomes could he get?

Let $p_n$ denote the probability that, in $n$ tosses, a fair coin shows the head up $100$ consecutive times. Prove that the sequence $(p_n)$ converges and determine its limit.

Can the numbers $1,2,3,\ldots,100$ be covered with $12$ geometric progressions? [i]A. Golovanov[/i]

For a positive integer $n$, let $f(n)$ be the integer formed by reversing the digits of $n$ (and removing any leading zeroes). For example $f(14172)=27141$. Define a sequence of numbers $\{a_n\}_{n\ge 0}$ by $a_0=1$ and for all $i\ge 0$, $a_{i+1}=11a_i$ or $a_{i+1}=f(a_i)$ . How many possible values are there for $a_8$? [i]Proposed by James Lin[/i]

Show that there is no infinite sequence of primes $p_1, p_2, p_3, . . .$ there any for each $ k$: $p_{k+1} = 2p_k - 1$ or $p_{k+1} = 2p_k + 1$ is fulfilled. Note that not the same formula for every $k$.

Let $A_n$ be the set of all sequences with length $n$ and members of the set $\{1,2…q\}$. We denote with $B_n$ a subset of $A_n$ with a minimal number of elements with the following property: For each sequence $a_1,a_2,...,a_n$ from $A_n$ there exist a sequence $b_1,b_2,...,b_n$ from $B_n$ such that $a_i\neq b_i$ for each $i=1,2,....,n$. Prove that, if $q>n$, then $|B_n |=n+1$.

[u]Round 5[/u] [b]p13.[/b] A unit square is rotated $30^o$ counterclockwise about one of its vertices. Determine the area of the intersection of the original square with the rotated one. [b]p14.[/b] Suppose points $A$ and $B$ lie on a circle of radius $4$ with center $O$, such that $\angle AOB = 90^o$. The perpendicular bisectors of segments $OA$ and $OB$ divide the interior of the circle into four regions. Find the area of the smallest region. [b]p15.[/b] Let $ABCD$ be a quadrilateral such that $AB = 4$, $BC = 6$, $CD = 5$, $DA = 3$, and $\angle DAB = 90^o$. There is a point $I$ inside the quadrilateral that is equidistant from all the sides. Find $AI$. [u]Round 6[/u] [i]The answer to each of the three questions in this round depends on the answer to one of the other questions. There is only one set of correct answers to these problems; however, each question will be scored independently, regardless of whether the answers to the other questions are correct. [/i] [b]p16.[/b] Let $C$ be the answer to problem $18$. Compute $$\left( 1 - \frac{1}{2^2} \right) \left( 1 - \frac{1}{3^2} \right) ... \left( 1 - \frac{1}{C^2} \right).$$ [b]p17.[/b] Let $A$ be the answer to problem $16$. Let $PQRS$ be a square, and let point $M$ lie on segment $PQ$ such that $MQ = 7PM$ and point $N$ lie on segment $PS$ such that $NS = 7PN$. Segments $MS$ and $NQ$ meet at point $X$. Given that the area of quadrilateral $PMXN$ is $A - \frac12$, find the side length of the square. [b]p18.[/b] Let $B$ be the answer to problem $17$ and let $N = 6B$. Find the number of ordered triples $(a, b, c)$ of integers between $0$ and $N - 1$, inclusive, such that $a + b + c$ is divisible by $N$. [u]Round 7[/u] [b]p19.[/b] Let $k$ be the units digit of $\underbrace{7^{7^{7^{7^{7^{7^{7}}}}}}}_{Seven \,\,7s}$ . What is the largest prime factor of the number consisting of $k$ $7$’s written in a row? [b]p20.[/b] Suppose that $E = 7^7$ , $M = 7$, and $C = 7·7·7$. The characters $E, M, C, C$ are arranged randomly in the following blanks. $$... \times ... \times ... \times ... $$ Then one of the multiplication signs is chosen at random and changed to an equals sign. What is the probability that the resulting equation is true? [b]p21[/b]. During a recent math contest, Sophy Moore made the mistake of thinking that $133$ is a prime number. Fresh Mann replied, “To test whether a number is divisible by $3$, we just need to check whether the sum of the digits is divisible by $3$. By the same reasoning, to test whether a number is divisible by $7$, we just need to check that the sum of the digits is a multiple of $7$, so $133$ is clearly divisible by $7$.” Although his general principle is false, $133$ is indeed divisible by $7$. How many three-digit numbers are divisible by $7$ and have the sum of their digits divisible by $7$? [u]Round 8[/u] [b]p22.[/b] A [i]look-and-say[/i] sequence is defined as follows: starting from an initial term $a_1$, each subsequent term $a_k$ is found by reading the digits of $a_{k-1}$ from left to right and specifying the number of times each digit appears consecutively. For example, $4$ would be succeeded by $14$ (“One four.”), and $31337$ would be followed by $13112317$ (“One three, one one, two three, one seven.”) If $a_1$ is a random two-digit positive integer, find the probability that $a_4$ is at least six digits long. [b]p23.[/b] In triangle $ABC$, $\angle C = 90^o$. Point $P$ lies on segment $BC$ and is not $B$ or $C$. Point $I$ lies on segment $AP$, and $\angle BIP = \angle PBI = \angle CAB$. If $\frac{AP}{BC} = k$, express $\frac{IP}{CP}$ in terms of $k$. [b]p24.[/b] A subset of $\{1, 2, 3, ... , 30\}$ is called [i]delicious [/i] if it does not contain an element that is $3$ times another element. A subset is called super delicious if it is delicious and no delicious set has more elements than it has. Determine the number of super delicious subsets. PS. You sholud use hide for answers. First rounds have been posted [url=https://artofproblemsolving.com/community/c4h2784267p24464980]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider the sequence of integer such that: $ a_1 = 2$ $ a_2 = 5$ $ a_{n + 1} = (2 - n^2)a_n + (2 + n^2)a_{n - 1}, \forall n\ge 2$ Find all triplies $ (x,y,z) \in \mathbb{N}^3$ such that $ a_xa_y = a_z$.

Let $f(x)=x^n+a_1x^{n-1}+\ldots+a_n~(n\ge3)$ be a polynomial with real coefficients and $n$ real roots, such that $\frac{a_{n-1}}{a_n}>n+1$. Prove that if $a_{n-2}=0$, then at least one root of $f(x)$ lies in the open interval $\left(-\frac12,\frac1{n+1}\right)$.

A sequence $\{a_i\}$ is given such that $a_1 = \frac13$ and for all positive integers $n$ $$a_{n+1} =\frac{a^2_n}{a^2_n - a_n + 1}.$$ Prove that $$\frac12 - \frac{1}{3^{2^{n-1}}} < a_1 + a_2 +... + a_n <\frac12 - \frac{1}{3^{2^n}} ,$$ for all positive integers $n$.

Find a sequence of positive integers $f(n)$ ($n \in \mathbb{N}$) such that: (i) $f(n) \leq n^8$ for any $n \geq 2$; (ii) for any distinct $a_1, \cdots, a_k, n$, $f(n) \neq f(a_1) + \cdots+ f(a_k)$.

Let $D\subseteq \mathbb{C}$ be a compact set with at least two elements and consider the space $\Omega=\bigtimes_{i=1}^{\infty} D$ with the product topology. For any sequence $(d_n)_{n=0}^{\infty} \in \Omega$ let $f_{(d_n)}(z)=\sum_{n=0}^{\infty}d_nz^n$, and for each point $\zeta \in \mathbb{C}$ with $|\zeta|=1$ we define $S=S(\zeta,(d_n))$ to be the set of complex numbers $w$ for which there exists a sequence $(z_k)$ such that $|z_k|<1$, $z_k \to \zeta$, and $f_{d_n}(z_k) \to w$. Prove that on a residual set of $\Omega$, the set $S$ does not depend on the choice of $\zeta$.

Given three infinite arithmetic progressions of natural numbers such that each of the numbers 1,2,3,4,5,6,7 and 8 belongs to at least one of them, prove that the number 1980 also belongs to at least one of them.

Let $n$ be a positive integer and let $(x_1,\ldots,x_n)$, $(y_1,\ldots,y_n)$ be two sequences of positive real numbers. Suppose $(z_2,\ldots,z_{2n})$ is a sequence of positive real numbers such that $z_{i+j}^2 \geq x_iy_j$ for all $1\le i,j \leq n$. Let $M=\max\{z_2,\ldots,z_{2n}\}$. Prove that \[ \left( \frac{M+z_2+\dots+z_{2n}}{2n} \right)^2 \ge \left( \frac{x_1+\dots+x_n}{n} \right) \left( \frac{y_1+\dots+y_n}{n} \right). \] [hide="comment"] [i]Edited by Orl.[/i] [/hide] [i]Proposed by Reid Barton, USA[/i]