Given is a trapezoid $ ABCD$ where $ AB$ and $ CD$ are parallel, and $ A,B,C,D$ are clockwise in this order. Let $ \Gamma_1$ be the circle with center $ A$ passing through $ B$, $ \Gamma_2$ be the circle with center $ C$ passing through $ D$. The intersection of line $ BD$ and $ \Gamma_1$ is $ P$ $ ( \ne B,D)$. Denote by $ \Gamma$ the circle with diameter $ PD$, and let $ \Gamma$ and $ \Gamma_1$ meet at $ X$$ ( \ne P)$. $ \Gamma$ and $ \Gamma_2$ meet at $ Y$. If the circumcircle of triangle $ XBY$ and $ \Gamma_2$ meet at $ Q$, prove that $ B,D,Q$ are collinear.

Counting from the right end, what is the $2500$th digit of $10000!$?

$n$ points are marked on the board points that are vertices of the regular $n$ -gon. One of the points is a chip. Two players take turns moving it to the other marked point and at the same time draw a segment that connects them. If two points already connected by a segment, such a move is prohibited. A player who can't make a move, lose. Which of the players can guarantee victory?

Which expression is equal to $\left | a-2-\sqrt{(a-1)^2} \right|$ for $a<0$? $\textbf{(A) } 3-2a \qquad \textbf{(B) } 1-a \qquad \textbf{(C) } 1 \qquad \textbf{(D) } a+1 \qquad \textbf{(E) } 3$

How many ordered triples $(a,b,c)$ of integers with $1\le a\le b\le c\le 60$ satisfy $a\cdot b=c$?

An isosceles trapezoid has legs and shorter base of length $1$. Find the maximum possible value of its area

Let $n$ be positive integer,$x_1,x_2,\cdots,x_n$ be positive real numbers such that $x_1x_2\cdots x_n=1 $ . Prove that$$\sum\limits_{i = 1}^{n}x_i\sqrt{x^2_1+x^2_2+\cdots x^2_i}\ge\frac{n+1}{2}\sqrt{n}$$

Let $\alpha$ and $\omega$ be two circles such that $\omega$ goes through the center of $\alpha$.$\omega$ intersects $\alpha$ at $A$ and $B$.Let $P$ any point on the circumference $\omega$.The lines $PA$ and $PB$ intersects $\alpha$ again at $E$ and $F$ respectively.Prove that $AB=EF$.

Find the digits left and right of the decimal point in the decimal form of the number \[ (\sqrt{2} + \sqrt{3})^{1980}. \]

The set of natural numbers is represented as a union of pairwise disjoint subsets, whose elements form infinite arithmetic progressions with positive differences $d_1,d_2,d_3,...$. Is it possible that the sum $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$? Consider the cases where (a) the total number of progressions is finite, and (b) the number of progressions is infinite. (In this case the condition that $\frac{1}{d_1}+\frac{1}{d_1}+\frac{1}{d_3}+... $ does not exceed $0.9$ should be taken to mean that the sum of any finite number of terms does not exceed 0.9.) (A. Tolpugo, Kiev)

Define the unit $N$-hypercube to be the set of points $[0, 1]^N \subset R^N$ . For example, the unit $0$-hypercube is a point, and the unit $3$-hypercube is the unit cube. Define a $k$-face of the unit $N$-hypercube to be a copy of the $k$-hypercube in the exterior of the $N$-hypercube. More formally, a $k$-face of the unit $N$-hypercube is a set of the form $$\prod_{i=1}^{N} S_i$$ where $S_i$ is either $\{0\}$, $\{1\}$, or $[0, 1]$ for each $1 \le i \le N$, and there are exactly $k$ indices $i$ such that $S_i = [0, 1]$. The expected value of the dimension of a random face of the unit $ 8$-hypercube (where the dimension of a face can be any value between $0$ and $N$) can be written in the form $p/q$ where $p$ and $q$ are relatively prime positive integers. Find $p + q$.

A binary operation $\diamondsuit$ has the properties that $a\,\diamondsuit\, (b\,\diamondsuit \,c) = (a\,\diamondsuit \,b)\cdot c$ and that $a\,\diamondsuit \,a=1$ for all nonzero real numbers $a, b,$ and $c$. (Here $\cdot$ represents multiplication). The solution to the equation $2016 \,\diamondsuit\, (6\,\diamondsuit\, x)=100$ can be written as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. What is $p+q?$ $\textbf{(A) }109\qquad\textbf{(B) }201\qquad\textbf{(C) }301\qquad\textbf{(D) }3049\qquad\textbf{(E) }33,601$

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

A square has sides of length $ 10$, and a circle centered at one of its vertices has radius $ 10$. What is the area of the union of the regions enclosed by the square and the circle? $ \textbf{(A)}\ 200 \plus{} 25\pi\qquad \textbf{(B)}\ 100 \plus{} 75\pi\qquad \textbf{(C)}\ 75 \plus{} 100\pi\qquad \textbf{(D)}\ 100 \plus{} 100\pi$ $ \textbf{(E)}\ 100 \plus{} 125\pi$

Let $ABCDEF$ be a regular hexagon with side length $1$. Denote by $X$, $Y$, and $Z$ the midpoints of sides $\overline{AB},\overline{CD},\overline{EF}$, respectively. What is the area of the convex hexagon whose interior is the intersection of the interiors of $\triangle{ACE}$ and $\triangle{XYZ}$? $\textbf{(A) }\dfrac{3}{8}\sqrt{3}\qquad\textbf{(B) }\dfrac{7}{16}\sqrt{3}\qquad\textbf{(C) }\dfrac{15}{32}\sqrt{3}\qquad\textbf{(D) }\dfrac{1}{2}\sqrt{3}\qquad\textbf{(E) }\dfrac{9}{16}\sqrt{3}$

Let $ABC$ be an equilateral triangle with side length $1.$ Then, let $M$ be the midpoint of $\overline{BC}.$ The area of all points within $ABC$ that are closer to $M$ than either of $A, B,$ or $C$ can be expressed as the fraction $\tfrac{\sqrt{a}}{b}$ where $a$ is not divisible by the square of any prime and $b$ is a positive integer. Find $a+b.$

Suppose that $ p$ is a prime number. Prove that for each $ k$, there exists an $ n$ such that: \[ \left(\begin{array}{c}n\\ \hline p\end{array}\right)\equal{}\left(\begin{array}{c}n\plus{}k\\ \hline p\end{array}\right)\]

Let $p > 3$ be a prime number, and let $F_p$ denote the (finite) set of residue classes modulo $p$. Let $S_d$ denote the set of $2$-variable polynomials $P(x, y)$ with coefficients in $F_p$, total degree $\le d$, and satisfying $P(x, y) = P(y,- x -y)$. Show that $$|S_d| = p^{\lceil (d+1)(d+2)/6 \rceil}$$. [i]The total degree of a $2$-variable polynomial $P(x, y)$ is the largest value of $i + j$ among monomials $x^iy^j$ [/i] appearing in $P$.

a) Find two sets $X,Y$ such that $X\cap Y =\emptyset$, $X\cup Y = \mathbb Q^{\star}_{+}$ and $Y = \{a\cdot b \mid a,b \in X \}$. b) Find two sets $U,V$ such that $U\cap V =\emptyset$, $U\cup V = \mathbb R$ and $V = \{x+y \mid x,y \in U \}$.

Let $\alpha, \beta$ and $\gamma$ denote the angles of the triangle $ABC$. The perpendicular bisector of $AB$ intersects $BC$ at the point $X$, the perpendicular bisector of $AC$ intersects it at $Y$. Prove that $\tan(\beta) \cdot \tan(\gamma) = 3$ implies $BC= XY$ (or in other words: Prove that a sufficient condition for $BC = XY$ is $\tan(\beta) \cdot \tan(\gamma) = 3$). Show that this condition is not necessary, and give a necessary and sufficient condition for $BC = XY$.

Find the number of integers $n > 1$ which divide $a^{25} - a$ for every integer $a$.

Consider $120$ unit squares arbitrarily situated in a $20\times 25$ rectangle. Prove that one can place a circle with unit diameter in the rectangle without intersecting any of the squares.

In how many ways can one arrange seven white and five black balls in a line in such a way that there are no two neighboring black balls?

Let $p$ be a prime number and let $m, n$ be integers greater than $1$ such that $n | m^{p(n-1)} - 1$. Prove that $gcd(m^{n-1} - 1, n) > 1$.

Let the number $x$. Using multiply and division operations of any 2 given or already given numbers we can obtain powers with natural exponent of the number $x$ (for example, $x\cdot x=x^{2}$, $x^{2}\cdot x^{2}=x^{4}$, $x^{4}: x=x^{3}$, etc). Determine the minimal number of operations needed for calculating $x^{2006}$.