There are two equal non-intersecting circles on a plane. Two lines were drawn. Each of the lines intersects the circles at four points so that the three segments formed on each of the lines are equal (segments with ends at adjacent points of intersection are considered). For one line these segments have length $a$, for the other they have length $b$ ($a < b$). Find the radius of the circles.

[b]p1.[/b] How many primes $p < 100$ satisfy $p = a^2 + b^2$ for some positive integers $a$ and $b$? [b]p2. [/b] For $a < b < c$, there exists exactly one Pythagorean triple such that $a + b + c = 2000$. Find $a + c - b$. [b]p3.[/b] Five points lie on the surface of a sphere of radius $ 1$ such that the distance between any two points is at least $\sqrt2$. Find the maximum volume enclosed by these five points. [b]p4.[/b] $ABCDEF$ is a convex hexagon with $AB = BC = CD = DE = EF = FA = 5$ and $AC = CE = EA = 6$. Find the area of $ABCDEF$. [b]p5.[/b] Joe and Wanda are playing a game of chance. Each player rolls a fair $11$-sided die, whose sides are labeled with numbers $1, 2, ... , 11$. Let the result of the Joe’s roll be $X$, and the result of Wanda’s roll be $Y$ . Joe wins if $XY$ has remainder $ 1$ when divided by $11$, and Wanda wins otherwise. What is the probability that Joe wins? [b]p6.[/b] Vivek picks a number and then plays a game. At each step of the game, he takes the current number and replaces it with a new number according to the following rule: if the current number $n$ is divisible by $3$, he replaces $n$ with $\frac{n}{3} + 2$, and otherwise he replaces $n$ with $\lfloor 3 \log_3 n \rfloor$. If he starts with the number $3^{2011}$, what number will he have after $2011$ steps? Note that $\lfloor x\rfloor$ denotes the largest integer less than or equal to $x$. [b]p7.[/b] Define a sequence an of positive real numbers with a$_1 = 1$, and $$a_{n+1} =\frac{4a^2_n - 1}{-2 + \frac{4a^2_n -1}{-2+ \frac{4a^2_n -1}{-2+...}}}.$$ What is $a_{2011}$? [b]p8.[/b] A set $S$ of positive integers is called good if for any $x, y \in S$ either $x = y$ or $|x - y| \ge 3$. How many subsets of $\{1, 2, 3, ..., 13\}$ are good? Include the empty set in your count. [b]p9.[/b] Find all pairs of positive integers $(a, b)$ with $a \le b$ such that $10 \cdot lcm \, (a, b) = a^2 + b^2$. Note that $lcm \,(m, n)$ denotes the least common multiple of $m$ and $n$. [b]p10.[/b] For a natural number $n$, $g(n)$ denotes the largest odd divisor of $n$. Find $$g(1) + g(2) + g(3) + ... + g(2^{2011})$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What algebraic relationship holds between $ A $, $ B $, and $ C $ if $$ctg A + \frac{\cos B}{\sin A \cos C} = ctg B + \frac{\cos A}{\sin B \cos C}.$$

Triangle $ABC$ has $AB=9$ and $BC: AC=40: 41$. What's the largest area that this triangle can have?

Let $T$ be the triangle in the coordinate plane with vertices $\left(0,0\right)$, $\left(4,0\right)$, and $\left(0,3\right)$. Consider the following five isometries (rigid transformations) of the plane: rotations of $90^{\circ}$, $180^{\circ}$, and $270^{\circ}$ counterclockwise around the origin, reflection across the $x$-axis, and reflection across the $y$-axis. How many of the $125$ sequences of three of these transformations (not necessarily distinct) will return $T$ to its original position? (For example, a $180^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by a reflection across the $y$-axis will return $T$ to its original position, but a $90^{\circ}$ rotation, followed by a reflection across the $x$-axis, followed by another reflection across the $x$-axis will not return $T$ to its original position.) $\textbf{(A) } 12\qquad\textbf{(B) } 15\qquad\textbf{(C) }17 \qquad\textbf{(D) }20 \qquad\textbf{(E) }25$

Compute the sum of all positive integers whose digits form either a strictly increasing or strictly decreasing sequence.

Segments connect vertices $A, B, C$ of $\vartriangle ABC$ with respective points $A_1, B_1, C_1$ on the opposite sides of the triangle. Prove that the midpoints of segments $AA_1, BB_1, CC_1$ do not belong to one straight line.

Let \( n \) be a positive integer. A function \( f : \{0, 1, \dots, n\} \to \{0, 1, \dots, n\} \) is called \( n \)-Bolivian if it satisfies the following conditions: • \( f(0) = 0 \); • \( f(t) \in \{ t-1, f(t-1), f(f(t-1)), \dots \} \) for all \( t = 1, 2, \dots, n \). For example, if \( n = 3 \), then the function defined by \( f(0) = f(1) = 0 \), \( f(2) = f(3) = 1 \) is 3-Bolivian, but the function defined by \( f(0) = f(1) = f(2) = 0 \), \( f(3) = 1 \) is not 3-Bolivian. For a fixed positive integer \( n \), Gollum selects an \( n \)-Bolivian function. Smeagol, knowing that \( f \) is \( n \)-Bolivian, tries to figure out which function was chosen by asking questions of the type: \[ \text{How many integers } a \text{ are there such that } f(a) = b? \] given a \( b \) of his choice. Show that if Gollum always answers correctly, Smeagol can determine \( f \) and find the minimum number of questions he needs to ask, considering all possible choices of \( f \).

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$ ?

Each of the $8$ vertices of a given cube is given a value $1$ or $-1$. Each of the $6$ faces is given the value of product of its four vertices. Let $A$ be the sum of all the $14$ values. Which are the possible values of $A$?

For positive integers $n \ge 3$ and $r \ge 1$, define $$P(n, r) = (n - 2)\frac{r^2}{2} - (n - 4) \frac{r}{2}$$ We call a triple $(a, b, c)$ of natural numbers, with $a \le b \le c$, an $n$-gonal Pythagorean triple if $P(n, a)+P(n, b) = P(n, c)$. (For $n = 4$, we get the usual Pythagorean triple.) (a) Find an $n$-gonal Pythagorean triple for each $n \ge 3$. (b) Consider all triangles $ABC$ whose sides are $n$-gonal Pythagorean triples for some $n \ge 3$. Find the maximum and the minimum possible values of angle $C$.

Given a positive integer $m,$ define the polynomial $$P_m(z) = z^4-\frac{2m^2}{m^2+1} z^3+\frac{3m^2-2}{m^2+1}z^2-\frac{2m^2}{m^2+1}z+1.$$ Let $S$ be the set of roots of the polynomial $P_5(z)\cdot P_7(z)\cdot P_8(z) \cdot P_{18}(z).$ Let $w$ be the point in the complex plane which minimizes $\sum_{z \in S} |z-w|.$ The value of $\sum_{z \in S} |z-w|^2$ equals $\tfrac{a}{b}$ for relatively prime positive integers $a$ and $b.$ Compute $a+b.$

For a positive integer $n$, denote by $\tau(n)$ the number of positive integer divisors of $n$, and denote by $\phi(n)$ the number of positive integers that are less than or equal to $n$ and relatively prime to $n$. Call a positive integer $n$ $\emph{good}$ if $\varphi (n) + 4\tau (n) = n$. For example, the number $44$ is good because $\varphi (44) + 4\tau (44)= 44$. Find the sum of all good positive integers $n$.

Suppose $(a,b)$ is an ordered pair of integers such that the three numbers $a$, $b$, and $ab$ form an arithmetic progression, in that order. Find the sum of all possible values of $a$. [i]Proposed by Nathan Xiong[/i]

Let $ABC$ be a given triangle. Find the locus $\mathbf M$ of all vertices $Z$ such that triangle $XYZ$ is equilateral where $X$ is any point of segment $AB$ and $Y\neq X$ lies on ray $AC.$

Let $G$ be an arbitrarily chosen finite simple graph. We write non-negative integers on the vertices of the graph such that for each vertex $v$ in $G,$ the number written on $v$ is equal to the number of vertices adjacent to $v$ where an even number is written. Prove that the number of ways to achieve this is a power of $2$.

In an isosceles triangle $ABC~(AC=BC)$, let $O$ be its circumcenter, $D$ the midpoint of $AC$ and $E$ the centroid of $DBC$. Show that $OE$ is perpendicular to $BD$.

Let $ABC$ be a triangle, and let $D$ be the point where the incircle meets side $BC$. Let $J_b$ and $J_c$ be the incentres of the triangles $ABD$ and $ACD$, respectively. Prove that the circumcentre of the triangle $AJ_bJ_c$ lies on the angle bisector of $\angle BAC$.

Determine all three integers $(x, y, z)$ that are solutions of the system $$x + y -z = 6$$ $$x^3 + y^3 -z^3 = 414$$

Determine all integer $n \ge 2$ such that it is possible to construct an $n * n$ array where each entry is either $-1, 0, 1$ so that the sums of elements in every row and every column are distinct

Show that there exists a positive integer $ k$ such that $ k \cdot 2^{n} \plus{} 1$ is composite for all $ n \in \mathbb{N}_{0}$.

Prove that \[\frac{1}{3}n^2 + \frac{1}{2}n + \frac{1}{6} \geq (n!)^{\frac{2}{n}},\] and let $n \geq 1$ be an integer. Prove that this inequality is only possible in the case $n = 1.$

Let $\alpha + \beta +\gamma = \pi$. Prove that $\sum_{cyc}{\sin 2\alpha} = 2\cdot \left(\sum_{cyc}{\sin \alpha}\right)\cdot\left(\sum_{cyc}{\cos \alpha}\right)- 2\sum_{cyc}{\sin \alpha}$.

A circle can be drawn around the quadrilateral $ABCD$. Let straight lines $AB$ and $CD$ intersect at point $M$, and straight lines $BC$ and $AD$ intersect at point $K$. (Points $B$ and $P$ lie on segments $AM$ and $AK$, respectively.) Let $P$ be the projection of point $M$ onto straight line $AK$, $L$ be the projection of point $K$ on the straight line $AM$. Prove that the straight line $LP$ divides the diagonal $BD$ in half.

A social network has $2019$ users, some pairs of whom are friends. Whenever user $A$ is friends with user $B$, user $B$ is also friends with user $A$. Events of the following kind may happen repeatedly, one at a time: [list] [*] Three users $A$, $B$, and $C$ such that $A$ is friends with both $B$ and $C$, but $B$ and $C$ are not friends, change their friendship statuses such that $B$ and $C$ are now friends, but $A$ is no longer friends with $B$, and no longer friends with $C$. All other friendship statuses are unchanged. [/list] Initially, $1010$ users have $1009$ friends each, and $1009$ users have $1010$ friends each. Prove that there exists a sequence of such events after which each user is friends with at most one other user. [i]Proposed by Adrian Beker, Croatia[/i]