If $a$ is any number, $\lfloor a \rfloor$ is $a$ rounded down to the nearest integer. For example, $\lfloor \pi \rfloor =$ $3$. Show that the sequence $\lfloor \frac{2^{1}}{17} \rfloor$, $\lfloor \frac{2^{2}}{17} \rfloor$, $\lfloor \frac{2^{3}}{17} \rfloor$, $\dots$ contains infinitely many odd numbers.

If $ a\otimes b =\frac{a+b}{a-b} $ , then $ (6\otimes 4)\otimes 3 = $ = $ \text{(A)}\ 4\qquad\text{(B)}\ 13\qquad\text{(C)}\ 15\qquad\text{(D)}\ 30\qquad\text{(E)}\ 72 $

Do there exist two positive powers of $5$ such that the number obtained by writing one after the other is also a power of $5$?

Sammy and Tammy run laps around a circular track that has a radius of $1$ kilometer. They begin and end at the same point and at the same time. Sammy runs $3$ laps clockwise while Tammy runs $4$ laps counterclockwise. How many times during their run is the straight-line distance between Sammy and Tammy exactly $1$ kilometer? $\text{(A) }7\qquad\text{(B) }8\qquad\text{(C) }13\qquad\text{(D) }14\qquad\text{(E) }21$

What is the largest $n$ such that a square cannot be partitioned into $n$ smaller, non-overlapping squares?

In an isosceles triangle $ABC, I$ is the center of the inscribed circle, $M_1$ is the midpoint of the side $BC, K_2, K_3$ are the points of contact of the inscribed circle of the triangle with segments $AC$ and $AB$, respectively. The point $P$ lies on the circumcircle of the triangle $BCI$, and the angle $M_1PI$ is right. Prove that the lines $BC, PI, K_2K_3$ intersect at one point. (Mikhail Plotnikov)

Let $k$ be a fixed circle in a given plane and a point $C$ out of the plane. Let $A$ be a random point from $k$ and $B$ be its diametrically opposite one in $k$. Find the geometric place of the center of the circumscribed circle of $ABC$.

Let $H$ be the orthocenter of an acute-angled triangle $ABC$. The circumcircle of triangle $AHC$ meets segments $AB$ and $BC$ at points $P$ and $Q$. Lines $PQ$ and $AC$ meet at point $R$. A point $K$ lies on the line $PH$ in such a way that $\angle KAC = 90^{\circ}$. Prove that $KR$ is perpendicular to one of the medians of triangle $ABC$.

An ancient noble family has $n$ members, each holding a different number of posts . As every year in December, they gather at a very specific place for a Council of War to be held, where also k, from the point of view of the high nobility, unimportant spammers speak up, which, due to their irrelevance, should and cannot be further differentiated. The Council is held as follows: those present speak one after the other, each one carefully put forward his request once. In addition, for reasons of respect, a nobleman never speaks right after a nobleman who holds more posts, while the common people disregarde such rules. Find the number of possible sequences of the Council of war.

Given a circumscribed trapezium $ ABCD$ with circumcircle $ \omega$ and 2 parallel sides $ AD,BC$ ($ BC<AD$). Tangent line of circle $ \omega$ at the point $ C$ meets with the line $ AD$ at point $ P$. $ PE$ is another tangent line of circle $ \omega$ and $ E\in\omega$. The line $ BP$ meets circle $ \omega$ at point $ K$. The line passing through the point $ C$ paralel to $ AB$ intersects with $ AE$ and $ AK$ at points $ N$ and $ M$ respectively. Prove that $ M$ is midpoint of segment $ CN$.

Let $ABCD$ be a convex quadrilateral. Assume line $AB$ and $CD$ intersect at $E$, and $B$ lies between $A$ and $E$. Assume line $AD$ and $BC$ intersect at $F$, and $D$ lies between $A$ and $F$. Assume the circumcircles of $\triangle BEC$ and $\triangle CFD$ intersect at $C$ and $P$. Prove that $\angle BAP=\angle CAD$ if and only if $BD\parallel EF$.

A circle is centered at point $O$ in the plane. Distinct pairs of points $A, B$ and $C, D$ are diametrically opposite on this circle. Point $P$ is chosen on line segment $AD$ such that line $BP$ hits the circle again at $M$ and line $AC$ at $X$ such that $M$ is the midpoint of $PX$. Now, the point $Y \neq X$ is taken for $BX = BY, CD \parallel XY$. IF $\angle PYB = 10^{\circ}$, find the measure of $\angle XCM$. Proposed by Albert Wang (awang11)

A subset $E$ of the set $\{1,2,3,\ldots,50\}$ is said to be [i]special[/i] if it does not contain any pair of the form $\{x,3x\}.$ A special set $E$ is [i]superspecial[/i] if it contains as many elements as possible. How many element there are in a superspecial set and how many superspecial sets there are?

(a) The point $O$ lies inside the convex polygon $A_1A_2A_3...A_n$ . Consider all the angles $A_iOA_j$ where $i, j$ are distinct natural numbers from $1$ to $n$ . Prove that at least $n- 1$ of these angles are not acute . (b) Same problem for a convex polyhedron with $n$ vertices. (V. Boltyanskiy, Moscow)

Let's consider the real numbers $x_1, x_2, x_3, x_4$ satisfying the condition \[ \dfrac{1}{2}\le x_1^2+x_2^2+x_3^2+x_4^2\le 1 \] Find the maximal and the minimal values of expression: \[ A = (x_1 - 2 \cdot x_2 + x_3)^2 + (x_2 - 2 \cdot x_3 + x_4)^2 + (x_2 - 2 \cdot x_1)^2 + (x_3 - 2 \cdot x_4)^2 \]

Determine all integers $ n\geq 2$ having the following property: for any integers $a_1,a_2,\ldots, a_n$ whose sum is not divisible by $n$, there exists an index $1 \leq i \leq n$ such that none of the numbers $$a_i,a_i+a_{i+1},\ldots,a_i+a_{i+1}+\ldots+a_{i+n-1}$$ is divisible by $n$. Here, we let $a_i=a_{i-n}$ when $i >n$. [i]Proposed by Warut Suksompong, Thailand[/i]

A $17 \times 17$ square is cut out of a sheet of graph paper. Each cell of this square has one of thenumbers from $1$ to $70$. Prove that there are $4$ distinct squares whose centers $A, B, C, D$ are the vertices of a parallelogramsuch that $AB // CD$, moreover, the sum of the numbers in the squares with centers $A$ and $C$ is equal to that in the squares with centers $B$ and $D$.

An acute triangle $ABC$ ($AB > AC$) has circumcenter $O$, but $D$ is the midpoint of $BC$. Circle with diameter $AD$ intersects sides $AB$ and $AC$ in $E$ and $F$ respectively. On segment $EF$ pick a point $M$ so that $DM \parallel AO$. Prove that triangles $ABD$ and $FDM$ are similar.

The sum of all even positive integers less than $100$ those are not divisible by $3$ is (A): $938$, (B): $940$, (C): $1634$, (D): $1638$, (E): None of the above.

In an acute triangle $ABC$ the altitudes $AA_1$, $BB_1$, $CC_1$ are drawn. A line perpendicular to side $AC$ and passing through a point $A_1$, intersects the line $B_1C_1$ at point $D$. Prove that angle $ADC$ is right.

Let $ \lambda \in (0,2) $ and $ a,b,c,d\in\mathbb{R} $ so that $ a\le b\le c. $ Prove the inequality: $$ (a+b+c+d)^2\ge 4\lambda (ac+bd). $$

Does there exist positive integers $a_{1}<a_{2}<\cdots<a_{100}$ such that for $2 \le k \le 100$, the greatest common divisor of $a_{k-1}$ and $a_{k}$ is greater than the greatest common divisor of $a_{k}$ and $a_{k+1}$?

Bamal, Halvan, and Zuca are playing [i]The Game[/i]. To start, they‘re placed at random distinct vertices on regular hexagon $ABCDEF$. Two or more players collide when they‘re on the same vertex. When this happens, all the colliding players lose and the game ends. Every second, Bamal and Halvan teleport to a random vertex adjacent to their current position (each with probability $\dfrac{1}{2}$), and Zuca teleports to a random vertex adjacent to his current position, or to the vertex directly opposite him (each with probability $\dfrac{1}{3}$). What is the probability that when [i]The Game[/i] ends Zuca hasn‘t lost? [i]Proposed by Edwin Zhao[/i] [hide=Solution][i]Solution.[/i] $\boxed{\dfrac{29}{90}}$ Color the vertices alternating black and white. By a parity argument if someone is on a different color than the other two they will always win. Zuca will be on opposite parity from the others with probability $\dfrac{3}{10}$. They will all be on the same parity with probability $\dfrac{1}{10}$. At this point there are $2 \cdot 2 \cdot 3$ possible moves. $3$ of these will lead to the same arrangement, so we disregard those. The other $9$ moves are all equally likely to end the game. Examining these, we see that Zuca will win in exactly $2$ cases (when Bamal and Halvan collide and Zuca goes to a neighboring vertex). Combining all of this, the answer is $$\dfrac{3}{10}+\dfrac{2}{9} \cdot \dfrac{1}{10}=\boxed{\dfrac{29}{90}}$$ [/hide]

Alice and Bob play a game. First, Alice secretly picks a finite set $S$ of lattice points in the Cartesian plane. Then, for every line $\ell$ in the plane which is horizontal, vertical, or has slope $+1$ or $-1$, she tells Bob the number of points of $S$ that lie on $\ell$. Bob wins if he can determine the set $S$. Prove that if Alice picks $S$ to be of the form \[S = \{(x, y) \in \mathbb{Z}^2 \mid m \le x^2 + y^2 \le n\}\] for some positive integers $m$ and $n$, then Bob can win. (Bob does not know in advance that $S$ is of this form.) [i]Proposed by Mark Sellke[/i]

Given quadratic trinomials $P(x)=x^2+ax+b$ and $Q(x)=x^2+cx+d$, where $a>c$. It is known that for every real $t$ and $s$ with $t+s=1$ the polynomial $B(x)=tP(x)+sQ(x)$ has at least one real root. Prove that $bc \geq ad$.