Isosceles triangle $ABC$, with $AB=AC$, is inscribed in circle $\omega$. Point $D$ lies on arc $\frown{BC}$ not containing $A$. Let $E$ be the foot of perpendicular from $A$ to line $CD$. Prove that $BC+DC=2DE$.

In a coordinate system there are drawn the graphs of the functions $y=ax+b$ and $y=bx+a, (a\neq b)$. Their intersection is marked with red and their intersections with the $Oy$ axis are marked with blue. Everything is erased except the marked points. Using only a ruler and a compass, find the origin of the coordinate system.

An ant walks around on the coordinate plane. It moves from the origin to $(3,4)$, then to $(-9, 9)$, then back to the origin. How many units did it walk? Express your answer as a decimal rounded to the nearest tenth.

Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that for all reals $x,y,z$, we have $$(f(x)+1)(f(y)+f(z))=f(xy+z)+f(xz-y)$$

How many $7$ digit numbers are there that satisfy the following? [list] [*] All digits are distinct from $1-7.$ [*] The first digit (from the left) is divisible by $1.$ [*] The two-digit number formed by the first two digits is divisible by $2.$ [*] The three-digit number formed by the first three digits is divisible by $3.$ [*] The four-digit number formed by the first four digits is divisible by $4.$ [*] The five-digit number formed by the first five digits is divisible by $5.$ [*] The six-digit number formed by the first six digits is divisible by $6.$ [/list]

Find the base of the number system less than $100$, in which $2101$ is a perfect square.

Alice and Bob play a game, in which they take turns drawing segments of length $1$ in the Euclidean plane. Alice begins, drawing the first segment, and from then on, each segment must start at the endpoint of the previous segment. It is not permitted to draw the segment lying over the preceding one. If the new segment shares at least one point - except for its starting point - with one of the previously drawn segments, one has lost. a) Show that both Alice and Bob could force the game to end, if they don’t care who wins. b) Is there a winning strategy for one of them?

Triangle $ABC$ is an isosceles right triangle with $AB=AC=3$. Let $M$ be the midpoint of hypotenuse $\overline{BC}$. Points $I$ and $E$ lie on sides $\overline{AC}$ and $\overline{AB}$, respectively, so that $AI>AE$ and $AIME$ is a cyclic quadrilateral. Given that triangle $EMI$ has area $2$, the length $CI$ can be written as $\frac{a-\sqrt{b}}{c}$, where $a$, $b$, and $c$ are positive integers and $b$ is not divisible by the square of any prime. What is the value of $a+b+c$? $ \textbf{(A) }9 \qquad \textbf{(B) }10 \qquad \textbf{(C) }11 \qquad \textbf{(D) }12 \qquad \textbf{(E) }13 \qquad $

If $f(x)=x^n-7x^{n-1}+17x^{n-2}+a_{n-3}x^{n-3}+\ldots+a_0$ is a real-valued function of degree $n>2$ with all real roots, prove that no root has value greater than $4$ and at least one root has value less than $0$ or greater than $2$.

On the plane is a triangle with red vertices and a triangle with blue vertices. $O$ is a point inside both triangles such that the distance from $O$ to any red vertex is less than the distance from $O$ to any blue vertex. Can the three red vertices and the three blue vertices all lie on the same circle?

If $\overrightarrow{u_1},\overrightarrow{u_2}, ...,\overrightarrow{u_n}$ be vectors in the plane such that the sum of their lengths is at least $1$, then between them we find vectors whose sum is a vector of length at least $\sqrt2/8$. Prove it.

Let $x$ and $y$ be positive real numbers and $\theta$ an angle such that $\theta \neq \frac{\pi}{2}n$ for any integer $n$. Suppose \[\frac{\sin\theta}{x}=\frac{\cos\theta}{y}\] and \[ \frac{\cos^4 \theta}{x^4}+\frac{\sin^4\theta}{y^4}=\frac{97\sin2\theta}{x^3y+y^3x}. \] Compute $\frac xy+\frac yx.$

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Three points, $A, B,$ and $C,$ are selected independently and uniformly at random from the interior of a unit square. Compute the expected value of $\angle{ABC}.$

The diagonals of a convex quadrilateral $ABCD$ with $AB = AC = BD$ intersect at $P$, and $O$ and $I$ are the circumcenter and incenter of $\vartriangle ABP$, respectively. Prove that if $O \ne I$ then $OI$ and $CD$ are perpendicular

Let $ABC$ be an acute and scalene triangle with $AB<AC$, inscribed in a circle $c(O,R)$ (with center $O$ and radius $R$). Circle $c_1(A,AB)$ intersects side $BC$ at point $E$ and circle $c$ at point $F$. $EF$ intersects for the second time circle $c$ at point $D$ and side $AC$ at point $M$. $AD$ intersects $BC$ at point $K$. Circumcircle of triangle $BKD$ intersects $AB$ at point $L$ . Prove that points $K,L,M$ lie on a line parallel to $BF$.

The degree measures of the angles of a convex 18-sided polygon form an increasing arithmetic sequence with integer values. Find the degree measure of the smallest angle.

Let $0<f(1)<f(2)<f(3)<\ldots$ a sequence with all its terms positive$.$ The $n-th$ positive integer which doesn't belong to the sequence is $f(f(n))+1.$ Find $f(240).$

Find all prime numbers $p$ which satisfy the following condition: For any prime $q < p$, if $p = kq + r, 0 \leq r < q$, there does not exist an integer $q > 1$ such that $a^{2} \mid r$.

Each face of a tetrahedron is a triangle with sides $a, b,$c and the tetrahedon has circumradius 1. Find $a^2 + b^2 + c^2$.

Let $\beta$ be the length of the bisector of angle $B$, and $a', c'$ be the lengths of the segments into which this bisector divides the side $AC$ of the triangle $ABC$. Prove the relation $\beta^2 = ac-a'c'$ and derive from this the formula $\beta^2=ac-\frac{b^2ac}{(a+c)^2}$.

There are 8 points in the plane.we write down the area of each triangle having all vertices amoung these points(totally 56 numbers).Let them be $a_1,a_2,\dots a_{56}$.Prove that there is a choice of plus or minus such that: $$\pm a_1 \pm a_2 \dots \pm a_{56}=0$$

For an arbitrary prime number $p$, show that there exists infinitely many multiples of $p$ that can be expressed as the form $$\frac{x^2+y+1}{x+y^2+1}$$ Where $x, y$ are some positive integers.

Find all pairs $(m,n)$ of integers with $m > n > 7$ for which there exists a polynomial $p(x)$ with integer coefficients such that $p(7) = 77, p(m) = 0$, and $p(n) = 85$.

Can we find positive integers $a$ and $b$ such that both $(a^2 + b)$ and $(b^2 + a)$ are perfect squares?