In a quadrilateral $ABCD$ we have $\angle A = \angle C = 90^o$. Let $E$ be a point in the interior of $ABCD$. Let $M$ be the midpoint of $BE$. Prove that $\angle ADB = \angle EDC$ if and only if $|MA| = |MC|$.

Evaluate \[\int_{e^e}^{e^{e^{e}}}\left\{\ln (\ln (\ln x))+\frac{1}{(\ln x)\ln (\ln x)}\right\}dx.\] Own

The number of points common to the graphs of \[(x-y+2)(3x+y-4)=0\text{ and }(x+y-2)(2x-5y+7)=0\] is: $\textbf{(A) }2\qquad \textbf{(B) }4\qquad \textbf{(C) }6\qquad \textbf{(D) }16\qquad \textbf{(E) }\text{infinite}$

A time is chosen randomly and uniformly in an 24-hour day. The probability that at that time, the (non-reflex) angle between the hour hand and minute hand on a clock is less than $\frac{360}{11}$ degrees is $\frac{m}{n}$ for coprime positive integers $m$ and $n$. Find $100m + n$. [i]Proposed by Yannick Yao[/i]

Let $ a, b, c $ be positive real numbers less than or equal to $ \sqrt{2} $ such that $ abc = 2 $, prove that $$ \sqrt{2}\displaystyle\sum_{cyc}\frac{ab + 3c}{3ab + c} \ge a + b + c $$

Given is a group in which everyone has exactly $d$ friends and every two strangers have exactly one common friend. Prove that there are at most $d^2 + 1$ people in this group.

If the ratio of the legs of a right triangle is $ 1: 2$, then the ratio of the corresponding segments of the hypotenuse made by a perpendicular upon it from the vertex is: $ \textbf{(A)}\ 1: 4 \qquad \textbf{(B)}\ 1: \sqrt{2} \qquad \textbf{(C)}\ 1: 2 \qquad \textbf{(D)}\ 1: \sqrt{5} \qquad \textbf{(E)}\ 1: 5$

To unlock his cell phone, Joao slides his finger horizontally or vertically across a numerical box, similar to the one represented in the figure, describing a $7$-digit code, without ever passing through the same digit twice. For example, to indicate the code $1452369$, Joao follows the path indicated in the figure. [img]https://cdn.artofproblemsolving.com/attachments/8/a/511018ba4e43c2c6f0be350d57161eb5ea7c2b.png[/img] João forgot his code, but he remembers that it is divisible by $9$. How many codes are there under these conditions?

Suppose $n\geq 3$ is an integer. There are $n$ grids on a circle. We put a stone in each grid. Find all positive integer $n$, such that we can perform the following operation $n-2$ times, and then there exists a grid with $n-1$ stones in it: $\bullet$ Pick a grid $A$ with at least one stone in it. And pick a positive integer $k\leq n-1$. Take all stones in the $k$-th grid after $A$ in anticlockwise direction. And put then in the $k$-th grid after $A$ in clockwise direction.

Given that $f(x)+2f(4-x)=x+8$, compute $f(16)$.

Let $f:\mathbb{R}\rightarrow \mathbb{R}$ be a function defined by $f(x)=\frac{2008^{2x}}{2008+2008^{2x}}$. Prove that \[\begin{aligned} f\left(\frac{1}{2007}\right)+f\left(\frac{2}{2007}\right)+\cdots+f\left(\frac{2005}{2007}\right)+f\left(\frac{2006}{2007}\right)=1003. \end{aligned}\]

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

A circle is inscribed in a triangle with side lengths $8$, $13$, and $17$. Let the segments of the side of length $8$, made by a point of tangency, be $r$ and $s$, with $r<s$. What is the ratio $r:s$? ${{ \textbf{(A)}\ 1:3 \qquad\textbf{(B)}\ 2:5 \qquad\textbf{(C)}\ 1:2 \qquad\textbf{(D)}\ 2:3 }\qquad\textbf{(E)}\ 3:4 } $

A point $M$ inside triangle $ABC$ is such that $AM=AB/2$ and $CM=BC/2$. Points $C_0$ and $A_0$ lying on $AB$ and $CB$ respectively are such that $BC_0:AC_0 = BA_0:CA_0 = 3$. Prove that the distances from $M$ to $C_0$ and $A_0$ are equal.

A [i]binary palindrome[/i] is a positive integer whose standard base 2 (binary) representation is a palindrome (reads the same backward or forward). (Leading zeroes are not permitted in the standard representation.) For example, 2015 is a binary palindrome, because in base 2 it is 11111011111. How many positive integers less than 2015 are binary palindromes?

The coefficients of the equation $ ax^2\plus{}bx\plus{}c\equal{}0$, where $ a\ne 0$, satisfy the inequality $ (a\plus{}b\plus{}c)(4a\minus{}2b\plus{}c)<0$. Prove that this equation has $ 2$ real distinct solutions.

Let $p$ and $n$ be a natural numbers such that $p$ is a prime and $1+np$ is a perfect square. Prove that the number $n+1$ is sum of $p$ perfect squares.

Can the numbers from \( 1 \) to \( 2025 \) be arranged in a circle such that the difference between any two adjacent numbers has the form \( 2^k \) for some non-negative integer \( k \)? For different adjacent pairs of numbers, the values of \( k \) may be different. [i]Proposed by Anton Trygub[/i]

A rectangular parallelepiped has dimensions $a,b,c$ that satisfy the relation $3a+4b+10c=500$, and the length of the main diagonal $20\sqrt5$. Find the volume and the total area of the surface of the parallelepiped.

Let $ABC $ be an acute triangle such that $AB\neq AC$ ,with circumcircle $ \Gamma$ and circumcenter $O$. Let $M$ be the midpoint of $BC$ and $D$ be a point on $ \Gamma$ such that $AD \perp BC$. let $T$ be a point such that $BDCT$ is a parallelogram and $Q$ a point on the same side of $BC$ as $A$ such that $\angle{BQM}=\angle{BCA}$ and $\angle{CQM}=\angle{CBA}$. Let the line $AO$ intersect $ \Gamma$ at $E$ $(E\neq A)$ and let the circumcircle of $\triangle ETQ$ intersect $ \Gamma$ at point $X\neq E$. Prove that the point $A,M$ and $X$ are collinear.

For an integer $n$, let $f_9(n)$ denote the number of positive integers $d\leq 9$ dividing $n$. Suppose that $m$ is a positive integer and $b_1,b_2,\ldots,b_m$ are real numbers such that $f_9(n)=\textstyle\sum_{j=1}^mb_jf_9(n-j)$ for all $n>m$. Find the smallest possible value of $m$.

There are $4950$ ants. Assume that, for any three ants $A, B$ and $C$, if the ant $A$ is the boss of the ant $B$, and the ant $B$ is the boss of the ant $C$ then the ant $A$ is also the boss of the ant $C$. We want to divide the ants into $n$ groups so that in any group, either any two ants have the boss relationship or any two ants do not have the boss relationship. Find the smallest of $n$ we can always do in any case.

Let $G$ be a complete bipartite graph with partition sets $A$ and $B$ of sizes $km$ and $kn$, respectively. The edges of $G$ are colored in $k$ colors. Prove that there exists a monochromatic connected component with at least $m+n$ vertices (which means that there exists a color and a set of vertices, such that between any two of them, there is a path consisting of edges only in that color).

We call a two-variable polynomial $P(x, y)$ [i]secretly one-variable,[/i] if there exist polynomials $Q(x)$ and $R(x, y)$ such that $\deg(Q) \ge 2$ and $P(x, y) = Q(R(x, y))$ (e.g. $x^2 + 1$ and $x^2y^2 +1$ are [i]secretly one-variable[/i], but $xy + 1$ is not). Prove or disprove the following statement: If $P(x, y)$ is a polynomial such that both $P(x, y)$ and $P(x, y) + 1$ can be written as the product of two non-constant polynomials, then $P$ is [i]secretly one-variable[/i]. [i]Note: All polynomials are assumed to have real coefficients. [/i]

Let $ABC$ be a triangle with $\angle C = 90^\circ$ and $CA \neq CB$. Let $CH$ be an altitude and $CL$ be an interior angle bisector. Show that for $X \neq C$ on the line $CL$, we have $\angle XAC \neq \angle XBC$. Also show that for $Y \neq C$ on the line $CH$ we have $\angle YAC \neq \angle YBC$. [i]Bulgaria[/i]