Let $ABC$ be an obtuse triangle with $AB = AC$, and let $\Gamma$ be the circle that is tangent to $AB$ at $B$ and to $AC$ at $C$. Let $D$ be the point on $\Gamma$ furthest from $A$ such that $AD$ is perpendicular to $BC$. Point $E$ is the intersection of $AB$ and $DC$, and point $F$ lies on line $AB$ such that $BC = BF$ and $B$ lies on segment $AF$. Finally, let $P$ be the intersection of lines $AC$ and $DB$. Show that $PE = PF$.

Determine the largest natural number $m$ such that for each non negative real numbers $a_1 \ge a_2 \ge ... \ge a_{2014} \ge 0$ , it is true that $$\frac{a_1+a_2+...+a_m}{m}\ge \sqrt{\frac{a_1^2+a_2^2+...+a_{2014}^2}{2014}}$$

1) Let $a$ and $b$ be relatively prime positive integers. Prove that there is a positive integer $n$ such that $1 \le n \le b$ and $b$ divides $a^n - 1$. 2) Prove that there is a multiple of $7^{2010}$ of the form $99... 9$ ($n$ nines), for some positive integer $n$ not exceeding $7^{2010}$.

A family $\mathcal{F}$ of sets is called [i]really neat[/i] if for any $A,B\in \mathcal{F}$, there is a set $C\in \mathcal{F}$ such that $A\cup B = A\cup C=B\cup C$. Let $$f(n)=\min \left\{ \max_{A\in \mathcal{F}} |A| \colon \mathcal{F} \text{ is really neat and } |\cup \mathcal{F}| =n\right\} .$$ Prove that the sequence $f(n)/n$ converges and find its limit.

Does there exist a natural number $n$ in whose decimal representation each digit occurs at least $2006$ times and which has the property that you can find two different digits in its decimal representation such that the number obtained from $n$ by interchanging these two digits is different from $n$ and has the same set of prime divisors as $n$ ?

Write the number \[ \frac 1{\sqrt{2}-\sqrt[3]{2}} \] as the sum of terms of the form $2^q,$ where $q$ is rational. (For example, $2^1 + 2^{-1/3} + 2^{8/5}$ is a sum of this form.) Prove that your sum equals $1/(\sqrt{2}-\sqrt[3]{2}).$

Let $n > 1$ be an integer. An $n \times n$-square is divided into $n^2$ unit squares. Of these unit squares, $n$ are coloured green and $n$ are coloured blue, and all remaining ones are coloured white. Are there more such colourings for which there is exactly one green square in each row and exactly one blue square in each column; or colourings for which there is exactly one green square and exactly one blue square in each row?

\[\int_0^{\pi/1011}\sin^2(2022x)+\cos^2(2022x)\mathrm dx\] [i]Proposed by Connor Gordon[/i]

For how many $x \in \{1,2,3,\dots, 2024\}$ is it possible that [i]Bekhzod[/i] summed $2024$ non-negative consecutive integers, [i]Ozod[/i] summed $2024+x$ non-negative consecutive integers and they got the same result? [i]Proposed by Marek Maruin, Slovakia[/i]

For each nonnegative integer $k$, let $d(k)$ denote the number of $1$'s in the binary expansion of $k$. Let $m$ be a positive integer. Express $$\sum_{k=0}^{2^m-1}(-1)^{d(k)}k^m$$in the form $(-1)^ma^{f(m)}g(m)!$, where $a$ is an integer and $f$ and $g$ are polynomials.

The dodo was a strange animal. As it has already become extinct, only conjectures can be made about its way of life. One of the most unique conjectures is linked to the way the dodo moved. It seems that an adult animal only moved by jumping, which could be of two types: type I: $1$ meter to the East and $3$ to the North; type II: $2$ meters to the West and $4$ to the South. a) Prove that it was possible for the diode to reach a point located $19$ meters to the East and $95$ to the North of it and determines the number of jumps for each type he needed to carry out. b) Prove that it was impossible for the diode to reach a point located $18$ meters to the East and $95$ meters to the North of it.

The parametric equations of a curve are given by $x = 2(1+\cos t)\cos t,\ y =2(1+\cos t)\sin t\ (0\leq t\leq 2\pi)$. (1) Find the maximum and minimum values of $x$. (2) Find the volume of the solid enclosed by the figure of revolution about the $x$-axis.

It is known in Euclidean geometry that the sum of the angles of a triangle is constant. Prove, however, that the sum of the dihedral angles of a tetrahedron is not constant.

A palindrome between $ 1000$ and $ 10,000$ is chosen at random. What is the probability that it is divisible by $ 7?$ $ \textbf{(A)}\ \dfrac{1}{10} \qquad \textbf{(B)}\ \dfrac{1}{9} \qquad \textbf{(C)}\ \dfrac{1}{7} \qquad \textbf{(D)}\ \dfrac{1}{6}\qquad \textbf{(E)}\ \dfrac{1}{5}$

Let $AL_a$, $BL_b$, $CL_c$ be the bisecors of triangle $ABC$. The tangents to the circumcircle of $ABC$ at $B$ and $C$ meet at point $K_a$, points $K_b$, $K_c$ are defined similarly. Prove that the lines $K_aL_a$, $K_bL_b$ and $K_cL_c$ concur.

Let be two nonzero real numbers $ a,b, $ and a function $ f:\mathbb{R}\longrightarrow [0,\infty ) $ satisfying the functional equation $$ f(x+a+b)+f(x)=f(x+a)+f(x+b) . $$ [b]1)[/b] Prove that $ f $ is periodic if $ a/b $ is rational. [b]2)[/b] If $ a/b $ is not rational, could $ f $ be nonperiodic?

Let $x_1,x_2,\dots,x_n$ be a sequence of integers, such that $-1\leq x_i\leq 2$, for $i=1,2,\dots,n$, $x_1+x_2+\dots+x_n = 7$ and $x_1^8+x_2^8+\dots x_n^8 =2009$. Let $m$ and $M$ be the minimal and maximal possible value of $x_1^9+x_2^9+\dots x_n^9$, respectively. Find the $\frac{M}{m}$. Round your answer to nearest integer, if necessary.

$f(x) = x^3+3x^2 - 1$. Find the number of real solutions of $f(f(x)) = 0$.

Consider positive integers $m$ and $n$ for which $m> n$ and the number $22 220 038^m-22 220 038^n$ has are eight zeros at the end. Show that $n> 7$.

Is it possible to draw circles on the plane so that every line intersects at least one of them but no more than $100$ of them?

[u]Round 1[/u] [b]p1.[/b] Let $n$ be a two-digit positive integer. What is the maximum possible sum of the prime factors of $n^2 - 25$ ? [b]p2.[/b] Angela has ten numbers $a_1, a_2, a_3, ... , a_{10}$. She wants them to be a permutation of the numbers $\{1, 2, 3, ... , 10\}$ such that for each $1 \le i \le 5$, $a_i \le 2i$, and for each $6 \le i \le 10$, $a_i \le - 10$. How many ways can Angela choose $a_1$ through $a_{10}$? [b]p3.[/b] Find the number of three-by-three grids such that $\bullet$ the sum of the entries in each row, column, and diagonal passing through the center square is the same, and $\bullet$ the entries in the nine squares are the integers between $1$ and $9$ inclusive, each integer appearing in exactly one square. [u]Round 2 [/u] [b]p4.[/b] Suppose that $P(x)$ is a quadratic polynomial such that the sum and product of its two roots are equal to each other. There is a real number $a$ that $P(1)$ can never be equal to. Find $a$. [b]p5.[/b] Find the number of ordered pairs $(x, y)$ of positive integers such that $\frac{1}{x} +\frac{1}{y} =\frac{1}{k}$ and k is a factor of $60$. [b]p6.[/b] Let $ABC$ be a triangle with $AB = 5$, $AC = 4$, and $BC = 3$. With $B = B_0$ and $C = C_0$, define the infinite sequences of points $\{B_i\}$ and $\{C_i\}$ as follows: for all $i \ge 1$, let $B_i$ be the foot of the perpendicular from $C_{i-1}$ to $AB$, and let $C_i$ be the foot of the perpendicular from $B_i$ to $AC$. Find $C_0C_1(AC_0 + AC_1 + AC_2 + AC_3 + ...)$. [u]Round 3 [/u] [b]p7.[/b] If $\ell_1, \ell_2, ... ,\ell_{10}$ are distinct lines in the plane and $p_1, ... , p_{100}$ are distinct points in the plane, then what is the maximum possible number of ordered pairs $(\ell_i, p_j )$ such that $p_j$ lies on $\ell_i$? [b]p8.[/b] Before Andres goes to school each day, he has to put on a shirt, a jacket, pants, socks, and shoes. He can put these clothes on in any order obeying the following restrictions: socks come before shoes, and the shirt comes before the jacket. How many distinct orders are there for Andres to put his clothes on? [b]p9. [/b]There are ten towns, numbered $1$ through $10$, and each pair of towns is connected by a road. Define a backwards move to be taking a road from some town $a$ to another town $b$ such that $a > b$, and define a forwards move to be taking a road from some town $a$ to another town $b$ such that $a < b$. How many distinct paths can Ali take from town $1$ to town $10$ under the conditions that $\bullet$ she takes exactly one backwards move and the rest of her moves are forward moves, and $\bullet$ the only time she visits town $10$ is at the very end? One possible path is $1 \to 3 \to 8 \to 6 \to 7 \to 8 \to 10$. [u]Round 4[/u] [b]p10.[/b] How many prime numbers $p$ less than $100$ have the properties that $p^5 - 1$ is divisible by $6$ and $p^6 - 1$ is divisible by $5$? [b]p11.[/b] Call a four-digit integer $\overline{d_1d_2d_3d_4}$ [i]primed [/i] if 1) $d_1$, $d_2$, $d_3$, and $d_4$ are all prime numbers, and 2) the two-digit numbers $\overline{d_1d_2}$ and $\overline{d_3d_4}$ are both prime numbers. Find the sum of all primed integers. [b]p12.[/b] Suppose that $ABC$ is an isosceles triangle with $AB = AC$, and suppose that $D$ and $E$ lie on $\overline{AB}$ and $\overline{AC}$, respectively, with $\overline{DE} \parallel \overline{BC}$. Let $r$ be the length of the inradius of triangle $ADE$. Suppose that it is possible to construct two circles of radius $r$, each tangent to one another and internally tangent to three sides of the trapezoid $BDEC$. If $\frac{BC}{r} = a + \sqrt{b}$ forpositive integers $a$ and $b$ with $b$ squarefree, then find $a + b$. PS. You should use hide for answers. Rounds 5-7 have been posted [url=https://artofproblemsolving.com/community/c4h2800986p24675177]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

If we write $ |x^2 \minus{} 4| < N$ for all $ x$ such that $ |x \minus{} 2| < 0.01$, the smallest value we can use for $ N$ is: $ \textbf{(A)}\ .0301 \qquad \textbf{(B)}\ .0349 \qquad \textbf{(C)}\ .0399 \qquad \textbf{(D)}\ .0401 \qquad \textbf{(E)}\ .0499 \qquad$

Suppose that we are given an $n$-gon of which all sides have the same length, and of which all the vertices have rational coordinates. Prove that $n$ is even.

Find all integers $ n \ge 2 $ for which it is possible to divide any triangle $ T $ in triangles $ T_1, T_2, \cdots, T_n $ and choose medians $ m_1, m_2, \cdots, m_n $, one in each of these triangles, so that these $ n $ medians have equal length.

Let $a, b, c \in \mathbb{R}$ be such that $$a + b + c = a^2 + b^2 + c^2 = 1, \hspace{8px} a^3 + b^3 + c^3 \neq 1.$$ We say that a function $f$ is a [i]Palić function[/i] if $f: \mathbb{R} \rightarrow \mathbb{R}$, $f$ is continuous and satisfies $$f(x) + f(y) + f(z) = f(ax + by + cz) + f(bx + cy + az) + f(cx + ay + bz)$$ for all $x, y, z \in \mathbb{R}.$ Prove that any Palić function is infinitely many times differentiable and find all Palić functions.