Show that $ \rho (f)$ changes continously over $ f$. It means for every bijection $ f: S^1\rightarrow S^1$ and $ \epsilon > 0$ there is $ \delta > 0$ such that if $ g: S^1\rightarrow S^1$ is a bijection such that $ \parallel{}f \minus{} g\parallel{} < \delta$ then $ |\rho(f) \minus{} \rho(g)| < \epsilon$. Note that $ \rho(f)$ is the rotatation number of $ f$ and $ \parallel{}f \minus{} g\parallel{} \equal{} \sup\{|f(x) \minus{} g(x)| | x\in S^1\}$.

Two different cubes of the same size are to be painted, with the color of each face being chosen independently and at random to be either black or white. What is the probability that after they are painted, the cubes can be rotated to be identical in appearance? $\textbf{(A)}\ \frac{9}{64} \qquad\textbf{(B)}\ \frac{289}{2048} \qquad\textbf{(C)}\ \frac{73}{512} \qquad\textbf{(D)}\ \frac{147}{1024} \qquad\textbf{(E)}\ \frac{589}{4096}$

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

Let $A$, $F$, $L$, $M$, and $T$ be distinct digits such that $\overline{FALL} + \overline{LMT} = 2024$ and $F$, $L > 0$. Find the sum of all possible values of $\overline{FAT}$.

In a triangle with integer side lengths, one side is three times as long as a second side, and the length of the third side is $17$. What is the greatest possible perimeter of the triangle?

For each integer $n\ge 1,$ compute the smallest possible value of \[\sum_{k=1}^{n}\left\lfloor\frac{a_k}{k}\right\rfloor\] over all permutations $(a_1,\dots,a_n)$ of $\{1,\dots,n\}.$ [i]Proposed by Shahjalal Shohag, Bangladesh[/i]

Three lines $m$, $n$, and $\ell$ lie in a plane such that no two are parallel. Lines $m$ and $n$ meet at an acute angle of $14^{\circ}$, and lines $m$ and $\ell$ meet at an acute angle of $20^{\circ}$. Find, in degrees, the sum of all possible acute angles formed by lines $n$ and $\ell$. [i]Ray Li[/i]

The number $2013$ is expressed in the form \[2013=\frac{a_1!a_2!\cdots a_m!}{b_1!b_2!\cdots b_n!},\] where $a_1\ge a_2\ge\cdots\ge a_m$ and $b_1\ge b_2\ge\cdots\ge b_n$ are positive integers and $a_1+b_1$ is as small as possible. What is $|a_1-b_1|$? ${ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D}}\ 4\qquad\textbf{(E)}\ 5 $

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

Given are integers $a, b, c$ and an odd prime $p.$ Prove that $p$ divides $x^2 + y^2 + ax + by + c$ for some integers $x$ and $y.$ [i](A. Golovanov )[/i]

There are $40$ identical gas cylinders, gas pressure values in which we are unknown and may be evil. It is allowed to connect any cylinders with each other in an amount not exceeding a given natural number $k$, and then separate them; while the pressure gas in the connected cylinders is set equal to the arithmetic average of the pressures in them before the connection. At what minimum $k$ is there a way to equalize the pressures in all $40$ cylinders, regardless of initial pressure distribution in the cylinders?

Let $a, b$, and $c$ be positive real numbers. Find the largest integer $n$ such that $$\frac{1}{ax + b + c} +\frac{1}{a + bx + c}+\frac{1}{a + b + cx} \ge \frac{n}{a + b + c},$$ for all $ x \in [0, 1]$ .

Let $ABCD$ be a convex quadrilateral with non perpendicular diagonals and with the sides $AB$ and $CD$ non parallel . Denote by $O$ the intersection of the diagonals , $H_1$ the orthocenter of the triangle $AOB$ and $H_2$ the orthocenter of the triangle $COD$ . Also denote with $M$ the midpoint of the side $AB$ and with $N$ the midpoint of the side $CD$ . Prove that $H_1H_2$ and $MN$ are parallel if and only if $AC=BD$

A rectangle $ABCD$ has side lengths $AB = m$, $AD = n$, with $m$ and $n$ relatively prime and both odd. It is divided into unit squares and the diagonal AC intersects the sides of the unit squares at the points $A_1 = A, A_2, A_3, \ldots , A_k = C$. Show that \[ A_1A_2 - A_2A_3 + A_3A_4 - \cdots + A_{k-1}A_k = {\sqrt{m^2+n^2}\over mn}. \]

Let $ABC$ be a triangle, and let $D$ be a point on the internal angle bisector of $BAC$. Let $x$ be the ellipse with foci $B$ and $C$ passing through $D$, $y$ be the ellipse with foci $A$ and $C$ passing through $D$, and $z$ be the ellipse with foci $A$ and $B$ passing through $D$. Ellipses $x$ and $z$ intersect at distinct points $D$ and $E$, and ellipses $x$ and $y$ intersect at distinct points $D$ and $F$. Prove that $AD$ bisects angle $EAF$. [i]Andrew Carratu[/i]

Let $ N$ be a positive integer. How many non-negative integers $ n \le N$ are there that have an integer multiple, that only uses the digits $ 2$ and $ 6$ in decimal representation?

Simplify $\sum_{k=1}^{n}\frac{k^2(k - n)}{n^4}$

Each of the first $150$ positive integers is painted on a different marble, and the $150$ marbles are placed in a bag. If $n$ marbles are chosen (without replacement) from the bag, what is the smallest value of $n$ such that we are guaranteed to choose three marbles with consecutive numbers?

Suppose $S = \{1, 2, 3, x\}$ is a set with four distinct real numbers for which the difference between the largest and smallest values of $S$ is equal to the sum of elements of $S.$ What is the value of $x?$ $$ \mathrm a. ~ {-1}\qquad \mathrm b.~{-3/2}\qquad \mathrm c. ~{-2} \qquad \mathrm d. ~{-2/3} \qquad \mathrm e. ~{-3} $$

Suppose that a sequence $a_1,a_2,\ldots$ of positive real numbers satisfies \[a_{k+1}\geq\frac{ka_k}{a_k^2+(k-1)}\] for every positive integer $k$. Prove that $a_1+a_2+\ldots+a_n\geq n$ for every $n\geq2$.

Let be a natural number $ n $ and $ 2n $ real numbers $ b_1,b_2,\ldots ,b_n,a_1<a_2<\cdots <a_n. $ Show that [b]a)[/b] if $ b_1,b_2,\ldots ,b_n>0, $ then there exists a polynomial $ f\in\mathbb{R}[X] $ irreducible in $ \mathbb{R}[X] $ such that $$ f\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$ [b]b)[/b] there exists a polynom $ g\in\mathbb{R} [X] $ of degree at least $ 1 $ which has only real roots and such that $$ g\left( a_i \right) =b_i,\quad\forall i\in\{ 1,2,\ldots ,n \} . $$

Prove that for any given positive integer $m$ and $n$, there is always a positive integer $k$ so that $2^k-m$ has at least $n$ different prime divisors.

If $a!+\left(a+2\right)!$ divides $\left(a+4\right)!$ for some nonnegative integer $a$, what are all possible values of $a$? [i]2019 CCA Math Bonanza Individual Round #8[/i]

Let there be an equilateral triangle $ABC$ and a point $P$ in its plane such that $AP<BP<CP.$ Suppose that the lengths of segments $AP,BP$ and $CP$ uniquely determine the side of $ABC$. Prove that $P$ lies on the circumcircle of triangle $ABC.$

Let $ a$, $ b$, $ c$ be positive real numbers such that $ abc \equal{} 1$. Prove that \[ \frac {1}{a^{3}\left(b \plus{} c\right)} \plus{} \frac {1}{b^{3}\left(c \plus{} a\right)} \plus{} \frac {1}{c^{3}\left(a \plus{} b\right)}\geq \frac {3}{2}. \]