Given a triangle in which the sides $ a $, $ b $, $ c $ form an arithmetic progression and the angles also form an arithmetic progression. Find the ratios of the sides of this triangle.

Given sequence $ \{ c_n \}$ satisfying the conditions that $ c_0\equal{}1$, $ c_1\equal{}0$, $ c_2\equal{}2005$, and $ c_{n\plus{}2}\equal{}\minus{}3c_n \minus{} 4c_{n\minus{}1} \plus{}2008$, ($ n\equal{}1,2,3, \cdots$). Let $ \{ a_n \}$ be another sequence such that $ a_n\equal{}5(c_{n\plus{}1} \minus{} c_n) \cdot (502 \minus{} c_{n\minus{}1} \minus{} c_{n\minus{}2}) \plus{} 4^n \times 2004 \times 501$, ($ n\equal{}2,3, \cdots$). Is $ a_n$ a perfect square for every $ n > 2$?

A positive integer $k$ is said to be [i]good [/i] if there exists a partition of $ \{1, 2, 3,..., 20\}$ into disjoint proper subsets such that the sum of the numbers in each subset of the partition is $k$. How many [i]good [/i] numbers are there?

A finite set $S$ of points in the coordinate plane is called [i]overdetermined[/i] if $|S|\ge 2$ and there exists a nonzero polynomial $P(t)$, with real coefficients and of degree at most $|S|-2$, satisfying $P(x)=y$ for every point $(x,y)\in S$. For each integer $n\ge 2$, find the largest integer $k$ (in terms of $n$) such that there exists a set of $n$ distinct points that is [i]not[/i] overdetermined, but has $k$ overdetermined subsets. [i]Proposed by Carl Schildkraut[/i]

Prove that for every $n$ nonzero integer , there are infinite triples of nonzero integers $a, b$ and $c$ that satisfy the conditions: 1. $a + b + c = n$ 2. $ax^2 + bx + c = 0$ has rational roots.

Triangle $ABC$ has a right angle at $B$. Point $D$ lies on side $BC$ such that $3\angle BAD = \angle BAC$. Given $AC=2$ and $CD=1$, compute $BD$.

Find the smallest positive integer $n$ such that $n^2+4$ has at least four distinct prime factors. [i]Proposed by Michael Tang[/i]

$a,b,m,k\in \mathbb{Z}$, $a,b,m>2,k>1$, for which $k^n a+b$ is an $m$-th power of a natural number for $\forall n\in \mathbb{N}$. Prove that $b$ is an $m$-th power of a non-negative integer.

Euhan and Minjune are playing a game. They choose a number $N$ so that they can only say integers up to $N$. Euhan starts by saying the $1$, and each player takes turns saying either $n+1$ or $4n$ (if possible), where $n$ is the last number said. The player who says $N$ wins. What is the smallest number larger than $2019$ for which Minjune has a winning strategy? [i]Proposed by Janabel Xia[/i]

The circle $\omega{}$ is inscribed in the quadrilateral $ABCD$. Prove that the diameter of the circle $\omega{}$ does not exceed the length of the segment connecting the midpoints of the sides $BC$ and $AD$. [i]Proposed by O. Yuzhakov[/i]

A circle that passes through the vertex $A$ of a rectangle $ABCD$ intersects the side $AB$ at a second point $E$ different from $B.$ A line passing through $B$ is tangent to this circle at a point $T,$ and the circle with center $B$ and passing through $T$ intersects the side $BC$ at the point $F.$ Show that if $\angle CDF= \angle BFE,$ then $\angle EDF=\angle CDF.$

The numbers $2^{1989}$ and $5^{1989}$ are written out one after the other (in decimal notation). How many digits are written altogether? (G. Galperin)

Let $ n$ be a natural number $ \ge 2$ which divides $ 3^n\plus{}4^n$.Prove That $ 7\mid n$.

A lattice point is a point in the plane with integer coordinates. How many lattice points are on the line segment whose endpoints are (3,17) and (48,281)? (Include both endpoints of the segment in your count.) $\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 6 \qquad \textbf{(D)}\ 16 \qquad \textbf{(E)}\ 46$

Find the smallest positive number $\lambda $ , such that for any complex numbers ${z_1},{z_2},{z_3}\in\{z\in C\big| |z|<1\}$ ,if $z_1+z_2+z_3=0$, then $$\left|z_1z_2 +z_2z_3+z_3z_1\right|^2+\left|z_1z_2z_3\right|^2 <\lambda .$$

Determine all non-constant polynomials $X^n+a_{n-1}X^{n-1}+\cdots +a_1X+a_0$ with integer coefficients for which the roots are exactly the numbers $a_0,a_1,\ldots ,a_{n-1}$ (with multiplicity).

In the acute-angled triangle $ ABC $, the sides $ AB $ and $BC$ have different lengths, and the extension of the median $ BM $ intersects the circumscribed circle at the point $ N $. On this circle we note such a point $ D $ that $ \angle BDH = 90 {} ^ \circ $, where $ H $ is the point of intersection of the altitudes of the triangle $ ABC $. The point $K$ is chosen so that $ ANCK $ is a parallelogram. Prove that the lines $ AC $, $ KH $ and $ BD $ intersect at one point. (Igor Nagel)

Circles $C_1$ and $C_2$ with centers $O_1$ and $O_2$ respectively lie on a plane such that that the circle $C_2$ passes through $O_1$. The ratio of radius of circle $C_1$ to $O_1O_2$ is $\sqrt{2+\sqrt3}$. a) Prove that the circles $C_1$ and $C_2$ intersect at two distinct points. b) Let $A,B$ be these points of intersection. What proportion of the area of circle is $C_1$ is the area of the sector $AO_1B$ ?

Let $ABC$ be an acute-angled triangle, let $M$ be the midpoint of $BC$ and let $H$ be the foot of the $B$-altitude. Let $Q$ be the circumcenter of $ABM$ and let $X$ be the intersection point between $BH$ and the axis of $BC$. Show that the circumcircles of the two triangles $ACM$, $AXH$ and the line $CQ$ pass through a same point if and only if $BQ$ is perpendicular to $CQ$.

Let $ [t]$ denote the greatest integer $ \leq t$ where $ t \geq 0$ and $ S \equal{} \{(x,y): (x\minus{}T)^2 \plus{} y^2 \leq T^2 \text{ where } T \equal{} t \minus{} [t]\}$. Then we have $ \textbf{(A)}\ \text{the point } (0,0) \text{ does not belong to } S \text{ for any } t \qquad$ $ \textbf{(B)}\ 0 \leq \text{Area } S \leq \pi \text{ for all } t \qquad$ $ \textbf{(C)}\ S \text{ is contained in the first quadrant for all } t \geq 5 \qquad$ $ \textbf{(D)}\ \text{the center of } S \text{ for any } t \text{ is on the line } y\equal{}x \qquad$ $ \textbf{(E)}\ \text{none of the other statements is true}$

Determine the maximal length $L$ of a sequence $a_1,\dots,a_L$ of positive integers satisfying both the following properties: [list=disc] [*]every term in the sequence is less than or equal to $2^{2023}$, and [*]there does not exist a consecutive subsequence $a_i,a_{i+1},\dots,a_j$ (where $1\le i\le j\le L$) with a choice of signs $s_i,s_{i+1},\dots,s_j\in\{1,-1\}$ for which \[s_ia_i+s_{i+1}a_{i+1}+\dots+s_ja_j=0.\] [/list]

Ms. Blackwell gives an exam to two classes. The mean of the scores of the students in the morning class is $84$, and the afternoon class’s mean score is $70$. The ratio of the number of students in the morning class to the number of students in the afternoon class is $\frac{3}{4}$. What is the mean of the scores of all the students? $\textbf{(A) }74 \qquad \textbf{(B) }75 \qquad \textbf{(C) }76 \qquad \textbf{(D) }77 \qquad \textbf{(E) }78$

For a positive integer $m$, let $f(m)$ denote the smallest power of $2024$ not less than $m$ (e.g. $f(1)=1, f(2023)=f(2024)=2024,$ and $f(2025)=2024^2$). Find all positive real numbers $c$ for which there exists a sequence $x_1,x_2,\cdots$ of real numbers in $[0,1]$ such that $$|x_m-x_n|\geq\frac{c}{f(m)}$$ for all positive integers $m>n\geq1$. Proposed by Shantanu Nene

The Magician and his Assistant show trick. The Viewer writes on the board the sequence of $N$ digits. Then the Assistant covers some pair of adjacent digits so that they become invisible. Finally, the Magician enters the show, looks at the board and guesses the covered digits and their order. Find the minimal $N$ such that the Magician and his Assistant can agree in advance so that the Magician always guesses right

Circle $B$, which has radius 2008, is tangent to horizontal line $A$ at point $P$. Circle $C_1$ has radius 1 and is tangent both to circle $B$ and to line $A$ at a point to the right of point $P$. Circle $C_2$ has radius larger than 1 and is tangent to line $A$ and both circles B and $C_1$. For $n>1$, circle $C_n$ is tangent to line $A$ and both circles $B$ and $C_{n-1}$. Find the largest value of n such that this sequence of circles can be constructed through circle $C_n$ where the n circles are all tangent to line $A$ at points to the right of $P$. [asy] size(300); draw((-10,0)--(10,0)); draw(arc((0,10),10,210,330)); label("$P$",(0,0),S); pair C=(0,10),X=(12,3); for(int kk=0;kk<6;++kk) { pair Y=(X.x-X.y,X.y); for(int k=0;k<20;++k) Y+=(abs(Y-X)-X.y-Y.y,abs(Y-C)-10-Y.y)/3; draw(circle(Y,Y.y)); X=Y; }[/asy]