The points $A,B,$ and $C$ lies on the circumference of the unit circle. Furthermore, it is known that $AB$ is a diameter of the circle and \[\frac{|AC|}{|CB|}=\frac{3}{4}.\] The bisector of $ABC$ intersects the circumference at the point $D$. Determine the length of the $AD$.

The fuction $f(0,\infty)\rightarrow\mathbb{R}$ verifies $f(x)+f(y)=2f(\sqrt{xy}), \forall x,y>0$. Show that for every positive integer $n>2$ the following relation takes place $$f(x_1)+f(x_2)+\ldots+f(x_n)=nf(\sqrt[n]{x_1x_2\ldots x_n}),$$ for every positive integers $x_1,x_2,\ldots,x_n$.

Find the units of $R=\mathbb Z[t][\sqrt{t^2-1}]$.

Let $ABC$ be a triangle with $\angle C=90^\circ$. A line joining the midpoint of its altitude $CH$ and the vertex $A$ meets $CB$ at point $K$. Let $L$ be the midpoint of $BC$ ,and $T$ be a point of segment $AB$ such that $\angle ATK=\angle LTB$. It is known that $BC=1$. Find the perimeter of triangle $KTL$.

Let $ A$, $ B$, $ C$, $ A^{\prime}$, $ B^{\prime}$, $ C^{\prime}$, $ X$, $ Y$, $ Z$, $ X^{\prime}$, $ Y^{\prime}$, $ Z^{\prime}$ and $ P$ be pairwise distinct points in space such that $ A^{\prime} \in BC;\ B^{\prime}\in CA;\ C^{\prime}\in AB;\ X^{\prime}\in YZ;\ Y^{\prime}\in ZX;\ Z^{\prime}\in XY;$ $ P \in AX;\ P\in BY;\ P\in CZ;\ P\in A^{\prime}X^{\prime};\ P\in B^{\prime}Y^{\prime};\ P\in C^{\prime}Z^{\prime}$. Prove that $ \frac {BA^{\prime}}{A^{\prime}C}\cdot\frac {CB^{\prime}}{B^{\prime}A}\cdot\frac {AC^{\prime}}{C^{\prime}B} \equal{} \frac {YX^{\prime}}{X^{\prime}Z}\cdot\frac {ZY^{\prime}}{Y^{\prime}X}\cdot\frac {XZ^{\prime}}{Z^{\prime}Y}$.

In $\triangle ABC$, $b\neq1$. If $\frac{C}{A}$ and $\frac{\sin B}{\sin A}$ are solutions to equation $\log_{\sqrt{b}}x=\log_{b}(4x-4)$, then $\triangle ABC$ $\text{(A)}$is an isosceles triangle, but not right-angled triangle $\text{(B)}$is a right-angled triangle, but not isosceles triangle $\text{(C)}$is an isosceles right-angled triangle $\text{(D)}$is neither a right-angled triangle nor an isosceles triangle

Let $\{a_n\}_{n=1}^{\infty}$ and $\{b_n\}_{n=1}^{\infty}$ be sequences of integers such that $a_1 = 20$, $b_1 = 15$, and for $n \ge 1$, \[\left\{\begin{aligned} a_{n+1}&=a_n^2-b_n^2, \\ b_{n+1}&=2a_nb_n-b_n^2 \end{aligned}\right.\] Let $G = a_{10}^2-a_{10}b_{10}+b_{10}^2$. Determine the number of positive integer factors of $G$. [i]Proposed by Michael Ren[/i]

Compute the infinite sum $\frac{1^3}{2^1}+\frac{2^3}{2^2}+\frac{3^3}{2^3}+\dots+\frac{n^3}{2^n}+\dots.$

Let $g$ and $h$ be two distinct elements of a group $G$, and let $n$ be a positive integer. Consider a sequence $w=(w_1,w_2,\dots)$ which is not eventually periodic and where each $w_i$ is either $g$ or $h$. Denote by $H$ the subgroup of $G$ generated by all elements of the form $w_kw_{k+1}\dotsc w_{k+n-1}$ with $k \ge 1$. Prove that $H$ does not depend on the choice of the sequence $w$ (but may depend on $n$).

Let $p$ be a prime number greater than 5. Suppose there is an integer $k$ satisfying that $k^2+5$ is divisible by $p$. Prove that there are positive integers $m$ and $n$ such that $p^2=m^2+5n^2$

Call a polynomial $f(x)$ [i]excellent[/i] if its coefficients are all in [0, 1) and $f(x)$ is an integer for all integers $x$. a) Compute the number of excellent polynomials with degree at most 3. b) Compute the number of excellent polynomials with degree at most $n$, in terms of $n$. c) Find the minimum $n\ge3$ for which there exists an excellent polynomial of the form $\frac{1}{n!}x^n+g(x)$, where $g(x)$ is a polynomial of degree at most $n-3$.

Let $V$ be the set of all continuous functions $f\colon [0,1]\to \mathbb{R}$, differentiable on $(0,1)$, with the property that $f(0)=0$ and $f(1)=1$. Determine all $\alpha \in \mathbb{R}$ such that for every $f\in V$, there exists some $\xi \in (0,1)$ such that \[f(\xi)+\alpha = f'(\xi)\]

(a) On a long pavement, a sequence of $999$ integers is written in chalk. The numbers need not be in increasing order and need not be distinct. Merlijn encircles $500$ of the numbers with red chalk. From left to right, the numbers circled in red are precisely the numbers $1, 2, 3, ...,499, 500$. Next, Jeroen encircles $500$ of the numbers with blue chalk. From left to right, the numbers circled in blue are precisely the numbers $500, 499, 498, ...,2,1$. Prove that the middle number in the sequence of $999$ numbers is circled both in red and in blue. (b) Merlijn and Jeroen cross the street and find another sequence of $999$ integers on the pavement. Again Merlijn circles $500$ of the numbers with red chalk. Again the numbers circled in red are precisely the numbers $1, 2, 3, ...,499, 500$ from left to right. Now Jeroen circles $500$ of the numbers, not necessarily the same as Merlijn, with green chalk. The numbers circled in green are also precisely the numbers $1, 2, 3, ...,499, 500$ from left to right. Prove: there is a number that is circled both in red and in green that is not the middle number of the sequence of $999$ numbers.

Find the number of ordered triples $(a,b,c)$ of integers satisfying $0\le a,b,c \le 1000$ for which \[a^3+b^3+c^3\equiv 3abc+1\pmod{1001}.\] [i]Proposed by James Lin[/i]

Alice and Bob determine a number with $2018$ digits in the decimal system by choosing digits from left to right. Alice starts and then they each choose a digit in turn. They have to observe the rule that each digit must differ from the previously chosen digit modulo $3$. Since Bob will make the last move, he bets that he can make sure that the final number is divisible by $3$. Can Alice avoid that? [i](Proposed by Richard Henner)[/i]

Let $M$ be the midpoint of the cathetus $AC$ of a right-angled triangle $ABC$ $(\angle C=90^{\circ})$. The perpendicular from $M$ to the bisector of angle $ABC$ meets $AB$ at point $N$. Prove that the circumcircle of triangle $ANM$ touches the bisector of angle $ABC$. Proposed by:D.Shvetsov

Find real $a,b$ such that polynomial $P(x)=x^{n+1}+ax+b$ to be divisible by $(x-1)^2$. Then find the quotient $P(x):(x-1)^2 , n\in \mathbb{N}^*$

Triangle $BCF$ has a right angle at $B$. Let $A$ be the point on line $CF$ such that $FA=FB$ and $F$ lies between $A$ and $C$. Point $D$ is chosen so that $DA=DC$ and $AC$ is the bisector of $\angle{DAB}$. Point $E$ is chosen so that $EA=ED$ and $AD$ is the bisector of $\angle{EAC}$. Let $M$ be the midpoint of $CF$. Let $X$ be the point such that $AMXE$ is a parallelogram. Prove that $BD,FX$ and $ME$ are concurrent.

The diagram below shows two concentric circles whose areas are $7$ and $53$ and a pair of perpendicular lines where one line contains diameters of both circles and the other is tangent to the smaller circle. Find the area of the shaded region. [img]https://cdn.artofproblemsolving.com/attachments/3/b/87cbb97a799686cf5dbec9dcd79b6b03e1995c.png[/img]

In triangle $\vartriangle ABC$, $E$ and $F$ are the feet of the altitudes from $B$ to $\overline{AC}$ and $C$ to $\overline{AB}$, respectively. Line $\overleftrightarrow{BC}$ and the line through $A$ tangent to the circumcircle of $ABC$ intersect at $X$. Let $Y$ be the intersection of line $\overleftrightarrow{EF}$ and the line through $A$ parallel to $\overline{BC}$. If $XB = 4$, $BC = 8$, and $EF = 4\sqrt3$, compute $XY$.

Find all $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying (for all $x,y \in \mathbb{R}$): $f(x+y)^2 - f(2x^2) = f(y-x)f(y+x) + 2x\cdot f(y)$.

Find all positive integers that are equal to $700$ times the sum of its digits.

In a group of $6$ people playing the card game Tractor, all $54$ cards from $3$ decks are dealt evenly to all the players at random. Each deck is dealt individually. Let the probability that no one has at least two of the same card be $X$. Find the largest integer $n$ such that the $n$th root of $X$ is rational. [i]Proposed by Sammy Charney[/i] [b]Due to the problem having infinitely many solutions, all teams who inputted answers received points.[/b]

A convex polygon $P$ lies on a flat wooden table. You are allowed to drive some nails into the table. The nails must not go through $P$, but they may touch its boundary. We say that a set of nails blocks $P$ if the nails make it impossible to move $P$ without lifting it off the table. What is the minimum number of nails that suffices to block any convex polygon $P$? (N. Beluhov, S. Gerdgikov)

Consider the set $E$ of all positive integers $n$ such that when divided by $9,10,11$ respectively, the remainders(in that order) are all $>1$ and form a non constant geometric progression. If $N$ is the largest element of $E$, find the sum of digits of $E$