$z$ is a complex number and $|z|=1$ and $z^2\ne1$. Then $\frac z{1-z^2}$ lies on $\textbf{(A)}~\text{a line not through origin}$ $\textbf{(B)}~\text{|z|=2}$ $\textbf{(C)}~x-\text{axis}$ $\textbf{(D)}~y-\text{axis}$

In a small town, there are $n \times n$ houses indexed by $(i, j)$ for $1 \leq i, j \leq n$ with $(1, 1)$ being the house at the top left corner, where $i$ and $j$ are the row and column indices, respectively. At time 0, a fire breaks out at the house indexed by $(1, c)$, where $c \leq \frac{n}{2}$. During each subsequent time interval $[t, t+1]$, the fire fighters defend a house which is not yet on fire while the fire spreads to all undefended [i]neighbors[/i] of each house which was on fire at time t. Once a house is defended, it remains so all the time. The process ends when the fire can no longer spread. At most how many houses can be saved by the fire fighters? A house indexed by $(i, j)$ is a [i]neighbor[/i] of a house indexed by $(k, l)$ if $|i - k| + |j - l|=1$.

Let $ x_1,x_2,\dots,x_n$ be positive real numbers. Let $ m\equal{}\min\{x_1,x_2,\dots,x_n\}$, $ M\equal{}\max\{x_1,x_2,\dots,x_n\}$, $ A\equal{}\frac{1}{n}(x_1\plus{}x_2\plus{}\dots\plus{}x_n)$, and $ G\equal{}\sqrt[n]{x_1x_2 \dots x_n}$. Prove that \[ A\minus{}G \ge \frac{1}{n}(\sqrt{M}\minus{}\sqrt{m})^2.\]

On each day of their tour of the West Indies, Sourav and Srinath have either an apple or an orange for breakfast. Sourav has oranges for the first $m$ days, apples for the next $m$ days, followed by oranges for the next $m$ days, and so on. Srinath has oranges for the first $n$ days, apples for the next $n$ days, followed by oranges for the next $n$ days, and so on. If $\gcd(m,n)=1$, and if the tour lasted for $mn$ days, on how many days did they eat the same kind of fruit?

Let $u_n$ denote the least common multiple of the first $n$ terms of a strictly increasing sequence of positive integers. Prove that the series $$\sum_{n=1}^{\infty} \frac{1}{ u_n }$$ is convergent

Segment $ AB$ is fixed in plane. Find the largest $ n$, such that there are $ n$ points $ P_1,P_2,\dots,P_n$ in plane that triangles $ ABP_i$ are similar for $ 1\leq i\leq n$. Prove that all of $ P_i$'s lie on a circle.

Which point on the circle $ (x \minus{} 11)^2 \plus{} (y \minus{} 13)^2 \equal{} 116$ is farthest from the point $ (41, 25)$?

Real numbers $x$ and $y$ satisfy the equation $x^2+y^2=10x-6y-34$. What is $x+y$? $ \textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }6\qquad\textbf{(E) }8 $

Numbers $1,2,3,...,2n$ are divided onto two equal groups. Let $a_1,a_2,...,a_n$ be the first group numbers in the increasing order, and $b_1,b_2,...,b_n$ -- the second group numbers in the decreasing order. Prove that $$|a_1 - b_1| + |a_2 - b_2| + ... + |a_n - b_n| = n^2$$

Calculate $\sqrt{5,44...4}$ (the decimal point is followed by $100$ fours) with approximation to: a) $10^{-100}$, b) $10^{-200}$

The Bank of Bath issues coins with an $H$ on one side and a $T$ on the other. Harry has $n$ of these coins arranged in a line from left to right. He repeatedly performs the following operation: if there are exactly $k>0$ coins showing $H$, then he turns over the $k$th coin from the left; otherwise, all coins show $T$ and he stops. For example, if $n=3$ the process starting with the configuration $THT$ would be $THT \to HHT \to HTT \to TTT$, which stops after three operations. (a) Show that, for each initial configuration, Harry stops after a finite number of operations. (b) For each initial configuration $C$, let $L(C)$ be the number of operations before Harry stops. For example, $L(THT) = 3$ and $L(TTT) = 0$. Determine the average value of $L(C)$ over all $2^n$ possible initial configurations $C$. [i]Proposed by David Altizio, USA[/i]

Consider triangle $ABC$ on the coordinate plane with $A = (2, 3)$ and $C =\left( \frac{96}{13} , \frac{207}{13} \right)$. Let $B$ be the point with the smallest possible $y$-coordinate such that $AB = 13$ and $BC = 15$. Compute the coordinates of the incenter of triangle $ABC$.

Let $A=[0,0]$ and $B=[n,n]$. In how many ways can we go from $A$ to $B$, if we always want to go from lattice point to its neighbour (i.e. point with one coordinate the same and one smaller or bigger by one), we never want to visit the same point twice and we want our path to have length $2n+2$? (For example, path $[0,0],[0,1],[-1,1],[-1,2],[0,2],[1,2],[2,2],[2,3],[3,3]$ is one of the paths for $n=3$)

A sequence of positive integers $a_1, a_2, \ldots$ satisfies $a_k + a_l = a_m + a_n$ for all positive integers $k,l,m,n$ satisfying $kl = mn$. Prove that if $p$ divides $q$ then $a_p \le a_q$.

For every positive integer $n$, let $p(n)$ denote the number of sets $\{x_1, x_2, \dots, x_k\}$ of integers with $x_1 > x_2 > \dots > x_k > 0$ and $n = x_1 + x_3 + x_5 + \dots$ (the right hand side here means the sum of all odd-indexed elements). As an example, $p(6) = 11$ because all satisfying sets are as follows: $$\{6\}, \{6, 5\}, \{6, 4\}, \{6, 3\}, \{6, 2\}, \{6, 1\}, \{5, 4, 1\}, \{5, 3, 1\}, \{5, 2, 1\}, \{4, 3, 2\}, \{4, 3, 2, 1\}.$$ Show that $p(n)$ equals to the number of partitions of $n$ for every positive integer $n$.

The base $ABC$ of a tetrahedron $MABC$ is an equilateral triangle, and the lateral edges $MA,MB,MC$ are sides of a triangle of the area $S$. If $R$ is the circumradius and $V$ the volume of the tetrahedron, prove that $RS\ge2V$. When does equality hold?

Define sequence $(a_n):a_1=\text{e},a_2=\text{e}^3,\text{e}^{1-k}a_n^{k+2}=a_{n+1}a_{n-1}^{2k}$ for all $n\geq2$, where $k$ is a positive real number. Find $\prod_{i=1}^{2017}a_i$.

The two angles of the squares are adjacent, and the extension of the diagonals of one square intersect the diagonal of another square at point $O$ (see figure). Prove that $O$ is the midpoint of $AB$. [img]https://cdn.artofproblemsolving.com/attachments/7/8/8daaaa55c38e15c4a8ac7492c38707f05475cc.png[/img]

Find all pairs of natural numbers $(n,k)$ for which $(n+1)^{k}-1 = n!$.

The Ministry of Education selects $2010$ students from $5$ regions of Thailand to participate in a debate tournament, where each pair of students will debate in one of the three topics: politics, economics, and societal problems. Show that there are $3$ students who were born in the same month, come from the same region, are of the same gender , and whose pairwise debates are on the same topic.

If $C$ is a set of $n$ points in the plane that has the following property: For each point $P$ of $C$, there are four points of $C$, each one distinct from $P$ , which are the vertices of a square. Find the smallest possible value of $n$.

In an acute $\Delta ABC$, $AH_a$ and $BH_b$ are altitudes and $M$ is the middle point of $AB$. The circumscribed circles of $\Delta AMH_a$ and $\Delta BMH_b$ intersect for a second time in $P$. Prove that point $P$ lies on the circumscribed circle of $\Delta ABC$.

On the sides $BC, CA$ and $AB$ of triangle $ABC$, respectively, points $D, E$ and $F$ are chosen. Prove that $\frac12 (BC + CA + AB)<AD + BE + CF<\frac 32 (BC + CA + AB)$.

Functions $f(x)$ and $g(x)$ are defined on the set of real numbers and take real values. It is known that $g(x)$ takes all real values, $g(0)=0$, and for all $x,y \in \mathbb{R}$ the following equality holds $$f(x+f(y))=f(x)+g(y)$$ Prove that $g(x+y)=g(x)+g(y)$ for all $x,y \in \mathbb{R}$.

Find the sum of all positive integers $n\le 2024$ such that all pairs of distinct positive integers $(a,b)$ that satisfy $ab=n$ have a sum that is a perfect square.