Given a triangle $A_1 A_2 A_3$, let $a_i$ denote the side opposite to $A_i$, where indices are taken modulo 3. Let $D_1 \in a_1$. For $D_i \in A_i$, let $\omega_i$ be the incircle of the triangle formed by lines $a_i, a_{i+1}, A_iD_i$, and $D_{i+1} \in a_{i+1}$ with $A_{i+1} D_{i+1}$ tangent to $\omega_i$. Show that the set $\{D_i: i \in \mathbb{N}\}$ is finite.

Let $R$ and $r$ be the radii of the circles circumscribed and inscribed, respectively, in a triangle. Prove that $R \ge 2r$, and that $R = 2r$ only for an equilateral triangle.

In the coordinate plane, given a circle $K: x^2+y^2=1,\ C: y=x^2-2$. Let $l$ be the tangent line of $K$ at $P(\cos \theta,\ \sin \theta)\ (\pi<\theta <2\pi).$ Find the minimum area of the part enclosed by $l$ and $C$.

A Pythagorean triangle is a right triangle whose three sides are integers. The best known example is the triangle with rectangular sides $3$ and $4$ and hypotenuse $5$. Determine all Pythagorean triangles whose area is twice the perimeter.

In a classroom there are $m$ students. During the month of July each of them visited the library at least once but none of them visited the library twice in the same day. It turned out that during the month of July each student visited the library a different number of times, furthermore for any two students $A$ and $B$ there was a day in which $A$ visited the library and $B$ did not and there was also a day when $B$ visited the library and $A$ did not do so. Determine the largest possible value of $m$.

A sequence of integers $a_0, a_1 …$ is called [i]kawaii[/i] if $a_0 =0, a_1=1,$ and $$(a_{n+2}-3a_{n+1}+2a_n)(a_{n+2}-4a_{n+1}+3a_n)=0$$ for all integers $n \geq 0$. An integer is called [i]kawaii[/i] if it belongs to some kawaii sequence. Suppose that two consecutive integers $m$ and $m+1$ are both kawaii (not necessarily belonging to the same kawaii sequence). Prove that $m$ is divisible by $3,$ and that $m/3$ is also kawaii.

There are 100 positive integers written on a board. At each step, Alex composes 50 fractions using each number written on the board exactly once, brings these fractions to their irreducible form, and then replaces the 100 numbers on the board with the new numerators and denominators to create 100 new numbers. Find the smallest positive integer $n{}$ such that regardless of the values of the initial 100 numbers, after $n{}$ steps Alex can arrange to have on the board only pairwise coprime numbers.

[b]p1.[/b] Two players play the following game. On the lowest left square of an $8 \times 8$ chessboard there is a rook (castle). The first player is allowed to move the rook up or to the right by an arbitrary number of squares. The second layer is also allowed to move the rook up or to the right by an arbitrary number of squares. Then the first player is allowed to do this again, and so on. The one who moves the rook to the upper right square wins. Who has a winning strategy? [b]p2.[/b] Find the smallest positive whole number that ends with $17$, is divisible by $17$, and the sum of its digits is $17$. [b]p3.[/b] Three consecutive $2$-digit numbers are written next to each other. It turns out that the resulting $6$-digit number is divisible by $17$. Find all such numbers. [b]p4.[/b] Let $ABCD$ be a convex quadrilateral (a quadrilateral $ABCD$ is called convex if the diagonals $AC$ and $BD$ intersect). Suppose that $\angle CBD = \angle CAB$ and $\angle ACD = \angle BDA$ . Prove that $\angle ABC = \angle ADC$. [b]p5.[/b] A circle of radius $1$ is cut into four equal arcs, which are then arranged to make the shape shown on the picture. What is its area? [img]https://cdn.artofproblemsolving.com/attachments/f/3/49c3fe8b218ab0a5378ecc635b797a912723f9.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Kim earned scores of 87,83, and 88 on her first three mathematics examinations. If Kim receives a score of 90 on the fourth exam, then her average will $\textbf{(A)}\ \text{remain the same} \qquad \textbf{(B)}\ \text{increase by 1} \qquad \textbf{(C)}\ \text{increase by 2} \qquad \textbf{(D)}\ \text{increase by 3} \qquad \textbf{(E)}\ \text{increase by 4}$

Suppose that $m$ and $n$ are positive integers with $m < n$ such that the interval $[m, n)$ contains more multiples of $2021$ than multiples of $2000$. Compute the maximum possible value of $n - m$.

Find the smallest and largest integers with decimal representation of the form $ababa$ ($a \neq 0$) that are divisible by $11$.

Given positive integers $p$, $u$, and $v$ such that $u^2+2v^2=p$, determine, in terms of $u$ and $v$, integers $m$ and $n$ such that $3m^2-2mn+3n^2=24p$. (It is known that if $p$ is any prime number congruent to 1 or 3 modulo 8, then we can find integers $u$ and $v$ such that $u^2+2v^2=p$)

For how many pairs of primes $(p, q)$, is $p^2 + 2pq^2 + 1$ also a prime?

Points $B$,$D$ , and $J$ are midpoints of the sides of right triangle $ACG$ . Points $K$, $E$, $I$ are midpoints of the sides of triangle , etc. If the dividing and shading process is done 100 times (the first three are shown) and $ AC=CG=6 $, then the total area of the shaded triangles is nearest [asy] draw((0,0)--(6,0)--(6,6)--cycle); draw((3,0)--(3,3)--(6,3)); draw((4.5,3)--(4.5,4.5)--(6,4.5)); draw((5.25,4.5)--(5.25,5.25)--(6,5.25)); fill((3,0)--(6,0)--(6,3)--cycle,black); fill((4.5,3)--(6,3)--(6,4.5)--cycle,black); fill((5.25,4.5)--(6,4.5)--(6,5.25)--cycle,black); label("$A$",(0,0),SW); label("$B$",(3,0),S); label("$C$",(6,0),SE); label("$D$",(6,3),E); label("$E$",(6,4.5),E); label("$F$",(6,5.25),E); label("$G$",(6,6),NE); label("$H$",(5.25,5.25),NW); label("$I$",(4.5,4.5),NW); label("$J$",(3,3),NW); label("$K$",(4.5,3),S); label("$L$",(5.25,4.5),S);[/asy] $ \text{(A)}\ 6\qquad\text{(B)}\ 7\qquad\text{(C)}\ 8\qquad\text{(D)}\ 9\qquad\text{(E)}\ 10 $

In a group of $2n$ students, each student has exactly $3$ friends within the group. The friendships are mutual and for each two students $A$ and $B$ which are not friends, there is a sequence $C_1, C_2, ..., C_r$ of students such that $A$ is a friend of $C_1$, $C_1$ is a friend of $C_2$, et cetera, and $C_r$ is a friend of $B$. Every student was asked to assess each of his three friendships with: "acquaintance", "friend" and "BFF". It turned out that each student either gave the same assessment to all of his friends or gave every assessment exactly once. We say that a pair of students is in conflict if they gave each other different assessments. Let $D$ be the set of all possible values of the total number of conflicts. Prove that $|D| \geq 3n$ with equality if and only if the group can be partitioned into two subsets such that each student is separated from all of his friends.

Since counting the numbers from 1 to 100 wasn't enough to stymie Gauss, his teacher devised another clever problem that he was sure would stump Gauss. Defining $\zeta_{15} = e^{2\pi i/15}$ where $i = \sqrt{-1}$, the teacher wrote the 15 complex numbers $\zeta_{15}^k$ for integer $0 \le k < 15$ on the board. Then, he told Gauss: On every turn, erase two random numbers $a, b$, chosen uniformly randomly, from the board and then write the term $2ab - a - b + 1$ on the board instead. Repeat this until you have one number left. What is the expected value of the last number remaining on the board?

There are $200$ numbers on a blackboard: $ 1! , 2! , 3! , 4! , ... ... , 199! , 200!$. Julia erases one of the numbers. When Julia multiplies the remaining $199$ numbers, the product is a perfect square. Which number was erased?

Let $ H(n)$ be the number of simply connected subsets with $ n$ hexagons in an infinite hexagonal network. Also let $ P(n)$ be the number of paths starting from a fixed vertex (that do not connect itself) with lentgh $ n$ in this hexagonal network. a) Prove that the limits \[ \alpha: \equal{}\lim_{n\rightarrow\infty}H(n)^{\frac1n}, \beta: \equal{}\lim_{n\rightarrow\infty}P(n)^{\frac1n}\]exist. b) Prove the following inequalities: $ \sqrt2\leq\beta\leq2$ $ \alpha\leq 12.5$ $ \alpha\geq3.5$ $ \alpha\leq\beta^4$

Find all monic polynomials $f$ with integer coefficients satisfying the following condition: there exists a positive integer $N$ such that $p$ divides $2(f(p)!)+1$ for every prime $p>N$ for which $f(p)$ is a positive integer. [i]Note: A monic polynomial has a leading coefficient equal to 1.[/i] [i](Greece - Panagiotis Lolas and Silouanos Brazitikos)[/i]

Find all 6-digit numbers $a_1a_2a_3a_4a_5a_6$ formed by using the digits $1,2,3,4,5,6$ once each such that the number $a_1a_2a_2\ldots a_k$ is divisible by $k$ for $1 \leq k \leq 6$.

$h_a$, $h_b$ and $h_c$ are altitudes, $t_a$, $t_b$ and $t_c$ are medians of acute triangle, $r$ radius of incircle, and $R$ radius of circumcircle of acute triangle $ABC$. Prove that $$\frac{t_a}{h_a}+\frac{t_b}{h_b}+\frac{t_c}{h_c} \leq 1+ \frac{R}{r}$$

Determine all real numbers $x$ such that $$\frac{2002\lfloor x\rfloor}{\lfloor-x\rfloor+x}>\frac{\lfloor2x\rfloor}{x-\lfloor1+x\rfloor}.$$

Let $ABC$ be an isosceles right triangle at $A$ with $AB=AC$. Let $M$ and $N$ be on side $BC$, with $M$ between $B$ and $N,$ such that $$BM^2+ NC^2= MN^2.$$ Determine the measure of the angle $\angle MAN.$

In order to draw a graph of $ f(x) \equal{} ax^2 \plus{} bx \plus{} c$, a table of values was constructed. These values of the function for a set of equally spaced increasing values of $ x$ were $ 3844$, $ 3969$, $ 4096$, $ 4227$, $ 4356$, $ 4489$, $ 4624$, and $ 4761$. The one which is incorrect is: $ \textbf{(A)}\ 4096 \qquad\textbf{(B)}\ 4356 \qquad\textbf{(C)}\ 4489 \qquad\textbf{(D)}\ 4761 \qquad\textbf{(E)}\ \text{none of these}$

Let $ABC$ be an isosceles triangle ($AB=AC$) with incenter $I$. Circle $\omega$ passes through $C$ and $I$ and is tangent to $AI$. $\omega$ intersects $AC$ and circumcircle of $ABC$ at $Q$ and $D$, respectively. Let $M$ be the midpoint of $AB$ and $N$ be the midpoint of $CQ$. Prove that $AD$, $MN$ and $BC$ are concurrent. [i]Proposed by Alireza Dadgarnia[/i]