Let $\mathfrak K_1$ and $\mathfrak K_2$ be circles centered at $O_1$ and $O_2,$ respectively, meeting at the points $A$ and $B.$ Let $p$ be the line through the point $A$ meeting the circles $\mathfrak K_1$ and $\mathfrak K_2$ again at $C_1$ and $C_2.$ Assume that $A$ lies between $C_1$ and $C_2.$ Denote the intersection of the lines $C_1O_1$ and $C_2O_2$ by $D.$ Prove that the points $C_1, C_2, B$ and $D$ lie on the same circle.

Let $x,y,z$ be complex numbers such that\\ $\hspace{ 2cm} \frac{x}{y+z}+\frac{y}{z+x}+\frac{z}{x+y}=9$\\ $\hspace{ 2cm} \frac{x^2}{y+z}+\frac{y^2}{z+x}+\frac{z^2}{x+y}=64$\\ $\hspace{ 2cm} \frac{x^3}{y+z}+\frac{y^3}{z+x}+\frac{z^3}{x+y}=488$\\ \\ If $\frac{x}{yz}+\frac{y}{zx}+\frac{z}{xy}=\frac{m}{n}$ where $m,n$ are positive integers with $GCD(m,n)=1$, find $m+n$.

You have $14$ coins, dated $1901$ through $1914$. Seven of these coins are real and weigh $1.000$ ounce each. The other seven are counterfeit and weigh $0.999$ ounces each. You do not know which coins are real or counterfeit. You also cannot tell which coins are real by look or feel. Fortunately for you, Zoltar the Fortune-Weighing Robot is capable of making very precise measurements. You may place any number of coins in each of Zoltar's two hands and Zoltar will do the following: [list][*] If the weights in each hand are equal, Zoltar tells you so and returns all of the coins. [*] If the weight in one hand is heavier than the weight in the other, then Zoltar takes one coin, at random, from the heavier hand as tribute. Then Zoltar tells you which hand was heavier, and returns the remaining coins to you.[/list] Your objective is to identify a single real coin that Zoltar has not taken as tribute. Is there a strategy that guarantees this? If so, then describe the strategy and why it works. If not, then prove that no such strategy exists.

Given positive integers $a,b$, let the integers $q,r$, with $0 \leq r < ab$, be such that $a^2 + b^2 = abq + r$. Prove that $q + r \leq ab + 1$ and find all equality cases.

For how many three-element sets of positive integers $\{a,b,c\}$ is it true that $a \times b \times c = 2310$? $\textbf{(A)}\ 32 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 43 \qquad \textbf{(E)}\ 45$

Orvin went to the store with just enough money to buy $30$ balloons. When he arrived, he discovered that the store had a special sale on balloons: buy $1$ balloon at the regular price and get a second at $\frac{1}{3}$ off the regular price. What is the greatest number of balloons Orvin could buy? $ \textbf {(A) } 33 \qquad \textbf {(B) } 34 \qquad \textbf {(C) } 36 \qquad \textbf {(D) } 38 \qquad \textbf {(E) } 39$

A block of cheese in the shape of a rectangular solid measures $ 10$ cm by $ 13$ cm by $ 14$ cm. Ten slices are cut from the cheese. Each slice has a width of $ 1$ cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off?

A positive interger number $k$ is called “$t-m$”-property if forall positive interger number $a$, there exists a positive integer number $n$ such that ${{1}^{k}}+{{2}^{k}}+{{3}^{k}}+...+{{n}^{k}} \equiv a (\bmod m).$ a) Find all positive integer numbers $k$ which has $t-20$-property. b) Find smallest positive integer number $k$ which has $t-{{20}^{15}}$-property.

Let $s_1,s_2,s_3,s_4,...$ be a sequence (infinite list) of $1$s and $0$s. For example $1,0,1,0,1,0,...$, that is, $s_n=1$ if $n$ is odd and $s_n=0$ if $n$ is even, is such a sequence. Prove that it is possible to delete infinitely many terms in $s_1,s_2,s_3,s_4,...$ so that the resulting sequence is the original sequence. For the given example, one can delete $s_3,s_4,s_7,s_8,s_{11},s_{12},...$

For each arrangement $X$ of $n$ white and $n$ black balls in a row, let $f(X)$ be the number of times the color changes as one moves from one end of the row to the other. For each $k$ such that $0 < k < n$, show that the number of arrangements $X$ with $f(X) = n -k$ is the same as the number with $f(X) = n + k$.

There is a positive real number $x$ not equal to either $\tfrac{1}{20}$ or $\tfrac{1}{2}$ such that $$\log_{20x} (22x)=\log_{2x} (202x).$$ The value $\log_{20x} (22x)$ can be written as $\log_{10} (\tfrac{m}{n})$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Given a regular pentagon, find the ratio of its diagonal, $d$, to its side, $a$

Prove inequallity : $$1+\frac{1}{2^3}+...+\frac{1}{2015^3}<\frac{5}{4}$$

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

Let $ a_1,\ldots,a_n$ be positive reals so that $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le\frac n2$. Find the minimal value of $ \sqrt{a_1^2\plus{}\frac1{a_2^2}}\plus{}\sqrt{a_2^2\plus{}\frac1{a_3^2}}\plus{}\ldots\plus{}\sqrt{a_n^2\plus{}\frac1{a_1^2}}$.

For a positive integer $n$, let $f_n(x)=\cos (x) \cos (2 x) \cos (3 x) \cdots \cos (n x)$. Find the smallest $n$ such that $\left|f_n^{\prime \prime}(0)\right|>2023$.

Points $C_1, A_1$ and $B_1$ are marked on the sides $AB, BC$ and $CA$ of a triangle $ABC$ so that the segments $AA_1, BB_1$, and $CC_1$ are concurrent (see the fig.). It is known that the area of the white part of the triangle $ABC$ is equal to the area of its black part. Prove that at least one of the segments $AA_1, BB_1, CC_1$ is a median of the triangle $ABC$. [img]https://1.bp.blogspot.com/-nVVhqdRdf0s/X-WVmt_gyqI/AAAAAAAAM40/943sCRGyCPwT-vqIilTCtXOXHByRLIvPwCLcBGAsYHQ/s0/2014%2Bbelarus%2B11.6.png[/img]

Form $10A$ has $29$ students who are listed in order on its duty roster. Form $10B$ has $32$ students who are listed in order on its duty roster. Every day two students are on duty, one from form $10A$ and one from form $10B$. Each day just one of the students on duty changes and is replaced by the following student on the relevant roster (when the last student on a roster is replaced he is replaced by the first). On two particular days the same two students were on duty. Is it possible that starting on the first of these days and ending the day before the second, every pair of students (one from $10A$ and one from $10B$) shared duty exactly once?

A three-digit number is written $xyz$ in the base $7$ system and $zyx$ in the base $9$ system . What is the number?

From vertex $A$ of an equilateral triangle $ABC$, a ray $Ax$ intersects $BC$ at point $D$. Let $E$ be a point on $Ax$ such that $BA =BE$. Calculate $\angle AEC$.

Rectangle $ABCD$ has $AB=5$ and $BC=4$. Point $E$ lies on $\overline{AB}$ so that $EB=1$, point $G$ lies on $\overline{BC}$ so that $CG=1$. and point $F$ lies on $\overline{CD}$ so that $DF=2$. Segments $\overline{AG}$ and $\overline{AC}$ intersect $\overline{EF}$ at $Q$ and $P$, respectively. What is the value of $\frac{PQ}{EF}$? [asy] pair A1=(2,0),A2=(4,4); pair B1=(0,4),B2=(5,1); pair C1=(5,0),C2=(0,4); draw(A1--A2); draw(B1--B2); draw(C1--C2); draw((0,0)--B1--(5,4)--C1--cycle); dot((20/7,12/7)); dot((3.07692307692,2.15384615384)); label("$Q$",(3.07692307692,2.15384615384),N); label("$P$",(20/7,12/7),W); label("$A$",(0,4), NW); label("$B$",(5,4), NE); label("$C$",(5,0),SE); label("$D$",(0,0),SW); label("$F$",(2,0),S); label("$G$",(5,1),E); label("$E$",(4,4),N); dot(A1); dot(A2); dot(B1); dot(B2); dot(C1); dot(C2); dot((0,0)); dot((5,4));[/asy] $\textbf{(A)}~\frac{\sqrt{13}}{16} \qquad \textbf{(B)}~\frac{\sqrt{2}}{13} \qquad \textbf{(C)}~\frac{9}{82} \qquad \textbf{(D)}~\frac{10}{91}\qquad \textbf{(E)}~\frac19$

Find all solutions of the equation $(a^a)^5 = b^b$ in positive integers.

Find all functions $f : R_+ \to R_+$ such that $$x^2(f(x)+f(y)) = (x+y)f(f(x)y)$$ for all positive real $x, y$.

$K(x, y), f(x)$ and $g(x)$ are positive and continuous for $x, y \subseteq [0, 1]$. $\int_{0}^{1} f(y) K(x, y) dy = g(x)$ and $\int_{0}^{1} g(y) K(x, y) dy = f(x)$ for all $x \subseteq [0, 1]$. Show that $f = g$ on $[0, 1]$.

Let $a_0=29$, $b_0=1$ and $$a_{n+1} = a_n+a_{n-1}\cdot b_n^{2019}, \qquad b_{n+1}=b_nb_{n-1}$$ for $n\geq 1$. Determine the smallest positive integer $k$ for which $29$ divides $\gcd(a_k, b_k-1)$ whenever $a_1,b_1$ are positive integers and $29$ does not divide $b_1$.