Let $(a_n)$ and $(b_n)$ be the sequences of real numbers such that \[ (2 + i)^n = a_n + b_ni \] for all integers $n\geq 0$, where $i = \sqrt{-1}$. What is \[\sum_{n=0}^\infty\frac{a_nb_n}{7^n}\,?\] $\textbf{(A) }\frac 38\qquad\textbf{(B) }\frac7{16}\qquad\textbf{(C) }\frac12\qquad\textbf{(D) }\frac9{16}\qquad\textbf{(E) }\frac47$

In 3D coordinate space, $O$ is the origin, $A$ lies on the positive $x$-axis, $B$ lies on the positive $y$-axis, and $C$ lies on the positive $z$-axis such that $BO = 2AO$ and $CO = 3AO$. Suppose that a unit cube with sides parallel to the axes can be inscribed within tetrahedron $ABCO$. Compute $AO + BO + CO$.

Let $O$ be the centre of a regular $n$-gon whose vertices are labelled $A_1$,$...$, $A_n$. Let $a_1>a_2>...>a_n>0$. Prove that the vector $$a_1\overrightarrow{OA_1}+a_2\overrightarrow{OA_2}+...+a_n\overrightarrow{OA_n}$$ is not equal to the zero vector. (D. Fomin, Alexey Kirichenko)

There are $50$ exact watches lying on a table. Prove that there exist a certain moment, when the sum of the distances from the centre of the table to the ends of the minute hands is more than the sum of the distances from the centre of the table to the centres of the watches.

A boa of size $k$ is a graph with $k+1$ vertices $\{0,1,\dots,k-1,k\}$ and edges only between the vertices $i$ and $i+1$ for $0\leq i < k.$ The boa is place in a graph $G$ through a injection of graphs. (This is an injective function form the vertices of the boa to the vertices of the graph in such a way that if there is an edge between the vertices $x$ and $y$ in the boa then there must be an edge between $f(x)$ and $f(y)$ in $G$). The Boa can move in the graph $G$ using to type of movement each time. If the boa is initially on the vertices $f(0),f(1),\dots,f(k)$ then it moves in one of the following ways: (i) It choose $v$ a neighbor of $f(k)$ such that $v\not\in\{f(0),f(1),\dots,f(k-1)\}$ and the boa now moves to $f(0),f(1),\dots,f(k)$ with $f'(k)=v$ and $f'(i) = f(i+1)$ for $0 \leq i < k,$ or (ii) It choose $v$ a neighbor of $f(0)$ such that $v\not\in\{f(1),f(2),\dots,f(k)\}$ and the boa now moves to $f(0),f(1),\dots,f(k)$ with $f'(0)=v$ and $f'(i) = f'(i-1)$ for $0 < i \leq k.$ Prove that if $G$ is a connected graph with diameter $d$, then it is possible to put a size $\lceil d/2 \rceil$ boa in $G$ such that the boa can reach any vertex of $G$.

Square $ABCD$ and triangle $ABE$ have equal area. Square $ABCD$ has sidelength $4$, while triangle $ABE$ has height $h$ and base $4$. Find the value of $h$. [center][img]https://cdn.artofproblemsolving.com/attachments/7/c/efe7bed4232f9d2440f5719d6f2ddae0ef7d05.png[/img][/center] $\textbf{(A) }\dfrac43\qquad\textbf{(B) }2\qquad\textbf{(C) }4\qquad\textbf{(D) }6\qquad\textbf{(E) }8$

The figure shows an arc $\ell$ on the unit circle and two regions $A$ and $B$. Prove that the area of $A$ plus the area of $B$ equals the length of $\ell$. [img]https://1.bp.blogspot.com/-SYoSrFowZ30/XzRz0ygiOVI/AAAAAAAAMUs/0FCduUoxKGwq0gSR-b3dtb3SvDjZ89x_ACLcBGAsYHQ/s0/2017%2BMohr%2Bp3.png[/img]

Let $a, b, c$ be non-zero real numbers that satisfy $\frac{1}{abc} + \frac{1}{a} + \frac{1}{c} = \frac{1}{b}$. The expression $\frac{4}{a^2 + 1} + \frac{4}{b^2 + 1} + \frac{7}{c^2 + 1}$ has a maximum value $M$. Find the sum of the numerator and denominator of the reduced form of $M$.

Let $A_1 A_2 A_3 A_4 A_5 A_6 A_7 A_8$ be a regular octagon. Let $M_1$, $M_3$, $M_5$, and $M_7$ be the midpoints of sides $\overline{A_1 A_2}$, $\overline{A_3 A_4}$, $\overline{A_5 A_6}$, and $\overline{A_7 A_8}$, respectively. For $i = 1, 3, 5, 7$, ray $R_i$ is constructed from $M_i$ towards the interior of the octagon such that $R_1 \perp R_3$, $R_3 \perp R_5$, $R_5 \perp R_7$, and $R_7 \perp R_1$. Pairs of rays $R_1$ and $R_3$, $R_3$ and $R_5$, $R_5$ and $R_7$, and $R_7$ and $R_1$ meet at $B_1$, $B_3$, $B_5$, $B_7$ respectively. If $B_1 B_3 = A_1 A_2$, then $\cos 2 \angle A_3 M_3 B_1$ can be written in the form $m - \sqrt{n}$, where $m$ and $n$ are positive integers. Find $m + n$.

Let $p_1,p_2,p_3,p_4$ be four distinct primes, and let $1=d_1<d_2<\ldots<d_{16}=n$ be the divisors of $n=p_1p_2p_3p_4$. Determine all $n<2001$ with the property that $d_9-d_8=22$.

For each positive integer $ n$,define $ f(n)\equal{}lcm(1,2,...,n)$. (a)Prove that for every $ k$ there exist $ k$ consecutive positive integers on which $ f$ is constant. (b)Find the maximum possible cardinality of a set of consecutive positive integers on which $ f$ is strictly increasing and find all sets for which this maximum is attained.

Let $a,b,c,d$ be pairwise distinct positive integers such that $$\frac{a}{a+b}+\frac{b}{b+c}+\frac{c}{c+d}+\frac{d}{d+a}$$ is an integer. Prove that $a+b+c+d$ is [b]not[/b] a prime number.

Consider the numbers from $1$ to $32$. A game is made by placing all the numbers in pairs and replacing each pair with the largest prime divisor of the sum of the numbers of that couple. For example, if we match the $32$ numbers as: $(1, 2), (3,4),(5, 6), (7, 8),..., (27, 28),(29, 30), (31,32)$, we get the following list of $16$ numbers: $3,7,11,5,...,11,59,7$. where there are repetitions. The game continues in a similar way until in the end only one number remains. Determine the highest possible value from the number that remains at the end.

Find the smallest positive constant $c$ satisfying: For any simple graph $G=G(V,E)$, if $|E|\geq c|V|$, then $G$ contains $2$ cycles with no common vertex, and one of them contains a chord. Note: The cycle of graph $G(V,E)$ is a set of distinct vertices ${v_1,v_2...,v_n}\subseteq V$, $v_iv_{i+1}\in E$ for all $1\leq i\leq n$ $(n\geq 3, v_{n+1}=v_1)$; a cycle containing a chord is the cycle ${v_1,v_2...,v_n}$, such that there exist $i,j, 1< i-j< n-1$, satisfying $v_iv_j\in E$.

Given is a triangle $ABC$ with barycenter $G$ and circumcenter $O$.The perpendicular bisectors of $GA,GB,GC$ intersect at $A_1,B_1,C_1$.Show that $O$ is the barycenter of $\triangle{A_1B_1C_1}$.

For each integer $n \ge 100$ we define $T(n)$ to be the number obtained from $n$ by moving the two leading digits to the end. For example, $T(12345) = 34512$ and $T(100) = 10$. Find all integers $n \ge 100$ for which $n + T(n) = 10n$.

A set of $ 25$ square blocks is arranged into a $ 5\times 5$ square. How many different combinations of $ 3$ blocks can be selected from that set so that no two are in the same row or column? $ \textbf{(A)}\ 100\qquad \textbf{(B)}\ 125\qquad \textbf{(C)}\ 600\qquad \textbf{(D)}\ 2300\qquad \textbf{(E)}\ 3600$

Some positive integers are initially written on a board, where each $2$ of them are different. Each time we can do the following moves: (1) If there are 2 numbers (written in the board) in the form $n, n+1$ we can erase them and write down $n-2$ (2) If there are 2 numbers (written in the board) in the form $n, n+4$ we can erase them and write down $n-1$ After some moves, there might appear negative numbers. Find the maximum value of the integer $c$ such that: Independetly of the starting numbers, each number which appears in any move is greater or equal to $c$

A block of mass $\text{m = 3.0 kg}$ slides down one ramp, and then up a second ramp. The coefficient of kinetic friction between the block and each ramp is $\mu_\text{k} = \text{0.40}$. The block begins at a height $\text{h}_\text{1} = \text{1.0 m}$ above the horizontal. Both ramps are at a $\text{30}^{\circ}$ incline above the horizontal. To what height above the horizontal does the block rise on the second ramp? (A) $\text{0.18 m}$ (B) $\text{0.52 m}$ (C) $\text{0.59 m}$ (D) $\text{0.69 m}$ (E) $\text{0.71 m}$

Let \[ \frac{p}{q} = \frac{2017}{2-\frac{1}{3-\frac{2}{2-\frac{1}{2-\frac{1}{3-\frac{2}{2-\frac{1}{2-\frac{1}{2-\frac{1}{3-\frac{2}{2-\frac{1}{2-\cdots}}}}}}}}}}}\] where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

$AB$ is the diameter of circle $O$. A random point $P$ is selected on $O$ so that $AP = 4$ and $BP = 3$. Points $C$ and $D$ are drawn on circle $O$ so that $OC$ bisects $AP$ and $OD$ bisects $BP$. What is the degree measure of $\angle COD$?

Let $a,b,c$ be positive reals. Prove that \[ \frac{(a-b)(a-c)}{2a^2 + (b+c)^2} + \frac{(b-c)(b-a)}{2b^2 + (c+a)^2} + \frac{(c-a)(c-b)}{2c^2 + (a+b)^2} \geq 0. \] [i]Calvin Deng.[/i]

Let $f(x)=t\sin x+(1-t)\cos x\ (0\leqq t\leqq 1)$. Find the maximum and minimum value of the following $P(t)$. \[P(t)=\left\{\int_0^{\frac{\pi}{2}} e^x f(x) dx \right\}\left\{\int_0^{\frac{\pi}{2}} e^{-x} f(x)dx \right\}\]

Let $ABCD$ be a quadrilateral such that $\angle A=\angle C=90^{\circ}$. If $A, D$ and the midpoints of $BA, BC$ are concyclic, show that the midpoints of $AD, DC$ and $B, C$ are concyclic.

A mouse is sitting in a toy car on a negligibly small turntable. The car cannot turn on its own, but the mouse can control when the car is launched and when the car stops (the car has brakes). When the mouse chooses to launch, the car will immediately leave the turntable on a straight trajectory at $1$ meter per second. Suddenly someone turns on the turntable; it spins at $30$ rpm. Consider the set $S$ of points the mouse can reach in his car within $1$ second after the turntable is set in motion. What is the area of $S$, in square meters?