In the United States, coins have the following thicknesses: penny, $ 1.55$ mm; nickel, $ 1.95$ mm; dime, $ 1.35$ mm; quarter, $ 1.75$ mm. If a stack of these coins is exactly $ 14$ mm high, how many coins are in the stack? $ \textbf{(A)}\ 7\qquad \textbf{(B)}\ 8\qquad \textbf{(C)}\ 9\qquad \textbf{(D)}\ 10\qquad \textbf{(E)}\ 11$

Mr. Rose gave a test to his two calculus classes. His first period class has $20$ students, and their average score on the test was $80$. His second period class has $30$ students, and their average score was $90$. What was the average score of all $50$ of his calculus students?

Let $ ABC$ be a triangle, and $ I$ its incenter. Let the incircle of $ ABC$ touch side $ BC$ at $ D$, and let lines $ BI$ and $ CI$ meet the circle with diameter $ AI$ at points $ P$ and $ Q$, respectively. Given $ BI \equal{} 6, CI \equal{} 5, DI \equal{} 3$, determine the value of $ \left( DP / DQ \right)^2$.

A family of sets $F$ is called perfect if the following condition holds: For every triple of sets $X_1, X_2, X_3\in F$, at least one of the sets $$ (X_1\setminus X_2)\cap X_3,$$ $$(X_2\setminus X_1)\cap X_3$$ is empty. Show that if $F$ is a perfect family consisting of some subsets of a given finite set $U$, then $\left\lvert F\right\rvert\le\left\lvert U\right\rvert+1$. [i]Proposed by Michał Pilipczuk[/i]

Let $D$ be a point on the side $AC$ of a triangle $ABC$. Suppose that the incircle of triangle $BCD$ intersects $BD$ and $CD$ at $X$, $Y$, respectively. Show that $XY$ passes through a fixed point when $D$ is moving on the side $AC$.

The numbers $1, 2, 3, . . . , 101$ are written in a row in some order. Prove that it is always possible to erase $90 $ of the numbers so that the remaining $11$ numbers remain arranged in either increasing or decreasing order.

In circle with radius $10$, point $M$ is on chord $PQ$ such that $PM=5$ and $MQ=10$. Through point $M$ we draw chords $AB$ and $CD$, and points $X$ and $Y$ are intersection points of chords $AD$ and $BC$ with chord $PQ$ (see picture), respectively. If $XM=3$ find $MY$ [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvYy9kLzBiMmFmM2ViOGVmOTlmZDA5NGY2ZWY4MjM1YWI0ZDZjNjJlNzA1LnBuZw==&rn=Z2VvbWV0cmlqYS5wbmc=[/img]

The bisector of angle $B$ and the bisector of external angle $D$ of rectangle $ABCD$ intersect side $AD$ and line $AB$ at points $M$ and $K$, respectively. Prove that the segment $MK$ is equal and perpendicular to the diagonal of the rectangle.

Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers $m$ and $n$ are said to be [i]cuates[/i] if either $\frac{m}{n}$ or $\frac{n}{m}$ is a prime number. A [i]step[/i] consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.

Let $x_0, x_1, \ldots$ be a sequence of real numbers such that $x_n = \frac{1 + x_{n -1}}{x_{n - 2}}$ for $n \geq 2$. Find the number of ordered pairs of positive integers $(x_0, x_1)$ such that the sequence gives $x_{2018} = \frac{1}{1000}$.

In a game, there are three indistinguishable boxes; one box contains two red balls, one contains two blue balls, and the last contains one ball of each color. To play, Raj first predicts whether he will draw two balls of the same color or two of different colors. Then, he picks a box, draws a ball at random, looks at the color, and replaces the ball in the same box. Finally, he repeats this; however, the boxes are not shuffled between draws, so he can determine whether he wants to draw again from the same box. Raj wins if he predicts correctly; if he plays optimally, what is the probability that he will win?

Let $ABCD$ be a quadrilateral inscribed in a circle. Suppose $AB=\sqrt{2+\sqrt{2}}$ and $AB$ subtends $135$ degrees at center of circle . Find the maximum possible area of $ABCD$.

For a positive integer $n$, let $p(n)$ denote the number of prime divisors of $n$, counting multiplicity (i.e. $p(12)=3$). A sequence $a_n$ is defined such that $a_0 = 2$ and for $n > 0$, $a_n = 8^{p(a_{n-1})} + 2$. Compute $$\sum_{n=0}^{\infty} \frac{a_n}{2^n}$$

Let $n$ be a positive integer and let $x_1, x_2, \ldots, x_n$ be positive real numbers such that $x_1x_2 \cdots x_n = 1$. Prove that \[\displaystyle\sum_{i=1}^n x_i^n (1 + x_i) \geq \dfrac{n}{2^{n-1}} \prod_{i=1}^n (1 + x_i).\] [i]IMO Shortlist[/i]

13. Let $\triangle T B D$ be a triangle with $T B=6, B D=8$, and $D T=7$. Let $I$ be the incenter of $\triangle T B D$, and let $T I$ intersect the circumcircle of $\triangle T B D$ at $M \neq T$. Let lines $T B$ and $M D$ intersect at $Y$, and let lines $T D$ and $M B$ intersect at $X$. Let the circumcircles of $\triangle Y B M$ and $\triangle X D M$ intersect at $Z \neq M$. If the area of $\triangle Y B Z$ is $x$ and the area of $\triangle X D Z$ is $y$, then the ratio $\frac{x}{y}$ can be expressed as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$.

Three points $X,Y$ and $Z$ are given that are, respectively, the circumcenter of a triangle $ABC$, the mid-point of $BC$, and the foot of the altitude from $B$ on $AC$. Show how to reconstruct the triangle $ABC$.

Determine all integers $n\ge1$ for which the number $n^8+n^6+n^4+4$ is prime. (Proposed by Gerhard Woeginger, Austria)

In acute-angled triangle $ABC,$ $AB>AC.$ Let $O,H$ be the circumcenter and orthocenter of $\triangle ABC,$ respectively. The line passing through $H$ and parallel to $AB$ intersects line $AC$ at $M,$ and the line passing through $H$ and parallel to $AC$ intersects line $AB$ at $N.$ $L$ is the reflection of the point $H$ in $MN.$ Line $OL$ and $AH$ intersect at $K.$ Prove that $K,M,L,N$ are concyclic.

We consider a fixed point $P$ in the interior of a fixed sphere$.$ We construct three segments $PA, PB,PC$, perpendicular two by two$,$ with the vertexes $A, B, C$ on the sphere$.$ We consider the vertex $Q$ which is opposite to $P$ in the parallelepiped (with right angles) with $PA, PB, PC$ as edges$.$ Find the locus of the point $Q$ when $A, B, C$ take all the positions compatible with our problem.

In the eight-term sequence $A,B,C,D,E,F,G,H$, the value of $C$ is 5 and the sum of any three consecutive terms is 30. What is $A+H$? $\textbf{(A)}\,17 \qquad\textbf{(B)}\,18 \qquad\textbf{(C)}\,25 \qquad\textbf{(D)}\,26 \qquad\textbf{(E)}\,43$

Consider $n \ge 2$ pairwise disjoint disks $D_1,D_2,\ldots,D_n$ on the Euclidean plane. For each $k=1,2,\ldots,n$, denote by $f_k$ the inversion with respect to the boundary circle of $D_k$. (Here, $f_k$ is defined at every point of the plane, except for the center of $D_k$.) How many fixed points can the transformation $f_n\circ f_{n-1}\circ\ldots\circ f_1$ have, if it is defined on the largest possible subset of the plane?

We are given an infinite cylinder in space (i.e. the locus of points of a given distance $R>0$ from a given straight line). Can six straight lines containing the edges of a tetrahedron all have exactly one common point with this cylinder? [i]Proposed by A. Kuznetsov[/i]

In a triangle $ABC, AB = c, BC = a, CA = b$, and $a < b < c$. Points $B'$ and $A'$ are chosen on the rays $BC$ and $AC$ respectively so that $BB'= AA'= c$. Points $C''$ and $B''$ are chosen on the rays $CA$ and $BA$ so that $CC'' = BB'' = a$. Find the ratio of the segment $A'B'$ to the segment $C'' B''$. (R Zhenodarov)

The number of digits in $4^{16} 5^{25}$ (when written in the usual base 10 form) is A. 31 B. 30 C. 29 D. 28 E. 27

For a natural number $ n, $ a string $ s $ of $ n $ binary digits and a natural number $ k\le n, $ define an $ n,s,k$ [i]-block[/i] as a string of $ k $ consecutive elements from $ s. $ We say that two $ n,s,k\text{-blocks} , $ namely, $ a_1a_2\ldots a_k,b_1b_2\ldots b_k, $ are [i]incompatible[/i] if there exists an $ i\in\{1,2,\ldots ,k\} $ such that $ a_i\neq b_i. $ Also, for two natural numbers $ r\le n, l, $ we say that $ s $ is $ r,l $ [i]-typed[/i] if there are, at most, $ l $ pairwise incompatible $ n,s,r\text{-blocks} . $ Let be a $ 3,7\text{-typed} $ string $ t $ consisting of $ 10000 $ binary digits. Determine the maximum number $ M $ that satisfies the condition that $ t $ is $ 10,M\text{-typed} . $ [i]Cătălin Gherghe[/i]