Let $a, b>1$ be reals such that $a+\frac{1}{a^2} \geq 5b-\frac{3}{b^2}$. Show that $a>5b-\frac{4}{b^2}$.

On the $BE$ side of a regular $ABE$ triangle, a $BCDE$ rhombus is built outside it. The segments $AC$ and $BD$ intersect at point $F$. Prove that $AF <BD$.

[u]Round 5[/u] [b]p13.[/b] You have a $26 \times 26$ grid of squares. Color each randomly with red, yellow, or blue. What is the expected number (to the nearest integer) of $2 \times 2$ squares that are entirely red? [b]p14.[/b] Four snakes are boarding a plane with four seats. Each snake has been assigned to a different seat. The first snake sits in the wrong seat. Any subsequent snake will sit in their assigned seat if vacant, if not, they will choose a random seat that is available. What is the expected number of snakes who sit in their correct seats? [b]p15.[/b] Let $n \ge 1$ be an integer and $a > 0$ a real number. In terms of n, find the number of solutions $(x_1, ..., x_n)$ of the equation $\sum^n_{i=1}(x^2_i + (a - x_i)^2) = na^2$ such that $x_i$ belongs to the interval $[0, a]$ , for $i = 1, 2, . . . , n$. [u]Round 6 [/u] [b]p16.[/b] All roots of $$\prod^{25}_{n=1} \prod^{2n}_{k=0}(-1)^k \cdot x^k = 0$$ are written in the form $r(\cos \phi + i\sin \phi)$ for $i^2 = -1$, $r > 0$, and $0 \le \phi < 2\pi$. What is the smallest positive value of $\phi$ in radians? [b]p17.[/b] Find the sum of the distinct real roots of the equation $$\sqrt[3]{x^2 - 2x + 1} + \sqrt[3]{x^2 - x - 6} = \sqrt[3]{2x^2 - 3x - 5}.$$ [b]p18.[/b] If $a$ and $b$ satisfy the property that $a2^n + b$ is a square for all positive integers $n$, find all possible value(s) of $a$. [u]Round 7 [/u] [b]p19.[/b] Compute $(1 - \cot 19^o)(1 - \cot 26^o)$. [b]p20.[/b] Consider triangle $ABC$ with $AB = 3$, $BC = 5$, and $\angle ABC = 120^o$. Let point $E$ be any point inside $ABC$. The minimum of the sum of the squares of the distances from $E$ to the three sides of $ABC$ can be written in the form $a/b$ , where a and b are natural numbers such that the greatest common divisor of $a$ and $b$ is $1$. Find $a + b$. [b]p21.[/b] Let $m \ne 1$ be a square-free number (an integer – possibly negative – such that no square divides $m$). We denote $Q(\sqrt{m})$ to be the set of all $a + b\sqrt{m}$ where $a$ and $b$ are rational numbers. Now for a fixed $m$, let $S$ be the set of all numbers $x$ in $Q(\sqrt{m})$ such that x is a solution to a polynomial of the form: $x^n + a_1x^{n-1} + .... + a_n = 0$, where $a_0$, $...$, $a_n$ are integers. For many integers m, $S = Z[\frac{m}] = \{a + b\sqrt{m}\}$ where $a$ and $b$ are integers. Give a classification of the integers for which this is not true. (Hint: It is true for $ m = -1$ and $2$.) PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2782002p24434611]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A circle intersects square $ABCD$ at points $A, E$, and $F$, where $E$ lies on $AB$ and $F$ lies on $AD$, such that $AE + AF = 2(BE + DF)$. If the square and the circle each have area $ 1$, determine the area of the union of the circle and square.

The number $2017$ is prime. Let $S=\sum_{k=0}^{62}\binom{2014}{k}$. What is the remainder when $S$ is divided by $2017$? $\textbf{(A) }32\qquad \textbf{(B) }684\qquad \textbf{(C) }1024\qquad \textbf{(D) }1576\qquad \textbf{(E) }2016\qquad$

Find all positive integers $ k$ for which the following statement is true: If $ F(x)$ is a polynomial with integer coefficients satisfying the condition $ 0 \leq F(c) \leq k$ for each $ c\in \{0,1,\ldots,k \plus{} 1\}$, then $ F(0) \equal{} F(1) \equal{} \ldots \equal{} F(k \plus{} 1)$.

A finite sequence of three-digit integers has the property that the tens and units digits of each term are, respectively, the hundreds and tens digits of the next term, and the tens and units digits of the last term are, respectively, the hundreds and tens digits of the first term. For example, such a sequence might begin with the terms $ 247,$ $ 275,$ and $ 756$ and end with the term $ 824.$ Let $ \mathcal{S}$ be the sum of all the terms in the sequence. What is the largest prime factor that always divides $ \mathcal{S}?$ $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ 7 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 37 \qquad \textbf{(E)}\ 43$

Let $A_1, B_1$ and $C_1$ be points on sides $BC$, $CA$ and $AB$ of an acute triangle $ABC$ respectively, such that $AA_1$, $BB_1$ and $CC_1$ are the internal angle bisectors of triangle $ABC$. Let $I$ be the incentre of triangle $ABC$, and $H$ be the orthocentre of triangle $A_1B_1C_1$. Show that $$AH + BH + CH \geq AI + BI + CI.$$

Determine the greatest possible value of the constant $c$ that satisfies the following condition: for any convex heptagon the sum of the lengthes of all it’s diagonals is greater than $cP$, where $P$ is the perimeter of the heptagon. (I. Zhuk)

From the two cities of Dobruisk and Bodruisk, the distance between which is $40$ km, two cyclists Dobi and Bodi simultaneously rode towards each other. Dobie was traveling at $23$ km/h and Bodie was traveling at $17$ km/h. Before departure, a fly landed on Dobie’s nose, which, at the moment of his departure from the city, flew towards Bodruisk at a speed of $40$ km/h. The fly met Bodie, immediately turned back and flew towards Dobruisk at a speed of $30$ km/h. (The fact is that the wind was blowing from Dobruisk to Bodruisk.) Having met Doby, the fly turned back again, etc. Determine the total path that the fly flew until the moment the cyclists met. (The speed of the fly in each direction did not change.)

Inside a given convex quadrilateral, find a point such that the segments connecting this point with the midpoints of the quadrilateral's sides divide the quadrilateral into four parts with equal areas.

Let $C$ denote the family of continuous functions on the real axis. Let $T$ be a mapping of $C$ into $C$ which has the following properties: 1. $T$ is linear, i.e. $T(c_1\psi _1+c_2\psi _2)= c_1T\psi _1+c_2T\psi _2$ for $c_1$ and $c_2$ real and $\psi_1$ and $\psi_2$ in $C$. 2. $T$ is local, i.e. if $\psi_1 \equiv \psi_2$ in some interval $I$ then also $T\psi_1 \equiv T\psi_2$ holds in $I$. Show that $T$ must necessarily be of the form $T\psi(x)=f(x)\psi(x)$ where $f(x)$ is a suitable continuous function.

Let $a$ and $b$ be relatively prime positive integers, $b$ even. For each positive integer $q$, let $p=p(q)$ be chosen so that $$ \left| \frac{p}{q} - \frac{a}{b} \right|$$ is a minimum. Prove that $$ \lim_{n \to \infty} \sum_{q=1 }^{n} \frac{ q\left| \frac{p}{q} - \frac{a}{b} \right|}{n} = \frac{1}{4}.$$

Let $ABC$ be an acute triangle with $AB<AC$. Point $M{}$ from the side $(BC)$ is the foot of the bisector from the vertex $A{}$. The perpendicular bisector of the segment $[AM]$ intersects the side $(AC)$ in $E{}$, the side $(AB)$ in $D$ and the line $(BC)$ in $F{}$. Prove that $\frac{DB}{CE}=\frac{FB}{FC}=\left(\frac{AB}{AC}\right)^2$.

Let $ C_1$ and $ C_2$ be externally tangent circles with radius 2 and 3, respectively. Let $ C_3$ be a circle internally tangent to both $ C_1$ and $ C_2$ at points $ A$ and $ B$, respectively. The tangents to $ C_3$ at $ A$ and $ B$ meet at $ T$, and $ TA \equal{} 4$. Determine the radius of $ C_3$.

On each side of a unit square, an equilateral triangle of side length 1 is constructed. On each new side of each equilateral triangle, another equilateral triangle of side length 1 is constructed. The interiors of the square and the 12 triangles have no points in common. Let $ R$ be the region formed by the union of the square and all the triangles, and $ S$ be the smallest convex polygon that contains $ R$. What is the area of the region that is inside $ S$ but outside $ R$? $ \textbf{(A)} \; \frac{1}{4} \qquad \textbf{(B)} \; \frac{\sqrt{2}}{4} \qquad \textbf{(C)} \; 1 \qquad \textbf{(D)} \; \sqrt{3} \qquad \textbf{(E)} \; 2 \sqrt{3}$

Each square of a $(2^n-1) \times (2^n-1)$ board contains either $1$ or $-1$. Such an arrangement is called [i]successful[/i] if each number is the product of its neighbors. Find the number of successful arrangements.

A [i]diameter[/i] of a finite planar set is any line segment of maximal Euclidean length having both end points in that set. A [i]lattice point[/i] in the Cartesian plane is one whose coordinates are both integral. Given an integer $n\geq 2$, prove that a set of $n$ lattice points in the plane has at most $n-1$ diameters.

Two equal circles in the same plane cannot have the following number of common tangents: $ \textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{none of these}$

[b]p1.[/b] Twelve tables are set up in a row for a Millenium party. You want to put $2000$ cupcakes on the tables so that the numbers of cupcakes on adjacent tables always differ by one (for example, if the $5$th table has $20$ cupcakes, then the $4$th table has either $19$ or $21$ cupcakes, and the $6$th table has either $19$ or $21$ cupcakes). a) Find a way to do this. b) Suppose a Y2K bug eats one of the cupcakes, so you have only $1999$ cupcakes. Show that it is impossible to arrange the cupcakes on the tables according to the above conditions. [b]p2.[/b] Let $P$ and $Q$ lie on the hypotenuse $AB$ of the right triangle $CAB$ so that $|AP|=|PQ|=|QB|=|AB|/3$. Suppose that $|CP|^2+|CQ|^2=5$. Prove that $|AB|$ has the same value for all such triangles, and find that value. Note: $|XY|$ denotes the length of the segment $XY$. [b]p3.[/b] Let $P$ be a polynomial with integer coefficients and let $a, b, c$ be integers. Suppose $P(a)=b$, $P(b)=c$, and $P(c)=a$. Prove that $a=b=c$. [b]p4.[/b] A lattice point is a point $(x,y)$ in the plane for which both $x$ and $y$ are integers. Each lattice point is painted with one of $1999$ available colors. Prove that there is a rectangle (of nonzero height and width) whose corners are lattice points of the same color. [b]p5.[/b] A $1999$-by-$1999$ chocolate bar has vertical and horizontal grooves which divide it into $1999^2$ one-by-one squares. Caesar and Brutus are playing the following game with the chocolate bar: A move consists of a player picking up one chocolate rectangle; breaking it along a groove into two smaller rectangles; and then either putting both rectangles down or eating one piece and putting the other piece down. The players move alternately. The one who cannot make a move at his turn (because there are only one-by-one squares left) loses. Caesar starts. Which player has a winning strategy? Describe a winning strategy for that player. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

a) A positive integer is written at each vertex of a triangle. Then on each side of the triangle the greatest common divisor of its ends is written. It is possible that the numbers written on the sides be three consecutive integers, in some order? b) A positive integer is written at each vertex of a tetrahedron. Then, on each edge of the tetrahedron is written the greatest common divisor of its ends . It is possible that the numbers written in the edges are six consecutive integers, in some order?

Point $P$ lies inside square $ABCD$ such that the areas of $\triangle{PAB}, \triangle{PBC}, \triangle{PCD},$ and $\triangle{PDA}$ are $1, 2, 3,$ and $4,$ in some order. Compute $PA \cdot PB \cdot PC \cdot PD.$

We say a natural number $n$ is perfect if the sum of all the positive divisors of $n$ is equal to $2n$. For example, $6$ is perfect since its positive divisors $1,2,3,6$ add up to $12=2\times 6$. Show that an odd perfect number has at least $3$ distinct prime divisors. [i]Note: It is still not known whether odd perfect numbers exist. So assume such a number is there and prove the result.[/i]

Given a natural number $n,$ find all polynomials $P(x)$ of degree less than $n$ satisfying the following condition \[ \sum^n_{i=0} P(i) \cdot (-1)^i \cdot \binom{n}{i} = 0. \]

Triangle $ABC$ is right-angled at $C$. $AQ$ is drawn parallel to $BC$ with $Q$ and $B$ on opposite sides of $AC$ so that when $BQ$ is drawn, intersecting $AC$ at $P$, we have $PQ = 2AB$. Prove that $\angle ABC = 3\angle PBC$.