Let $x$ be a positive integer less than $200$, and let $y$ be obtained by writing the base 10 digits of $x$ in reverse order. Given that $x$ and $y$ satisfy $11x^2+363y=7xy+6571$, find $x$.

We are given an infinite deck of cards, each with a real number on it. For every real number $x$, there is exactly one card in the deck that has $x$ written on it. Now two players draw disjoint sets $A$ and $B$ of $100$ cards each from this deck. We would like to define a rule that declares one of them a winner. This rule should satisfy the following conditions: 1. The winner only depends on the relative order of the $200$ cards: if the cards are laid down in increasing order face down and we are told which card belongs to which player, but not what numbers are written on them, we can still decide the winner. 2. If we write the elements of both sets in increasing order as $A =\{ a_1 , a_2 , \ldots, a_{100} \}$ and $B= \{ b_1 , b_2 , \ldots , b_{100} \}$, and $a_i > b_i$ for all $i$, then $A$ beats $B$. 3. If three players draw three disjoint sets $A, B, C$ from the deck, $A$ beats $B$ and $B$ beats $C$ then $A$ also beats $C$. How many ways are there to define such a rule? Here, we consider two rules as different if there exist two sets $A$ and $B$ such that $A$ beats $B$ according to one rule, but $B$ beats $A$ according to the other. [i]Proposed by Ilya Bogdanov, Russia[/i]

A street on Stanford can be modeled by a number line. Four Stanford students, located at positions $1$, $9$, $25$ and $49$ along the line, want to take an UberXL to Berkeley, but are not sure where to meet the driver. Find the smallest possible total distance walked by the students to a single position on the street. (For example, if they were to meet at position $46$, then the total distance walked by the students would be $45 + 37 + 21 + 3 = 106$, where the distances walked by the students at positions $1$, $9$, $25$ and $49$ are summed in that order.)

A point $P$ moves along a circle $\Omega$. Let $A$ and $B$ be two fixed points of $\Omega$, and $C$ be an arbitrary point inside $\Omega$. The common external tangents to the circumcircles of triangles $APC$ and $BCP$ meet at point $Q$. Prove that all points $Q$ lie on two fixed lines.

Let $ A$ be a set of $ 2n$ points on the plane such that no three points are collinear. Prove that for any distinct two points $ a,b\in A$ there exists a line that partitions $ A$ into two subsets each containing $ n$ points and such that $ a,b$ lie on different sides of the line.

Let $M{}$ be the midpoint of the side $BC$ of the triangle $ABC$. The circle $\omega$ passes through $A{}$, touches the line $BC$ at $M{}$, intersects the side $AB$ at the point $D{}$ and the side $AC$ at the point $E{}$. Let $X{}$ and $Y{}$ be the midpoints of $BE$ and $CD$ respectively. Prove that the circumcircle of the triangle $MXY$ touches $\omega$. [i]Alexey Doledenok[/i]

In a circle of center $O$ and radius $r$, a triangle $ABC$ of orthocenter $H$ is inscribed. It is considered a triangle $A'B'C'$ whose sides have by length the measurements of the segments $AB, CH$ and $2r$. Determine the triangle $ABC$ so that the area of the triangle $A'B'C'$ is maximum.

Let $ a, b, c, d$ be positive integers such that $ ab \equal{} cd$ and $ a\plus{}b \equal{} c \minus{} d.$ Prove that there exists a right-angled triangle the measure of whose sides (in some unit) are integers and whose area measure is $ ab$ square units.

Find all integers \(a,b,c\) such that \(a^{2}=bc+4\) and \(b^{2}=ca+4\).

Once in a restaurant [b][i]Dr. Strange[/i][/b] found out that there were 12 types of food items from 1 to 12 on the menu. He decided to visit the restaurant 12 days in a row and try a different food everyday. 1st day, he tries one of the items from the first two. On the 2nd day, he eats either item 3 or the item he didn’t tried on the 1st day. Similarly, on the 3rd day, he eats either item 4 or the item he didn’t tried on the 2nd day. If someday he's not able to choose items that way, he eats the item that remained uneaten from the menu. In how many ways can he eat the items for 12 days?

At $n$ distinct points of a circular race course there are $n$ cars ready to start. Each car moves at a constant speed and covers the circle in an hour. On hearing the initial signal, each of them selects a direction and starts moving immediately. If two cars meet, both of them change directions and go on without loss of speed. Show that at a certain moment each car will be at its starting point.

$ABCDA_{1}B_{1}C_{1}D_{1}$ is a cube with side length $4a$. Points $E$ and $F$ are taken on $(AA_{1})$ and $(BB_{1})$ such that $AE=B_{1}F=a$. $G$ and $H$ are midpoints of $(A_{1}B_{1})$ and $(C_{1}D_{1})$, respectively. Find the minimum value of the $CP+PQ$, where $P\in[GH]$ and $Q\in[EF]$.

There are $2$ runners on the perimeter of a regular hexagon, initially located at adjacent vertices. Every second, each of the runners independently moves either one vertex to the left, with probability $\frac{1}{2}$, or one vertex to the right, also with probability $\frac{1}{2}$. Find the probability that after a $2013$ second run (in which runners switch vertices $2013$ times each), the runners end up at adjacent vertices once again.

In a parallelogram $ABCD$ , $BD$ is the largest diagonal. By matching $B$ with $D$ by a bend, a regular pentagon is formed. Calculate the measures of the angles formed by the diagonal $BD$ with each of the sides of the parallelogram.

Suppose $x, y, a$ are real numbers such that $x+y = x^3 +y^3 = x^5 +y^5 = a$. Find all possible values of $a.$

Let $ABCD$ be a quadrilateral inscribed in circle $\omega$. Define $E = AA \cap CD$, $F = AA \cap BC$, $G = BE \cap \omega$, $H = BE \cap AD$, $I = DF \cap \omega$, and $J = DF \cap AB$. Prove that $GI$, $HJ$, and the $B$-symmedian are concurrent. [i]Proposed by Robin Park[/i]

A quadrilateral $ABCD$ is circumscribed about a circle $\omega$. The intersection point of $\omega$ and the diagonal $AC$, closest to $A$, is $E$. The point $F$ is diametrally opposite to the point $E$ on the circle $\omega$. The tangent to $\omega$ at the point $F$ intersects lines $AB$ and $BC$ in points $A_1$ and $C_1$, and lines $AD$ and $CD$ in points $A_2$ and $C_2$, respectively. Prove that $A_1C_1=A_2C_2$.

Let $ p$ be an odd prime number and $ a_1,a_2,...,a_p$ and $ b_1,b_2,...,b_p$ two arbitrary permutations of the numbers $ 1,2,...,p$ . Show that the least positive residues modulo $ p$ of the numbers $ a_1b_1, a_2b_2,...,a_pb_p$ never form a permutation of the numbers $ 1,2,...,p$.

Define a family of functions $S_k(n)$ for positive integers $n$ and $k$ by the following two rules: $$S_0(n) = 1,$$ $$S_k(n) = \sum_{d | n} dS_{k-1}(d).$$ Compute the remainder when $S_{30}(30)$ is divided by $1001$.

Let $f:\mathbb{R}^+_0 \rightarrow \mathbb{R}^+_0$ be a strictly decreasing function. (a) Be $a_n$ a sequence of strictly positive reals so that $\forall k \in \mathbb{N}_0:k\cdot f(a_k)\geq (k+1)\cdot f(a_{k+1})$ Prove that $a_n$ is ascending, that $\displaystyle\lim_{k\rightarrow +\infty} f(a_k)$ = 0and that $\displaystyle\lim_{k\rightarrow +\infty} a_k =+\infty$ (b) Prove that there exist such a sequence ($a_n$) in $\mathbb{R}^+_0$ if you know $\displaystyle\lim_{x\rightarrow +\infty} f(x)=0$.

In four-dimensional space, the $24$-cell of sidelength $\sqrt{2}$ is the convex hull of (smallest convex set containing) the $24$ points $(\pm 1, \pm 1, 0, 0)$ and its permutations. Find the four-dimensional volume of this region.

Prove that the sequence $ \{y_{n}\}_{n \ge 1}$ defined by \[ y_{0}=1, \; y_{n+1}= \frac{1}{2}\left( 3y_{n}+\sqrt{5y_{n}^{2}-4}\right) \] consists only of integers.

$ABCD$ is a rectangle. $I$ is the midpoint of $CD$. $BI$ meets $AC$ at $M$. Show that the line $DM$ passes through the midpoint of $BC$. $E$ is a point outside the rectangle such that $AE = BE$ and $\angle AEB = 90^o$. If $BE = BC = x$, show that $EM$ bisects $\angle AMB$. Find the area of $AEBM$ in terms of $x$.

Let $f:\mathbb{R}^+\to \mathbb{R}^+$ be a function such that for all $x,y \in \mathbb{R}+,\, f(x)f(y)=f(xy)+f\left(\frac{x}{y}\right)$, where $\mathbb{R}^+$ represents the positive real numbers. Given that $f(2)=3$, compute the last two digits of $f\left(2^{2^{2020}}\right)$.

Fiona had a solid rectangular block of cheese that measured $6$ centimeters from left to right, $5$ centimeters from front to back, and $4$ centimeters from top to bottom. Fiona took a sharp knife and sliced off a $1$ centimeter thick slice from the left side of the block and a $1$ centimeter slice from the right side of the block. After that, she sliced off a $1$ centimeter thick slice from the front side of the remaining block and a $1$ centimeter slice from the back side of the remaining block. Finally, Fiona sliced off a $1$ centimeter slice from the top of the remaining block and a $1$ centimeter slice from the bottom of the remaining block. Fiona now has $7$ blocks of cheese. Find the total surface area of those seven blocks of cheese measured in square centimeters.