The line joining the midpoints of the diagonals of a trapezoid has length $3$. If the longer base is $97$, then the shorter base is: $ \textbf{(A)}\ 94 \qquad\textbf{(B)}\ 92\qquad\textbf{(C)}\ 91\qquad\textbf{(D)}\ 90\qquad\textbf{(E)}\ 89 $

In some galaxy there are $1000000$ planets and on each of them there are at least $101$ portals. Each portal allows to teleport between some two planets, no two planets are connected by more than one portal. It is known that starting from any planet using portals you can get to any other planet, while it is impossible to return to that planet using once at most 5 different portals. Prove that starting from any planet you can get to any other planet within a year, using at most one portal daily (a year consists of 365 days). [i]M. Zorka[/i]

Prove that the number of nilpotent elements of a commutative ring with an order greater than $ 8 $ and congruent to $ 3 $ modulo $ 6 $ is at most a third of the order of the ring.

When Ringo places his marbles into bags with $6$ marbles per bag, he has $4$ marbles left over. When Paul does the same with his marbles, he has $3$ marbles left over. Ringo and Paul pool their marbles and place them into as many bags as possible, with $6$ marbles per bag. How many marbles will be left over? $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $

Let cevians $AA', BB'$ and $CC'$ of triangle $ABC$ concur at point $P.$ The circumcircle of triangle $PA'B'$ meets $AC$ and $BC$ at points $M$ and $N$ respectively, and the circumcircles of triangles $PC'B'$ and $PA'C'$ meet $AC$ and $BC$ for the second time respectively at points $K$ and $L$. The line $c$ passes through the midpoints of segments $MN$ and $KL$. The lines $a$ and $b$ are defined similarly. Prove that $a$, $b$ and $c$ concur.

Let $m,n$ be two positive integers with $m \ge n \ge 2022$. Let $a_1,a_2,\ldots,a_n,b_1,b_2,\ldots,b_n$ be $2n$ real numbers. Prove that the numbers of ordered pairs $(i,j) ~(1 \le i,j \le n)$ such that \[ |a_i+b_j-ij| \le m \] does not exceed $3n\sqrt{m \log n}$.

For some positive integers $p$, there is a quadrilateral $ABCD$ with positive integer side lengths, perimeter $p$, right angles at $B$ and $C$, $AB=2$, and $CD=AD$. How many different values of $p<2015$ are possible? $\textbf{(A) }30\qquad\textbf{(B) }31\qquad\textbf{(C) }61\qquad\textbf{(D) }62\qquad\textbf{(E) }63$

Let $A,B$ be two fixed points on a plane and $\Omega$ a fixed semicircle arc with diameter $AB$. Let $T$ be another fixed point on $\Omega$, and $\omega$ a fixed circle that passes through $A$ and $T$ and has its center in $\Delta ABT$. Let $P$ be a moving point on the arc $TB$ (endpoints excluded), and $C,D$ be two moving points on $\omega$ such that $C$ lies on segment $AP$, $C,D$ lies on different sides of line $AB$ and $CD\ \bot \ AB$. Denote the circumcenter of $\Delta CDP$ of $K$. Prove that (i) $K$ lies on the circumcircle of $\Delta TDP$. (ii) $K$ is a fixed point.

Let $W(x)$ be a polynomial of integer coefficients such that for any pair of different rational number $r_1$, $r_2$ dependence $W(r_1) \neq W(r_2)$ is true. Decide, whether the assuptions imply that for any pair of different real numbers $t_1$, $t_2$ dependence $W(t_1) \neq W(t_2)$ is true.

$(CZS 1)$ Given a unit cube, find the locus of the centroids of all tetrahedra whose vertices lie on the sides of the cube.

Rose fills each of the rectangular regions of her rectangular flower bed with a different type of flower. The lengths, in feet, of the rectangular regions in her flower bed are as shown in the figure. She plants one flower per square foot in each region. Asters cost $ \$$1 each, begonias $ \$$1.50 each, cannas $ \$$2 each, dahlias $ \$$2.50 each, and Easter lilies $ \$$3 each. What is the least possible cost, in dollars, for her garden? [asy]unitsize(5mm); defaultpen(linewidth(.8pt)+fontsize(8pt)); draw((6,0)--(0,0)--(0,1)--(6,1)); draw((0,1)--(0,6)--(4,6)--(4,1)); draw((4,6)--(11,6)--(11,3)--(4,3)); draw((11,3)--(11,0)--(6,0)--(6,3)); label("1",(0,0.5),W); label("5",(0,3.5),W); label("3",(11,1.5),E); label("3",(11,4.5),E); label("4",(2,6),N); label("7",(7.5,6),N); label("6",(3,0),S); label("5",(8.5,0),S);[/asy]$ \textbf{(A)}\ 108 \qquad \textbf{(B)}\ 115 \qquad \textbf{(C)}\ 132 \qquad \textbf{(D)}\ 144 \qquad \textbf{(E)}\ 156$

Does there exist a convex polyhedron which has a triangular section (by a plane not passing through the vertices) and each vertex of the polyhedron belonging to (a) no less than $ 5$ faces? (b) exactly $5$ faces? (G. Galperin)

A positive integer is equal to the sum of the squares of its four smallest positive divisors. What is the largest prime that divides this positive integer?

Prove that the sum of the squares of the medians of a triangle is at least $ 9/4 $ if the circumradius of the triangle, the area of the triangle and the inradius of the triangle (in this order) are in arithmetic progression. [i]Dumitru Crăciun[/i]

Let be a group with $ 10 $ elements for which there exist two non-identity elements, $ a,b, $ having the property that $ a^2 $ and $ b^2 $ are the identity. Show that this group is not commutative.

A triangle is constructed with the lengths of the sides chosen from the set $\{2, 3, 5, 8, 13, 21, 34, 55, 89, 144\}$. Show that this triangle must be isosceles. (A triangle is isosceles if it has at least two sides the same length.)

2010 MOPpers are assigned numbers 1 through 2010. Each one is given a red slip and a blue slip of paper. Two positive integers, A and B, each less than or equal to 2010 are chosen. On the red slip of paper, each MOPper writes the remainder when the product of A and his or her number is divided by 2011. On the blue slip of paper, he or she writes the remainder when the product of B and his or her number is divided by 2011. The MOPpers may then perform either of the following two operations: [list] [*] Each MOPper gives his or her red slip to the MOPper whose number is written on his or her blue slip. [*] Each MOPper gives his or her blue slip to the MOPper whose number is written on his or her red slip.[/list] Show that it is always possible to perform some number of these operations such that each MOPper is holding a red slip with his or her number written on it. [i]Brian Hamrick.[/i]

A cross with length $p$ (or [i]p-cross[/i] for short) will be called the figure formed by a unit square and 4 rectangles $p-1$ x $1$ on its sides. What’s the least amount of colors one has to use to color the cells of an infinite table, so that each [i]p-cross[/i] on it covers cells, no two of which are in the same color?

On blackboard is written $3$ digit number so all three digits are distinct than zero. Out of it, we made three $2$ digit numbers by crossing out first digit of original number, crossing out second digit of original number and crossing out third digit of original number. Sum of those three numbers is $293$. Which number is written on blackboard?

a) For a finite set of natural numbers $S$, denote by $S+S$ the set of numbers $z=x+y$, where $x,y\in S$. Let $m=|S|$. Show that $|S+S|\leq \frac{m(m+1)}{2}$. b) Let $m$ be a fixed positive integer. Denote by $C(m)$ the greatest integer $k\geq 1$ for which there exists a set $S$ of $m$ integers, such that $\{1,2,\ldots,k\}\subseteq S\cup(S+S)$. For example, $C(3)=8$, with $S=\{1,3,4\}$. Show that $\frac{m(m+6)}{4}\leq C(m) \leq \frac{m(m+3)}{2}$.

Positive integer $q{}$ is $m-additive$ $(m\in\mathbb{N}, m\geq2)$ if there exist pairwise distinct positive integers $a_1,a_2,\ldots,a_m$ such that $q=a_1+a_2+\ldots+a_m$ and $a_i | a_{i+1}$ for $i=1,2,\ldots,m-1$. [b]a)[/b] Prove that $1993$ is $8$-additive, but $9$-additive. [b]b)[/b] Determine the greatest integer $m$ for which $2102$ is $m$-additive.

Find the number of pairs $(a,b)$ of natural nunbers such that $b$ is a 3-digit number, $a+1$ divides $b-1$ and $b$ divides $a^{2} + a + 2$.

The diagram below shows an $8$x$7$ rectangle with a 3-4-5 right triangle drawn in each corner. The lower two triangles have their sides of length 4 along the bottom edge of the rectangle, while the upper two triangles have their sides of length 3 along the top edge of the rectangle. A circle is tangent to the hypotenuse of each triangle. The diameter of the circle is $\frac{m}{n}$ , where m and n are relatively prime positive integers. Find m + n. For diagram go to http://www.purplecomet.org/welcome/practice, go to the 2015 middle school contest questions, and then go to #20

Let $ x$,$ y$, and $ z$ be three positive real numbers whose sum is $ 1$. If no one of these numbers is more than twice any other, then the minimum possible value of the product $ xyz$ is $ \textbf{(A)}\ \frac{1}{32}\qquad \textbf{(B)}\ \frac{1}{36}\qquad \textbf{(C)}\ \frac{4}{125}\qquad \textbf{(D)}\ \frac{1}{127}\qquad \textbf{(E)}\ \text{none of these}$

I was wondering if anyone had a sol for this. I am probably just going to bash it out.