Convex quadrilateral $ABCD$ is inscribed in circle $\Omega$. Its sides $AD$ and $BC$ intersect at point $E$. Let $M$ and $N$ be the midpoints of the circle arcs $AB$ and $CD$ not containing the other vertices, and let $I$, $J$, $K$, $L$ denote the incenters of triangles $ABD$, $ABC$, $BCD$, $CDA$, respectively. Suppose $\Omega$ intersects circles $IJM$ and $KLN$ for the second time at points $U \neq M$ and $V \neq N$. Show that the points $E$, $U$, and $V$ are collinear.

Let $n$ be a positive integer. The Georgian folk dance team consists of $2n$ dancers, with $n$ males and $n$ females. Each dancer, both male and female, is assigned a number from 1 to $n$. During one of their dances, all the dancers line up in a single line. Their wish is that, for every integer $k$ from 1 to $n$, there are exactly $k$ dancers positioned between the $k$th numbered male and the $k$th numbered female. Prove the following statements: a) If $n \equiv 1 \text{ or } 2 \mod{4}$, then the dancers cannot fulfill their wish. b) If $n \equiv 0 \text{ or } 3 \mod{4}$, then the dancers can fulfill their wish. [i]Proposed by Giorgi Arabidze, Georgia[/i]

Find the extremum of $f(t)=\int_1^t \frac{\ln x}{x+t}dx\ (t>0)$.

Show that if at least five persons are sitting at a round table, then it is possible to rearrange them so that everyone has two new neighbors.

There are $\frac{k(k+1)}{2}+1$ points on the planes, some are connected by disjoint segments ( also point can not lies on segment, that connects two other points). It is true, that plane is divided to some parallelograms and one infinite region. What maximum number of segments can be drawn ? [i] A.Kupavski, A. Polyanski[/i]

Let $k$ be a real number such that the product of real roots of the equation $$X^4 + 2X^3 + (2 + 2k)X^2 + (1 + 2k)X + 2k = 0$$ is $-2013$. Find the sum of the squares of these real roots.

In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

The diagonals $AC$ and $BD$ of a cyclic quadrilateral $ABCD$ meet at a point $X$. The circumcircles of triangles $ABX$ and $CDX$ meet at a point $Y$ (apart from $X$). Let $O$ be the center of the circumcircle of the quadrilateral $ABCD$. Assume that the points $O$, $X$, $Y$ are all distinct. Show that $OY$ is perpendicular to $XY$.

In CMI, each person has atmost $3$ friends. A disease has infected exactly $2023$ peoplein CMI . Each day, a person gets infected if and only if atleast two of their friends were infected on the previous day. Once someone is infected, they can neither die nor be cured. Given that everyone in CMI eventually got infected, what is the maximum possible number of people in CMI?

The decimal representation of $$\dfrac{1}{20^{20}}$$ consists of a string of zeros after the decimal point, followed by a 9 and then several more digits. How many zeros are in that initial string of zeros after the decimal point? $\textbf{(A) }23\qquad\textbf{(B) }24\qquad\textbf{(C) }25\qquad\textbf{(D) }26\qquad\textbf{(E) }27$

Consider two spheres $\Sigma_1$ and $\Sigma_2$ and a line $\Delta$ not meeting them. Let $C_i$ and $r_i$ be the center and radius of $\Sigma_i$, and let $H_i$ and $d_i$ be the orthogonal projection of $C_i$ onto $\Delta$ and the distance of $C_i$ from $\Delta~(i=1,2)$. For a point $M$ on $\Delta$, let $\delta_i(M)$ be the length of a tangent $MT_i$ to $\Sigma_i$, where $T_i\in\Sigma_i~(i=1,2)$. Find $M$ on $\Delta$ for which $\delta_1(M)+\delta_2(M)$ is minimal.

suppose that $0\le p \le 1$ and we have a wooden square with side length $1$. in the first step we cut this square into $4$ smaller squares with side length $\frac{1}{2}$ and leave each square with probability $p$ or take it with probability $1-p$. in the next step we cut every remaining square from the previous step to $4$ smaller squares (as above) and take them with probability $1-p$. it's obvios that at the end what remains is a subset of the first square. [b]a)[/b] show that there exists a number $0<p_0<1$ such that for $p>p_0$ the probability that the remainig set is not empty is positive and for $p<p_0$ this probability is zero. [b]b)[/b] show that for every $p\neq 1$ with probability $1$, the remainig set has size zero. [b]c)[/b] for this statement that the right side of the square is connected to the left side of the square with a path, write anything that you can.

Claudia and Adela are betting to see which one of them will ask the boy they like for his telephone number. To decide they roll dice. If none of the dice are a multiple of 3, Claudia will do it. If exactly one die is a multiple of 3, Adela will do it. If 2 or more of the dice are a multiple of 3 neither one of them will do it. How many dice should be rolled so that the risk is the same for both Claudia and Adela?

Connie multiplies a number by 2 and gets 60 as her answer. However, she should have divided the number by 2 to get the correct answer. What is the correct answer? $\textbf{(A)}\ 7.5 \qquad \textbf{(B)}\ 15 \qquad \textbf{(C)}\ 30 \qquad \textbf{(D)}\ 120 \qquad \textbf{(E)}\ 240$

There are $2n+1$ segments on the line. Any segment intersects at with at least $n$ others. Prove that there is a segment that intersects all the others.

$ O $ is the center of a parallelogram $ ABCD. $ Let $ G $ on the segment $ OB $ (excluding its endpoints), $ N $ on the line $ DC $ and $ M $ on the segment $ AD $ (excluding its endpoints) such that $ CN>ND, AM=6MD $ and so that there exists a natural number $ n\ge 3 $ such that $ OB=nGO. $ Show that $ G,M,N $ are collinear if and only if $$ \left( \frac{CN}{ND} -6 \right) (n+1)=2. $$

Find all real solutions of the equation $$x^2+y^2+z^2+t^2=xy+yz+zt+t-\frac25.$$

Find the sum of all positive divisors of $40081$.

Let $l,\ m$ be the tangent lines passing through the point $A(a,\ a-1)$ on the line $y=x-1$ and touch the parabola $y=x^2$. Note that the slope of $l$ is greater than that of $m$. (1) Exress the slope of $l$ in terms of $a$. (2) Denote $P,\ Q$ be the points of tangency of the lines $l,\ m$ and the parabola $y=x^2$. Find the minimum area of the part bounded by the line segment $PQ$ and the parabola $y=x^2$. (3) Find the minimum distance between the parabola $y=x^2$ and the line $y=x-1$.

Twelve congruent disks are placed on a circle $C$ of radius 1 in such a way that the twelve disks cover $C$, no two of the disks overlap, and so that each of the twelve disks is tangent to its two neighbors. The resulting arrangement of disks is shown in the figure below. The sum of the areas of the twelve disks can be written in the from $\pi(a-b\sqrt{c})$, where $a,b,c$ are positive integers and $c$ is not divisible by the square of any prime. Find $a+b+c$. [asy] real r=2-sqrt(3); draw(Circle(origin, 1)); int i; for(i=0; i<12; i=i+1) { draw(Circle(dir(30*i), r)); dot(dir(30*i)); } draw(origin--(1,0)--dir(30)--cycle); label("1", (0.5,0), S);[/asy]

Let $ABC$ be a right angled triangle with hypotenuse $AC$, and let $H$ be the foot of the altitude from $B$ to $AC$. Knowing that there is a right-angled triangle with side-lengths $AB, BC, BH$, determine all the possible values ​​of $\frac{AH}{CH}$

Let $ABC$ be a triangle and $\ell_1,\ell_2$ be two parallel lines. Let $\ell_i$ intersects line $BC,CA,AB$ at $X_i,Y_i,Z_i$, respectively. Let $\Delta_i$ be the triangle formed by the line passed through $X_i$ and perpendicular to $BC$, the line passed through $Y_i$ and perpendicular to $CA$, and the line passed through $Z_i$ and perpendicular to $AB$. Prove that the circumcircles of $\Delta_1$ and $\Delta_2$ are tangent.

In the grid to the right, the shortest path through unit squares between between the pair of 2's has length 2. Fill in some of the unit squares in the grid so that (i) exactly half of the squares in each row and column contain a number, (ii) each of the number 1 through 12 appears exactly twice, and (iii) for $n=1,2,\cdot\cdot\cdot,12$, the shortest path between the pair of $n$'s has length exactly $n$.

What is the largest integer less than or equal to $$\frac{3^{31}+2^{31}}{3^{29}+2^{29}} \,\,\, ?$$

Construct a convex polyhedron of equal “bricks” shown in Figure. [img]https://cdn.artofproblemsolving.com/attachments/6/6/75681a90478f978665b6874d0c0c9441ea3bd2.gif[/img]