A string having a small loop in one end is set over a horizontal pipe so that the ends hang loosely. After that, the other end is put through the loop, pulled as far as possible from the pipe and fixed in that position whereby this end of the string is farther from the pipe than the loop. Let $\alpha$ be the angle by which the string turns at the point where it passes through the loop (see picture). Find $\alpha$. [img]https://cdn.artofproblemsolving.com/attachments/2/1/018bb16d80956699e11c641bad9bb3d0083770.png[/img]

Prove that the interval $\lbrack 0,1 \rbrack$ can be split into black and white intervals for any quadratic polynomial $P(x)$, such that the sum of weights of the black intervals is equal to the sum of weights of the white intervals. (Define the weight of the interval $\lbrack a,b \rbrack$ as $P(b) - P(a)$.) Does the same result hold with a degree 3 or degree 5 polynomial?

Twenty numbers $a_1,a_2,..,a_{20}$ satisfy: $$a_k \ge 7k \,\,\,\,\, for \,\,\,\,\, k = 1,2,..., 20$$ $$a_1+a_2+...+a_{20}=1518$$ Prove that among the numbers $k = 1,2,... ,20$ there are no more than seventeen, for which $a_k \ge 20k -2k^2$.

$300$ parliament members are divided into $3$ chambers, each chamber consists of $100$ members. For every $2$ members, they either know each other or are strangers to each other.Show that no matter how they are divided into these $3$ chambers, it is always possible to choose $2$ members, each from different chamber such that there exist $17$ members from the third chamber so that all of them knows these two members, or all of them are strangers to these two members.

An umbrella seller has umbrellas of $7$ different colours. He has a total of $2023$ umbrellas in stock but because of the plastic packaging, the colours are not visible. What is the minimum number of umbrellas that one must buy in order to ensure that at least $23$ umbrellas are of the same colour ?

For $a>1$, evaluate $\int_{\frac{1}{a}}^a \frac{1}{x}(\ln x)\ln\ (x^2+1)dx.$

Compute all real solutions $(x,y)$ with $x\geq y$ that satisfy the pair of equations \begin{align*} xy&=5\\ \frac{x^2+y^2}{x+y}&=3. \end{align*}

$16$ pieces of the shape $1\times 3$ are placed on a $7\times 7$ chessboard, each of which is exactly three fields. One field remains free. Find all possible positions of this field.

Define in the plane the sequence of vectors $v_1, v_2, \ldots$ with initial values $v_1 = (1, 0)$, $v_2 = (-1/\sqrt{2}, 1/\sqrt{2})$ and satisfying the relationship $$v_n=\frac{v_{n-1}+v_{n-2}}{\lVert v_{n-1}+v_{n-2}\rVert},$$ for $n \geq 3$. Show that the sequence is convergent and determine its limit. [b]Note:[/b] The expression $\lVert v \rVert$ denotes the length of the vector $v$.

Solve in $R$ the system: $$\begin{cases} \dfrac{xyz}{x + y + 1}= 1998000\\ \\ \dfrac{xyz}{y + z - 1}= 1998000 \\ \\ \dfrac{xyz}{z+x}= 1998000 \end{cases}$$

$21$ Savage has a $12$ car garage, with a row of spaces numbered $1,2,3,\ldots,12$. How many ways can he choose $6$ of them to park his $6$ identical cars in, if no $3$ spaces with consecutive numbers may be all occupied? [i]2018 CCA Math Bonanza Team Round #9[/i]

Let $ABC$ be a triangle. Let $X$ be the tangency point of the incircle with $BC$. Let $Y$ be the second intersection point of segment $AX$ with the incircle. Prove that \[AX+AY+BC>AB+AC\]

Let $\omega_1$ and $\omega_2$ be two different circles that intersect at two different points, $X$ and $Y$. Let lines $l_1$ and $l_2$ be common tangent lines of these circles such that $l_1$ is tangent $\omega_1$ at $A$ and $\omega_2$ at $C$ and $l_2$ is tangent $\omega_1$ at $B$ and $\omega_2$ at $D$. Let $Z$ be the reflection of $Y$ respect to $l_1$ and let $BC$ and $\omega_1$ meet at $K$ for the second time. Let $AD$ and $\omega_2$ meet at $L$ for the second time. Prove that the line tangent to $\omega_1$ and passes through $K$ and the line tangent to $\omega_2$ and passes through $L$ meet on the line $XZ$.

In triangle $ABC$, let $D$ be the midpoint of $BC$, and $BE$, $CF$ are the altitudes. Prove that $DE$ and $DF$ are both tangents to the circumcircle of triangle $AEF$

$ABCD$ is a square side $1$. $P$ and $Q$ lie on the side $AB$ and $R$ lies on the side $CD$. What are the possible values for the circumradius of $PQR$?

The Judgment of the Council of Sages proceeds as follows: the king arranges the sages in a line and places either a white hat or a black hat on each sage's head. Each sage can see the color of the hats of the sages in front of him, but not of his own hat or of the hats of the sages behind him. Then one by one (in an order of their choosing), each sage guesses a color. Afterward, the king executes those sages who did not correctly guess the color of their own hat. The day before, the Council meets and decides to minimize the number of executions. What is the smallest number of sages guaranteed to survive in this case? See also [url]http://www.artofproblemsolving.com/Forum/viewtopic.php?f=42&t=530553[/url]

For each positive integer $k,$ let $t(k)$ be the largest odd divisor of $k.$ Determine all positive integers $a$ for which there exists a positive integer $n,$ such that all the differences \[t(n+a)-t(n); t(n+a+1)-t(n+1), \ldots, t(n+2a-1)-t(n+a-1)\] are divisible by 4. [i]Proposed by Gerhard Wöginger, Austria[/i]

There is an interval $[a, b]$ that is the solution to the inequality \[|3x-80|\le|2x-105|\] Find $a + b$.

Let K be a point on the side BC of the triangle ABC. The incircles of the triangles ABK and ACK touch BC at points M and N, respectively. Show that [tex]BM\cdot CN>KM \cdot KN[/tex].

A circle $\Gamma$ is tangent to the side $BC$ of a triangle $ABC$ at $X$ and tangent to the side $AC$ at $Y$. A point $P$ is taken on the side $AB$. Let $XP$ and $YP$ intersect $\Gamma$ at $K$ and $L$ for the second time, $AK$ and $BL$ intersect $\Gamma$ at $R$ and $S$ for the second time. Prove that $XR$ and $YS$ intersect on $AB$.

Given an infinite sequence of $0$'s and $1$'s and a fixed integer $k,$ suppose that there are no more than $k$ distinct blocks of $k$ consecutive terms. Show that the sequence is eventually periodic. (For example, the sequence $11011010101$ followed by alternating $0$'s and $1$'s indefinitely, which is periodic beginning with the fifth term.)

Let $n\ge 4$ be a positive integer. Consider any set $A$ formed by $n$ distinct real numbers such that the following condition holds: for every $a\in A$, there exist distinct elements $x, y, z \in A$ such that $\left| x-a \right|, \left| y-a \right|, \left| z-a \right| \ge 1$. For each $n$, find the greatest real number $M$ such that $\sum_{a\in A}^{}\left| a \right|\ge M$.

For each value of parameter $a$, solve the the equation $$ x - \sqrt{x^2-a^2} = \frac{(x-a)^2}{2(x+a)}$$

Let $f:\mathbb{R}\rightarrow[0,\infty )$ be a function with the property that $|f(x)-f(y)|\le |x-y|$ for every $x,y\in\mathbb{R}$. Show that: a) If $\lim_{n\rightarrow \infty} f(x+n)=\infty$ for every $x\in\mathbb{R}$, then $\lim_{x\rightarrow\infty}=\infty$. b) If $\lim_{n\rightarrow \infty} f(x+n)=\alpha ,\alpha\in[0,\infty )$ for every $x\in\mathbb{R}$, then $\lim_{x\rightarrow\infty}=\alpha$.

In the rectangular table shown below, the number $1$ is written in the upper-left hand corner, and every number is the sum of the any numbers directly to its left and above. The table extends infinitely downwards and to the right. \[ \begin{array}{cccccc} 1 & 1 & 1 & 1 & 1 & \cdots \\ 1 & 2 & 3 & 4 & 5 & \cdots \\ 1 & 3 & 6 & 10 & 15 & \cdots \\ 1 & 4 & 10 & 20 & 35 & \cdots \\ 1 & 5 & 15 & 35 & 70 & \cdots \\ \vdots & \vdots & \vdots & \vdots & \vdots & \ddots \end{array} \] Wanda the Worm, who is on a diet after a feast two years ago, wants to eat $n$ numbers (not necessarily distinct in value) from the table such that the sum of the numbers is less than one million. However, she cannot eat two numbers in the same row or column (or both). What is the largest possible value of $n$? [i]Proposed by Evan Chen[/i]