A regular $n$-gon is inscribed in a circle of radius $1$. Let $a_1,\cdots,a_{n-1}$ be the distances of one of the vertices of the polygon to all the other vertices. Prove that \[(5-a_1^2)\cdots(5-a_{n-1}^2)=F_n^2\] where $F_n$ is the $n^{th}$ term of the Fibonacci sequence $1,1,2,\cdots$

In a quadrilateral \(ABCD\), it is known that \(\angle ABC = \angle ADC = 90^{\circ}\). On the ray \(AB\) beyond point \(B\), a point \(K\) is chosen such that \(\angle AKD = \angle ADB\). Point \(L\) is the projection of point \(K\) onto the line \(AD\), and point \(N\) is the projection of point \(D\) onto the line \(CL\). Find the degree measure of \(\angle ANK\). [i]Proposed by Mykhailo Shtandenko[/i]

The midpoint of the hypotenuse $AB$ of the right triangle $ABC$ is $K$. The point $M$ on the side $BC$ is taken such that $BM = 2 \cdot MC$. Prove that $\angle BAM = \angle CKM$.

Prove that for any convex quadrilateral it is always possible to cut out three smaller quadrilaterals similar to the original one with the scale factor equal to 1/2. (The angles of a smaller quadrilateral are equal to the corresponding original angles and the sides are twice smaller then the corresponding sides of the original quadrilateral.)

Let $ABC$ be a triangle with $AB<AC$ and $\omega$ be its circumcircle. The tangent line to $\omega$ at $A$ intersects line $BC$ at $D$ and let $E$ be a point on $\omega$ such that $BE$ is parallel to $AD$. $DE$ intersects segment $AB$ and $\omega$ at $F$ and $G$, respectively. The circumcircle of $BGF$ intersects $BE$ at $N$. The line $NF$ intersects lines $AD$ and $EA$ at $S$ and $T$, respectively. Prove that $DGST$ is cyclic.

The equiangular convex hexagon $ ABCDEF$ has $ AB \equal{} 1$, $ BC \equal{} 4$, $ CD \equal{} 2$, and $ DE \equal{} 4$. The area of the hexagon is $ \textbf{(A)}\ \frac{15}{2}\sqrt{3}\qquad \textbf{(B)}\ 9\sqrt{3}\qquad \textbf{(C)}\ 16\qquad \textbf{(D)}\ \frac{39}{4}\sqrt{3}\qquad \textbf{(E)}\ \frac{43}{4}\sqrt{3}$

Triangle $ ABC$ has $ AB\equal{}13$ and $ AC\equal{}15$, and the altitude to $ \overline{BC}$ has length $ 12$. What is the sum of the two possible values of $ BC$? $ \textbf{(A)}\ 15\qquad \textbf{(B)}\ 16\qquad \textbf{(C)}\ 17\qquad \textbf{(D)}\ 18\qquad \textbf{(E)}\ 19$

Points $C_1, B_1$ on sides $AB, AC$ respectively of triangle $ABC$ are such that $BB_1 \perp CC_1$. Point $X$ lying inside the triangle is such that $\angle XBC = \angle B_1BA, \angle XCB = \angle C_1CA$. Prove that $\angle B_1XC_1 =90^o- \angle A$. (A. Antropov, A. Yakubov)

Given points $O, A_1, A_2, ..., A_n$ on the plane. For any two of these points the square of distance between them is natural number. Prove that there exist two vectors $\vec{x}$ and $\vec{y}$, such that for any point $A_i$, $\vec{OA_i }= k\vec{x}+l \vec{y}$, where $k$ and $l$ are some integer numbers. (A.Glazyrin)

Let $ABCD$ be a square with circumcircle $\Gamma_1$. Let $P$ be a point on the arc $AC$ that also contains $B$. A circle $\Gamma_2$ touches $\Gamma_1$ in $P$ and also touches the diagonal $AC$ in $Q$. Let $R$ be a point on $\Gamma_2$ such that the line $DR$ touches $\Gamma_2$. Proof that $|DR| = |DA|$.

Let $ AD $, $ BE $ and $ CF $ be the altitudes of $ \Delta ABC $. The points $ P, \, \, Q, \, \, R $ and $ S $ are the feet of the perpendiculars drawn from the point $ D $ on the segments $ BA $, $ BE $, $ CF $ and $ CA $, respectively. Prove that the points $ P, \, \, Q, \, \, R $ and $ S $ are collinear.

In a country, towns are connected by roads. Each town is directly connected to exactly three other towns. Show that there exists a town from which you can make a round-trip, without using the same road more than once, and for which the number of roads used is not divisible by $3$. (Not all towns need to be visited.)

In a convex quadrilateral $ABCD$, $BD$ is the angle bisector of $\angle{ABC}$. The circumcircle of $ABC$ intersects $CD,AD$ in $P,Q$ respectively and the line through $D$ parallel to $AC$ cuts $AB,AC$ in $R,S$ respectively. Prove that point $P,Q,R,S$ lie on a circle.

$A_0B, A_0C$ rays that satisfy $\angle BA_0C=14^{\circ}$. You are to place points $A_1, A_2, ...$ by the following rules. [b]Rules[/b] (1) On the first move, place $A_1$ on any point on $A_0B$(except $A_0$). (2) On the $n>1$th move, place $A_n$ on $A_0B$ iff $A_{n-1}$ is on $A_0C$, and place $A_n$ on $A_0C$ iff $A_{n-1}$ is one $A_0B$. $A_n$ must be place on the point that satisfies $A_{n-2}A_n{n-1}=A_{n-1}A_n$. All the points must be placed in different locations. What is the maximum number of points that can be placed?

Let $ABC$ be a triangle. The incircle of triangle $ABC$ touches the side $BC$ at $A^{\prime}$, and the line $AA^{\prime}$ meets the incircle again at a point $P$. Let the lines $CP$ and $BP$ meet the incircle of triangle $ABC$ again at $N$ and $M$, respectively. Prove that the lines $AA^{\prime}$, $BN$ and $CM$ are concurrent.

Let $H$ be the orthocenter of triangle $\mathrm T$. The sidelines of triangle $\mathrm T_1$ pass through the midpoints of $\mathrm T$ and are perpendicular to the corresponding bisectors of $\mathrm T$. The vertices of triangle $\mathrm T_2$ bisect the bisectors of $\mathrm T$. Prove that the lines joining $H$ with the vertices of $\mathrm T_1$ are perpendicular to the sidelines of $\mathrm T_2$.

A rectangle with sides $ n$ and $p$ is divided into $np$ unit squares. Initially there are m unitary squares painted black and the remaining painted white. The following processoccurs repeatedly: if a unit square painted white has at minus two sides in common with squares painted black then Its color also turns black. Find the smallest integer $m$ that satisfies the property: there exists an initial position of $m$ black unit squares such that the entire $ n \times p$ rectangle is painted black when repeat the process a finite number of times.

In triangle $ABC$, $AB = 52$, $BC = 34$ and $CA = 50$. We split $BC$ into $n$ equal segments by placing $n-1$ new points. Among these points are the feet of the altitude, median and angle bisector from $A$. What is the smallest possible value of $n$?

Is it possible to choose a sphere, a triangular pyramid and a plane so that every plane, parallel to the chosen one, intersects the sphere and the pyramid in sections of equal area? (Problem from Latvia)

Let the interior point $P$ of the convex quadrilateral $ABCD$ be such that $$|\angle PAD| = |\angle ADP| = |\angle CBP| = |\angle PCB| = |\angle CPD|.$$ Let $O$ be the center of the circumcircle of the triangle $CPD$. Prove that $|OA| = |OB|$.

Rectangle $ABCD$ has sides $CD=3$ and $DA=5$. A circle of radius $1$ is centered at $A$, a circle of radius $2$ is centered at $B$, and a circle of radius $3$ is centered at $C$. Which of the following is closest to the area of the region inside the rectangle but outside all three circles? [asy] draw((0,0)--(5,0)--(5,3)--(0,3)--(0,0)); draw(Circle((0,0),1)); draw(Circle((0,3),2)); draw(Circle((5,3),3)); label("A",(0.2,0),W); label("B",(0.2,2.8),NW); label("C",(4.8,2.8),NE); label("D",(5,0),SE); label("5",(2.5,0),N); label("3",(5,1.5),E); [/asy] $\textbf{(A) }3.5\qquad\textbf{(B) }4.0\qquad\textbf{(C) }4.5\qquad\textbf{(D) }5.0\qquad \textbf{(E) }5.5$

[b]p1.[/b] An ant starts at the top vertex of a triangular pyramid (tetrahedron). Each day, the ant randomly chooses an adjacent vertex to move to. What is the probability that it is back at the top vertex after three days? [b]p2.[/b] A square “rolls” inside a circle of area $\pi$ in the obvious way. That is, when the square has one corner on the circumference of the circle, it is rotated clockwise around that corner until a new corner touches the circumference, then it is rotated around that corner, and so on. The square goes all the way around the circle and returns to its starting position after rotating exactly $720^o$. What is the area of the square? [b]p3.[/b] How many ways are there to fill a $3\times 3$ grid with the integers $1$ through $9$ such that every row is increasing left-to-right and every column is increasing top-to-bottom? [b]p4.[/b] Noah has an old-style M&M machine. Each time he puts a coin into the machine, he is equally likely to get $1$ M&M or $2$ M&M’s. He continues putting coins into the machine and collecting M&M’s until he has at least $6$ M&M’s. What is the probability that he actually ends up with $7$ M&M’s? [b]p5.[/b] Erik wants to divide the integers $1$ through $6$ into nonempty sets $A$ and $B$ such that no (nonempty) sum of elements in $A$ is a multiple of $7$ and no (nonempty) sum of elements in $B$ is a multiple of $7$. How many ways can he do this? (Interchanging $A$ and $B$ counts as a different solution.) [b]p6.[/b] A subset of $\{1, 2, 3, 4, 5, 6, 7, 8\}$ of size $3$ is called special if whenever $a$ and $b$ are in the set, the remainder when $a + b$ is divided by $8$ is not in the set. ($a$ and $b$ can be the same.) How many special subsets exist? [b]p7.[/b] Let $F_1 = F_2 = 1$, and let $F_n = F_{n-1} + F_{n-2}$ for all $n \ge 3$. For each positive integer $n$, let $g(n)$ be the minimum possible value of $$|a_1F_1 + a_2F_2 + ...+ a_nF_n|,$$ where each $a_i$ is either $1$ or $-1$. Find $g(1) + g(2) +...+ g(100)$. [b]p8.[/b] Find the smallest positive integer $n$ with base-$10$ representation $\overline{1a_1a_2... a_k}$ such that $3n = \overline{a_1a_2


a_k1}$. [b]p9.[/b] How many ways are there to tile a $4 \times 6$ grid with $L$-shaped triominoes? (A triomino consists of three connected $1\times 1$ squares not all in a line.) [b]p10.[/b] Three friends want to share five (identical) muffins so that each friend ends up with the same total amount of muffin. Nobody likes small pieces of muffin, so the friends cut up and distribute the muffins in such a way that they maximize the size of the smallest muffin piece. What is the size of this smallest piece? [u]Numerical tiebreaker problems:[/u] [b]p11.[/b] $S$ is a set of positive integers with the following properties: (a) There are exactly 3 positive integers missing from $S$. (b) If $a$ and $b$ are elements of $S$, then $a + b$ is an element of $S$. (We allow $a$ and $b$ to be the same.) How many possibilities are there for the set $S$? [b]p12.[/b] In the trapezoid $ABCD$, both $\angle B$ and $\angle C$ are right angles, and all four sides of the trapezoid are tangent to the same circle. If $\overline{AB} = 13$ and $\overline{CD} = 33$, find the area of $ABCD$. [b]p13.[/b] Alice wishes to walk from the point $(0, 0)$ to the point $(6, 4)$ in increments of $(1, 0)$ and $(0, 1)$, and Bob wishes to walk from the point $(0, 1)$ to the point $(6, 5)$ in increments of $(1, 0)$ and $(0,1)$. How many ways are there for Alice and Bob to get to their destinations if their paths never pass through the same point (even at different times)? [b]p14.[/b] The continuous function $f(x)$ satisfies $9f(x + y) = f(x)f(y)$ for all real numbers $x$ and $y$. If $f(1) = 3$, what is $f(-3)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

What is the largest number of points that can exist on a plane so that each distance between any two of them is an odd integer?

Prove that all the heights of a tetrahedron intersect at one point if and only if the sums of the squares of the opposite edges are equal.

Let $P,Q,R$ be points on the same side of a line $g$ in the plane. Let $M$ and $N$ be the feet of the perpendiculars from $P$ and $Q$ to $g$ respectively. Point $S$ lies between the lines $PM$ and $QN$ and satisfies and satisfies $PM = PS$ and $QN = QS$. The perpendicular bisectors of $SM$ and $SN$ meet in a point $R$. If the line $RS$ intersects the circumcircle of triangle $PQR$ again at $T$, prove that $S$ is the midpoint of $RT$.