When the integer $ {\left(\sqrt{3} \plus{} 5\right)}^{103} \minus{} {\left(\sqrt{3} \minus{} 5\right)}^{103}$ is divided by 9, what is the remainder?

Show that it is possible to color the points of $\mathbb Q\times\mathbb Q$ in two colors in such a way that any two points having distance $1$ have distinct colors.

Define the function $f:(0,1)\to (0,1)$ by \[\displaystyle f(x) = \left\{ \begin{array}{lr} x+\frac 12 & \text{if}\ \ x < \frac 12\\ x^2 & \text{if}\ \ x \ge \frac 12 \end{array} \right.\] Let $a$ and $b$ be two real numbers such that $0 < a < b < 1$. We define the sequences $a_n$ and $b_n$ by $a_0 = a, b_0 = b$, and $a_n = f( a_{n -1})$, $b_n = f (b_{n -1} )$ for $n > 0$. Show that there exists a positive integer $n$ such that \[(a_n - a_{n-1})(b_n-b_{n-1})<0.\] [i]Proposed by Denmark[/i]

Show that there do not exist polynomials $p(x)$ and $q(x)$ each having integer coefficients and of degree greater than or equal to 1 such that \[ p(x)q(x) = x^5 +2x +1 . \]

Solve the equation \[(x+1)\log^2_{3}x+4x\log_{3}x-16=0\]

Find all possible values of $a\in \mathbb{R}$ and $n\in \mathbb{N^*}$ such that $f(x)=(x-1)^n+(x-2)^{2n+1}+(1-x^2)^{2n+1}+a$ is divisible by $\phi (x)=x^2-x+1$

Let $f$ be a bijection from $\mathbb N$ to itself. Prove that one can always find three natural number $a,b,c$ such that $a<b<c$ and $f(a)+f(c)=2f(b)$.

The reals $x, y$ satisfy $x(x-6)\leq y(4-y)+7$. Find the minimal and maximal values of the expression $x+2y$.

Let $$x_0 = 5\,\, ,\, \,\,x_{n+1} = x_n +\frac{1}{x_n}.$$ Prove that $45 < x_{1000} < 45.1$.

$ f(x)$ is a given polynomial whose degree at least 2. Define the following polynomial-sequence: $ g_1(x)\equal{}f(x), g_{n\plus{}1}(x)\equal{}f(g_n(x))$, for all $ n \in N$. Let $ r_n$ be the average of $ g_n(x)$'s roots. If $ r_{19}\equal{}99$, find $ r_{99}$.

Let $p=4k+3$ be a prime. Prove that if \[\dfrac {1} {0^2+1}+\dfrac{1}{1^2+1}+\cdots+\dfrac{1}{(p-1)^2+1}=\dfrac{m} {n}\] (where the fraction $\dfrac {m} {n}$ is in reduced terms), then $p \mid 2m-n$. [i]Proposed by A. Golovanov[/i]

Suppose that $a,b,c,d$ are positive real numbers satisfying $(a+c)(b+d)=ac+bd$. Find the smallest possible value of $$\frac{a}{b}+\frac{b}{c}+\frac{c}{d}+\frac{d}{a}.$$ [i]Israel[/i]

A polynomial $x^n + a_1x^{n-1} + a_2x^{n-2} +... + a_{n-2}x^2 + a_{n-1}x + a_n$ has $n$ distinct real roots $x_1, x_2,...,x_n$, where $n > 1$. The polynomial $nx^{n-1}+ (n - 1)a_1x^{n-2} + (n - 2)a_2x^{n-3} + ...+ 2a_{n-2}x + a_{n-1}$ has roots $y_1, y_2,..., y_{n_1}$. Prove that $\frac{x^2_1+ x^2_2+ ...+ x^2_n}{n}>\frac{y^2_1 + y^2_2 + ...+ y^2_{n-1}}{n - 1}$

For integers $a$, $b$, $c$, and $d$, let $f(x) = x^2 + ax + b$ and $g(x) = x^2 + cx + d$. Find the number of ordered triples $(a,b,c)$ of integers with absolute values not exceeding $10$ for which there is an integer $d$ such that $g(f(2)) = g(f(4)) = 0$.

[u]Round 6 [/u] [b]p16.[/b] Let $a$ be a solution to $x^3 -x +1 = 0$. Find $a^6 -a^2 +2a$. [b]p17.[/b] For a positive integer $n$, $\phi (n)$ is the number of positive integers less than $n$ that are relatively prime to $n$. Compute the sum of all $n$ for which $\phi (n) = 24$. [b]p18.[/b] Let $x$ be a positive integer such that $x^2 \equiv 57$ (mod $59$). Find the least possible value of $x$. [u]Round 7[/u] [b]p19.[/b] In the diagram below, find the number of ways to color each vertex red, green, yellow or blue such that no two vertices of a triangle have the same color. [img]https://cdn.artofproblemsolving.com/attachments/1/e/01418af242c7e2c095a53dd23e997b8d1f3686.png[/img] [b]p20.[/b] In a set with $n$ elements, the sum of the number of ways to choose $3$ or $4$ elements is a multiple of the sumof the number of ways to choose $1$ or $2$ elements. Find the number of possible values of $n$ between $4$ and $120$ inclusive. [b]p21.[/b] In unit square $ABCD$, let $\Gamma$ be the locus of points $P$ in the interior of $ABCD$ such that $2AP < BP$. The area of $\Gamma$ can be written as $\frac{a\pi +b\sqrt{c}}{d}$ for integers $a,b,c,d$ with $c$ squarefree and $gcd(a,b,d) = 1$. Find $1000000a +10000b +100c +d$. [u]Round 8 [/u] [b]p22.[/b] Ephram, GammaZero, and Orz walk into a bar. Each write some permutation of the letters “LMT” once, then concatenate their permutations one after the other (i.e. LTMTLMTLM would be a possible string, but not LLLMMMTTT). Suppose that the probability that the string “LMT” appears in that order among the new $9$-character string can be written as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p23.[/b] In $\vartriangle ABC$ with side lengths $AB = 27$, $BC = 35$, and $C A = 32$, let $D$ be the point at which the incircle is tangent to $BC$. The value of $\frac{\sin \angle C AD }{\sin\angle B AD}$ can be expressed as $\frac{A}{B}$ for relatively prime positive integers $A$ and $B$. Find $1000A+B$. [b]p24.[/b] Let $A$ be the greatest possible area of a square contained in a regular hexagon with side length $1$. Let B be the least possible area of a square that contains a regular hexagon with side length $1$. The value of $B-A$ can be expressed as $a\sqrt{b}-c$ for positive integers $a$, $b$, and $c$ with $b$ squarefree. Find $10000a +100b +c$. [u]Round 9[/u] [b]p25.[/b] Estimate how many days before today this problem was written. If your estimation is $E$ and the actual answer is $A$, you will receive $\max \left( \left \lfloor 10 - \left| \frac{E-A}{2} \right| \right \rfloor , 0 \right)$ points. [b]p26.[/b] Circle $\omega_1$ is inscribed in unit square $ABCD$. For every integer $1 < n \le 10,000$, $\omega_n$ is defined as the largest circle which can be drawn inside $ABCD$ that does not overlap the interior of any of $\omega_1$,$\omega_2$, $...$,$\omega_{n-1}$ (If there are multiple such $\omega_n$ that can be drawn, one is chosen at random). Let r be the radius of ω10,000. Estimate $\frac{1}{r}$ . If your estimation is $E$ and the actual answer is $A$, you will receive $\max \left( \left \lfloor 10 - \left| \frac{E-A}{200} \right| \right \rfloor , 0 \right)$ points. [b]p27.[/b] Answer with a positive integer less than or equal to $20$. We will compare your response with the response of every other team that answered this problem. When two equal responses are compared, neither team wins. When two unequal responses $A > B$ are compared, $A$ wins if $B | A$, and $B$ wins otherwise. If your team wins n times, you will receive $\left \lfloor \frac{n}{2} \right \rfloor$ points. PS. You should use hide for answers. Rounds 1-5 have been posted [url=https://artofproblemsolving.com/community/c3h3167135p28823324]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A treasure is buried under a square of an $8\times 8$ board. Under each other square is a message which indicates the minimum number of steps needed to reach the square with the treasure. Each step takes one from a square to another square sharing a common side. What is the minmum number of squares we must dig up in order to bring up the treasure for sure?

Find all pairs of functions $f ,g : Z \rightarrow Z $ that satisfy $f (g(x)+y) = g( f (y)+x) $ for all integers $ x,y$ and such that $g(x) = g(y)$ only if $x = y$.

A nondegenerate triangle with perimeter $1$ has side lengths $a, b,$ and $c$. Prove that \[\left|\frac{a - b}{c + ab}\right| + \left|\frac{b - c}{a + bc}\right| + \left|\frac{c - a}{b + ac}\right| < 2.\] [i]Proposed by Andrew Wen[/i]

For any permutation $p$ of set $\{1, 2, \ldots, n\}$, define $d(p) = |p(1) - 1| + |p(2) - 2| + \ldots + |p(n) - n|$. Denoted by $i(p)$ the number of integer pairs $(i, j)$ in permutation $p$ such that $1 \leqq < j \leq n$ and $p(i) > p(j)$. Find all the real numbers $c$, such that the inequality $i(p) \leq c \cdot d(p)$ holds for any positive integer $n$ and any permutation $p.$

The function $f(n)$ is defined on the nonnegative integers $n$ by: $f(0) = 0, f(1) = 1$, and \[f(n) = f\left(n -\frac{1}{2}m(m - 1)\right)-f\left(\frac{1}{2}m(m+ 1)-n\right)\] for $\frac{1}{2}m(m - 1) < n \le \frac{1}{2}m(m+ 1), m \ge 2$. Find the smallest integer $n$ for which $f(n) = 5$.

Let $ a_1,a_2,\dots$ be sequence of real numbers such that $ a_1\equal{}1$, $ a_2\equal{}\dfrac{4}{3}$, and \[ a_{n\plus{}1}\equal{}\sqrt{1\plus{}a_na_{n\minus{}1}}, \quad \forall n \ge 2.\] Prove that for all $ n \ge 2$, \[ a_n^2>a_{n\minus{}1}^2\plus{}\dfrac{1}{2}\] and \[ 1\plus{}\dfrac{1}{a_1}\plus{}\dfrac{1}{a_2}\plus{}\dots\plus{}\dfrac{1}{a_n}>2a_n.\] [i]Fajar Yuliawan, Bandung[/i]

On the graph of a polynomial with integer coefficients, two points are chosen with integer coordinates. Prove that if the distance between them is an integer, then the segment that connects them is parallel to the horizontal axis.

Suppose $a$ is a complex number such that \[a^2+a+\frac{1}{a}+\frac{1}{a^2}+1=0\] If $m$ is a positive integer, find the value of \[a^{2m}+a^m+\frac{1}{a^m}+\frac{1}{a^{2m}}\]

Show that for nonnegative integers $m$ and $n$, $\frac{\dbinom{m}{0}}{n+1}-\frac{\dbinom{m}{1}}{n+2}+...+(-1)^m\frac{\dbinom{m}{m}}{n+m+1}$ $=\frac{\dbinom{n}{0}}{m+1}-\frac{\dbinom{n}{1}}{m+2}+...+(-1)^n\frac{\dbinom{n}{n}}{m+n+1}$.

For every positive $a, b, c, d$ such that $a + c\le ac$ and $b + d \le bd$ prove that $ab + cd \ge 8$.