The adjoining figure shows two intersecting chords in a circle, with $B$ on minor arc $AD$. Suppose that the radius of the circle is 5, that $BC = 6$, and that $AD$ is bisected by $BC$. Suppose further that $AD$ is the only chord starting at $A$ which is bisected by $BC$. It follows that the sine of the minor arc $AB$ is a rational number. If this fraction is expressed as a fraction $m/n$ in lowest terms, what is the product $mn$? [asy] size(200); defaultpen(linewidth(0.7)+fontsize(10)); pair A=dir(200), D=dir(95), M=midpoint(A--D), C=dir(30), BB=C+2*dir(C--M), B=intersectionpoint(M--BB, Circle(origin, 1)); draw(Circle(origin, 1)^^A--D^^B--C); real r=0.05; pair M1=midpoint(M--D), M2=midpoint(M--A); draw((M1+0.1*dir(90)*dir(A--D))--(M1+0.1*dir(-90)*dir(A--D))); draw((M2+0.1*dir(90)*dir(A--D))--(M2+0.1*dir(-90)*dir(A--D))); pair point=origin; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D));[/asy]

Consider $\vartriangle ABC$ where $\angle ABC= 60 ^o$. Points $M$ and $D$ are on the sides $(AC)$, respectively $(AB)$, such that $\angle BCA = 2 \angle MBC$, and $BD = MC$. Determine $\angle DMB$.

Let $n$ and $\ell$ be integers such that $n \ge 3$ and $1 < \ell < n$. A country has $n$ cities. Between any two cities $A$ and $B$, either there is no flight from $A$ to $B$ and also none from $B$ to $A$, or there is a unique [i]two-way trip[/i] between them. A [i]two-way trip[/i] is a flight from $A$ to $B$ and a flight from $B$ to $A$. There exist two cities such that the least possible number of flights required to travel from one of them to the other is $\ell$. Find the maximum number of two-way trips among the $n$ cities.

On the table there are $2016$ coins. Two players play the following game making alternating moves. In one move it is allowed to take $1, 2$ or $3$ coins. The player who takes the last coin wins. Which player has a winning strategy?

Find all triples of positive integers $(x, y, z)$ that satisfy the equation $$2020^x + 2^y = 2024^z.$$ [i]Proposed by Ognjen Tešić, Serbia[/i]

Let $n$ to be a positive integer. Given a set $\{ a_1, a_2, \ldots, a_n \} $ of integers, where $a_i \in \{ 0, 1, 2, 3, \ldots, 2^n -1 \},$ $\forall i$, we associate to each of its subsets the sum of its elements; particularly, the empty subset has sum of its elements equal to $0$. If all of these sums have different remainders when divided by $2^n$, we say that $\{ a_1, a_2, \ldots, a_n \} $ is [i]$n$-complete[/i]. For each $n$, find the number of [i]$n$-complete[/i] sets.

Determine all real numbers $x$ which satisfy \[ x = \sqrt{a - \sqrt{a+x}} \] where $a > 0$ is a parameter.

In the coordinate plane consider the set $ S$ of all points with integer coordinates. For a positive integer $ k$, two distinct points $A$, $ B\in S$ will be called $ k$-[i]friends[/i] if there is a point $ C\in S$ such that the area of the triangle $ ABC$ is equal to $ k$. A set $ T\subset S$ will be called $ k$-[i]clique[/i] if every two points in $ T$ are $ k$-friends. Find the least positive integer $ k$ for which there exits a $ k$-clique with more than 200 elements. [i]Proposed by Jorge Tipe, Peru[/i]

Distinct points $A$ and $B$ are given on the plane. Consider all triangles $ABC$ in this plane on whose sides $BC,CA$ points $D,E$ respectively can be taken so that (i) $\frac{BD}{BC}=\frac{CE}{CA}=\frac{1}{3}$; (ii) points $A,B,D,E$ lie on a circle in this order. Find the locus of the intersection points of lines $AD$ and $BE$.

a. Prove that there are infinitely many positive integers $t$ such that both $2012t+1$ and $2013t+1$ are perfect squares. b. Suppose that $m,n$ are positive integers such that both $mn+1$ and $mn+n+1$ are perfect squares. Prove that $8(2m+1)$ divides $n$.

If $a, b, c$ represent the lengths of the sides of a triangle, prove that: $$\frac{a}{b-a+c}+ \frac{b}{b-a+c}+ \frac{c}{b-a+c} \ge 3$$

Regular hexagon $ ABCDEF$ has vertices $ A$ and $ C$ at $ (0,0)$ and $ (7,1)$, respectively. What is its area? $ \textbf{(A) } 20\sqrt {3} \qquad \textbf{(B) } 22\sqrt {3} \qquad \textbf{(C) } 25\sqrt {3} \qquad \textbf{(D) } 27\sqrt {3} \qquad \textbf{(E) } 50$

In a $\triangle {ABC}$, consider a point $E$ in $BC$ such that $AE \perp BC$. Prove that $AE=\frac{bc}{2r}$, where $r$ is the radio of the circle circumscripte, $b=AC$ and $c=AB$.

A number is called [i]Norwegian[/i] if it has three distinct positive divisors whose sum is equal to $2022$. Determine the smallest Norwegian number. (Note: The total number of positive divisors of a Norwegian number is allowed to be larger than $3$.)

How many positive integers $n$ satisfy$$\dfrac{n+1000}{70} = \lfloor \sqrt{n} \rfloor?$$(Recall that $\lfloor x\rfloor$ is the greatest integer not exceeding $x$.) $\textbf{(A) } 2 \qquad\textbf{(B) } 4 \qquad\textbf{(C) } 6 \qquad\textbf{(D) } 30 \qquad\textbf{(E) } 32$

1. Given $n \geq 1$, let $A_{n}$ denote the set of the first $n$ positive integers. We say that a bijection $f: A_{n} \rightarrow A_{n}$ has a hump at $m \in A_{n} \backslash\{1, n\}$ if $f(m)>f(m+1)$ and $f(m)>f(m-1)$. We say that $f$ has a hump at 1 if $f(1)>f(2)$, and $f$ has a hump at $n$ if $f(n)>f(n-1)$. Let $P_{n}$ be the probability that a bijection $f: A_{n} \rightarrow A_{n}$, when selected uniformly at random, has exactly one hump. For how many positive integers $n \leq 2020$ is $P_{n}$ expressible as a unit fraction?

For positive integers $m, n$ ($m>n$), $a_{n+1}, a_{n+2}, ..., a_m$ are non-negative integers that satisfy the following inequality. $$ 2> \frac{a_{n+1}}{n+1} \ge \frac{a_{n+2}}{n+2} \ge \cdots \ge \frac{a_m}{m}$$ Find the number of pair $(a_{n+1}, a_{n+2}, \cdots, a_m)$.

A cubic function $ y \equal{} ax^3 \plus{} bx^2 \plus{} cx \plus{} d\ (a\neq 0)$ touches a line $ y \equal{} px \plus{} q$ at $ x \equal{} \alpha$ and intersects $ x \equal{} \beta \ (\alpha \neq \beta)$. Find the area of the region bounded by these graphs in terms of $ a,\ \alpha ,\ \beta$.

Point $P$ lies on the median from vertex $C$ of a triangle $ABC$. Line $AP$ meets $BC$ at $X$, and line $BP$ meets $AC$ at $Y$ . Prove that if quadrilateral $ABXY$ is cyclic, then triangle $ABC$ is isosceles.

Let $P$ be a point inside a triangle $ABC$, and $A_1B_2,B_1C_2,C_1A_2$ be segments passing through $P$ and parallel to $AB, BC, CA$ respectively, where points $A_1, A_2$ lie on $BC, B_1, B_2$ on $CA$, and $C_1,C_2$ on $AB$. Prove that \[ \text{Area}(A_1A_2B_1B_2C_1C_2) \ge \frac{1}{2}\text{Area}(ABC)\]

Find all positive integers $n \ge 4$ for which there are $n$ points in general position on the plane such that an arbitrary triangle with vertices belonging to the convex hull of these $n$ points, containing exactly one of $n - 3$ points inside remained.

We define the ridiculous numbers recursively as follows: [list=a] [*]1 is a ridiculous number. [*]If $a$ is a ridiculous number, then $\sqrt{a}$ and $1+\sqrt{a}$ are also ridiculous numbers. [/list] A closed interval $I$ is ``boring'' if [list] [*]$I$ contains no ridiculous numbers, and [*]There exists an interval $[b,c]$ containing $I$ for which $b$ and $c$ are both ridiculous numbers. [/list] The smallest non-negative $l$ such that there does not exist a boring interval with length $l$ can be represented in the form $\dfrac{a + b\sqrt{c}}{d}$ where $a, b, c, d$ are integers, $\gcd(a, b, d) = 1$, and no integer square greater than 1 divides $c$. What is $a + b + c + d$?

A segment of length $\sqrt2 + \sqrt3 + \sqrt5$ is drawn. Is it possible to draw a segment of unit length using a compass and a straightedge? [i](3 points)[/i]

Let $\omega$ and $O$ be respectively the circumcircle and the circumcenter of a triangle $ABC$. The line $AO$ intersects $\omega$ second time at $A'$. $M_B$ and $M_C$ are the midpoints of $AC$ and $AB$, respectively. The lines $A'M_B$ and $A'M_C$ intersect $\omega$ secondly at points $B'$ and $C$, and also intersect $BC$ at points $D_B$ and $D_C$, respectively. The circumcircles of $CD_BB'$ and $BD_CC'$ intersect at points $P$ and $Q$. Prove that $O$, $P$, $Q$ are collinear. [i] (М. Германсков)[/i] [hide=Thanks]Thanks to the user Vlados021 for translating the problem.[/hide]

Let $m$ be an integer where $|m|\ge 2$. Let $a_1,a_2,\cdots$ be a sequence of integers such that $a_1,a_2$ are not both zero, and for any positive integer $n$, $a_{n+2}=a_{n+1}-ma_n$. Prove that if positive integers $r>s\ge 2$ satisfy $a_r=a_s=a_1$, then $r-s\ge |m|$.