Show that $\lceil (\sqrt{3}+1)^{2n})\rceil$ is divisible by $2^{n+1}.$

Let $\mathbb{R}$ be the set of real numbers. Let $f:\mathbb{R}\rightarrow\mathbb{R}$ be a function such that \[f(x+y)f(x-y)\geqslant f(x)^2-f(y)^2\] for every $x,y\in\mathbb{R}$. Assume that the inequality is strict for some $x_0,y_0\in\mathbb{R}$. Prove that either $f(x)\geqslant 0$ for every $x\in\mathbb{R}$ or $f(x)\leqslant 0$ for every $x\in\mathbb{R}$.

Let $n$ be an integer and $a, b$ real numbers such that $n > 1$ and $a > b > 0$. Prove that $$(a^n - b^n) \left ( \frac{1}{b^{n- 1}} - \frac{1}{a^{n -1}}\right) > 4n(n -1)(\sqrt{a} - \sqrt{b})^2$$

Let $C$ be a point on the extension of the diameter $AB$ of a circle. A line through $C$ is tangent to the circle at point $N$. The bisector of $\angle ACN$ meets the lines $AN$ and $BN$ at $P$ and $Q$ respectively. Prove that $PN = QN$.

Fix an integer $n\geq4$. Let $C_n$ be the collection of all $n$–point configurations in the plane, every three points of which span a triangle of area strictly greater than $1.$ For each configuration $C\in C_n$ let $f(n,C)$ be the maximal size of a subconfiguration of $C$ subject to the condition that every pair of distinct points has distance strictly greater than $2.$ Determine the minimum value $f(n)$ which $f(n,C)$ achieves as $C$ runs through $C_n.$ [i]Radu Bumbăcea and Călin Popescu[/i]

Find all natural numbers with the property that, when the first digit is moved to the end, the resulting number is $\dfrac{7}{2}$ times the original one.

Compute the value of \[\sum_{i=0}^{2026} \frac{i^2}{9+i^4} \pmod{2027},\] where $\frac{1}{a}$ denotes the multiplicative inverse of $a$ modulo $2027$.

The icosahedron is a convex, regular polyhedron consisting of $20$ equilateral triangle for faces. A particular icosahedron given to you has labels on each of its vertices, edges, and faces. Each minute, you uniformly at random pick one of the labels on the icosahedron. If the label is on a vertex, you remove it. If the label is on an edge, you delete the label on the edge along with any labels still on the vertices of that edge. If the label is on a face, you delete the label on the face along with any labels on the edges and vertices which make up that face. What is the expected number of minutes that pass before you have removed all labels from the icosahedron?

Do there exist two polynomials $P(x)$ and $Q(x)$ with integer coefficients such that $$(P-Q)(x), \,\,\,\, P(x) \,\,\,\, and \,\,\,\,(P+Q)(x)$$ are squares of polynomials (and $Q$ is not equal to $cP$, where $c$ is a real number)? (V Prasolov)

If all vertices of a triangle on the square grid are grid points, then the triangle is called a [i]lattice[/i] triangle. What is the area of the lattice triangle with (one) of the smallest area, if one grid has area $1$ square unit?

What is the area of the region defined by the inequality $ |3x\minus{}18|\plus{}|2y\plus{}7|\le 3$? $ \textbf{(A)}\ 3 \qquad \textbf{(B)}\ \frac{7}{2} \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ \frac{9}{2} \qquad \textbf{(E)}\ 5$

The hotel has $13$ rooms with rooms from $1$ to $13$, located on one side of a straight corridor in ascending order of numbers. During the tourist season, which lasts from May $1$st to October $1$st, the hotel visitor has the opportunity to rent either one room for two days in a row, or two adjacent rooms together for one day. How much could a hotel owner earn in a season if it is known that on October $1$, rooms $1$ and $13$ were empty, and the payment for one room was one tugrik per day?

Is it possible to find a set $A$ of eleven positive integers such that no six elements of $A$ have a sum which is divisible by $6$?

Let $S$ be a finite set of integers, each greater than $1$. Suppose that for each integer $n$ there is some $s\in S$ such that $\gcd(s,n)=1$ or $\gcd(s,n)=s$. Show that there exist $s,t\in S$ such that $\gcd(s,t)$ is prime.

Circles $\omega_1$ and $\omega_2$ intersect each other at points $A$ and $B$. Point $C$ lies on the tangent line from $A$ to $\omega_1$ such that $\angle ABC = 90^\circ$. Arbitrary line $\ell$ passes through $C$ and cuts $\omega_2$ at points $P$ and $Q$. Lines $AP$ and $AQ$ cut $\omega_1$ for the second time at points $X$ and $Z$ respectively. Let $Y$ be the foot of altitude from $A$ to $\ell$. Prove that points $X, Y$ and $Z$ are collinear. [i]Proposed by Iman Maghsoudi[/i]

[u]Round 1[/u] [b]p1.[/b] Every angle of a regular polygon has degree measure $179.99$ degrees. How many sides does it have? [b]p2.[/b] What is $\frac{1}{20} + \frac{1}{1}+ \frac{1}{5}$ ? [b]p3.[/b] If the area bounded by the lines $y = 0$, $x = 0$, and $x = 3$ and the curve $y = f(x)$ is $10$ units, what is the area bounded by $y = 0$, $x = 0$, $x = 6$, and $y = f(x/2)$? [u]Round 2[/u] [b]p4.[/b] How many ways can $42$ be expressed as the sum of $2$ or more consecutive positive integers? [b]p5.[/b] How many integers less than or equal to $2015$ can be expressed as the sum of $2$ (not necessarily distinct) powers of two? [b]p6.[/b] $p,q$, and $q^2 - p^2$ are all prime. What is $pq$? [u]Round 3[/u] [b]p7.[/b] Let $p(x) = x^2 + ax + a$ be a polynomial with integer roots, where $a$ is an integer. What are all the possible values of $a$? [b]p8.[/b] In a given right triangle, the perimeter is $30$ and the sum of the squares of the sides is $338$. Find the lengths of the three sides. [b]p9.[/b] Each of the $6$ main diagonals of a regular hexagon is drawn, resulting in $6$ triangles. Each of those triangles is then split into $4$ equilateral triangles by connecting the midpoints of the $3$ sides. How many triangles are in the resulting figure? [u]Round 4[/u] [b]p10.[/b] Let $f = 5x+3y$, where $x$ and $y$ are positive real numbers such that $xy$ is $100$. Find the minimum possible value of $f$. [b]p11.[/b] An integer is called "Awesome" if its base $8$ expression contains the digit string $17$ at any point (i.e. if it ever has a $1$ followed immediately by a $7$). How many integers from $1$ to $500$ (base $10$) inclusive are Awesome? [b]p12.[/b] A certain pool table is a rectangle measuring $15 \times 24$ feet, with $4$ holes, one at each vertex. When playing pool, Joe decides that a ball has to hit at least $2$ sides before getting into a hole or else the shot does not count. What is the minimum distance a ball can travel after being hit on this table if it was hit at a vertex (assume it only stops after going into a hole) such that the shot counts? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3157013p28696685]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3158564p28715928]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].