Let $\displaystyle {x, y, z}$ be positive real numbers such that $\displaystyle {xyz = 1}$. Prove the inequality:$$\displaystyle{\dfrac{1}{x\left(ay+b\right)}+\dfrac{1}{y\left(az+b\right)}+\dfrac{1}{z\left(ax+b\right)}\geq 3}$$ if: (A) $\displaystyle {a = 0, b = 1}$ (B) $\displaystyle {a = 1, b = 0}$ (C) $\displaystyle {a + b = 1, \; a, b> 0}$ When the equality holds?

Find real solutions of the system : $$\begin{cases} \sin x + 2 \sin (x+y+z) = 0 \\ \sin y + 3 \sin (x+y+z) = 0\\ \sin z + 4 \sin (x+y+z) = 0\end{cases}$$

$\overline{AB}$ and $\overline{CD}$ are segments of a circle that intersect at a point $P$ outside the circle. Calculate the value of $x$. [img]https://services.artofproblemsolving.com/download.php?id=YXR0YWNobWVudHMvNy9lL2RkZGQwNDViNTA1MzM5MDI0NDQ5MDEyOTZhZGUyNTEyYjgyZTNkLnBuZw==&rn=U2NyZWVuIFNob3QgMjAyMS0wNC0yOCBhdCAxMC4wMy4zMSBBTS5wbmc=[/img]

There are two numbers on a board, $1/2009$ and $1/2008$. Alex and Ben play the following game. At each move, Alex names a number $x$ (of his choice), while Ben responds by increasing one of the numbers on the board (of his choice) by $x$. Alex wins if at some moment one of the numbers on the board becomes $1$. Can Alex win (no matter how Ben plays)?

Prove that for all primes \( p \) such that \( p \equiv 3 \pmod{4} \) or \( p \equiv 5 \pmod{8} \), there exist integers \[ 1 \leq a_1 < a_2 < \cdots < a_{(p-1)/2} < p \] such that \[ \prod_{\substack{1 \leq i < j \leq (p-1)/2}} (a_i + a_j)^2 \equiv 1 \pmod{p}. \]

Find the greatest value of $p$ and the smallest value of $q$ such that for any triangle in the plane, the inequality \[p<\frac{a+m}{b+n}<q\] holds, where $a,b$ are it's two sides and $m,n$ their corresponding medians.

The sum of the squares of five real numbers $a_1, a_2, a_3, a_4, a_5$ equals $1$. Prove that the least of the numbers $(a_i - a_j)^2$, where $i, j = 1, 2, 3, 4,5$ and $i \neq j$, does not exceed $\frac{1}{10}.$

Prove that the sequence defined by: $$ y_ {n + 1} = \frac {1} {2} (3y_ {n} + \sqrt {5y_ {n} ^ {2} -4}) , \,\, \forall n \ge 0$$ with $ y_ {0} = 1$ consists only of integers.

Given an acute-angled triangle $ABC$. A straight line parallel to $BC$ intersects sides $AB$ and $AC$ at points $M$ and $P$, respectively. At what location of the points $M$ and $P$ will the radius of the circle circumscribed about the triangle $BMP$ be the smallest? (I. Sharygin)

Let $f\left(x\right)$ be the greatest prime number at most $x$. Let $g\left(x\right)$ be the least prime number greater than $x$. Find $$\sum_{i=2}^{100}\frac{1}{f\left(i\right)g\left(i\right)}.$$ [i]2017 CCA Math Bonanza Lightning Round #4.3[/i]

We are given a disk $\mathcal D$ of radius $1$ in the plane. (a) Prove that $\mathcal D$ cannot be covered with two disks of radii $r<1$. (b) Prove that, for some $r<1$, $\mathcal D$ can be covered with three disks of radius $r$. What is the smallest such $r$?

Consider a finite field $ K. $ [b]a)[/b] Prove that there is an element $ k $ in $ K $ having the property that the polynom $ X^3+k $ is irreducible in $ K[X], $ if $ \text{ord} (K)\equiv 1\pmod {12}. $ [b]b)[/b] Is [b]a)[/b] still true if, intead, $ \text{ord} (K) \equiv -1\pmod{12} ? $ [i]Dorel Miheț[/i]

Let $a_n = \frac{1}{\binom{2n}{n}}, \forall n \leq 1$. a) Show that $\sum\limits_{n=1}^{+\infty}a_nx^n$ converges for all $x \in (-4, 4)$ and that the function $f(x) = \sum\limits_{n=1}^{+\infty}a_nx^n$ satisfies the differential equation $x(x - 4)f'(x) + (x + 2)f(x) = -x$. b) Prove that $\sum\limits_{n=1}^{+\infty}\frac{1}{\binom{2n}{n}} = \frac{1}{3} + \frac{2\pi\sqrt{3}}{27}$.

$16.$ In an acute angle triangle $ABC,$ let $D$ be the foot of the altitude from $A,$ and $E$ be the midpoint of $BC.$ Let $F$ be the midpoint of $AC.$ Suppose $\angle{BAE}=40^o. $ If $\angle{DAE}=\angle{DFE},$ What is the magnitude of $\angle{ADF}$ in degrees $?$

On the planet Mars there are $100$ states that are in dispute. To achieve a peace situation, blocs must be formed that meet the following two conditions: (1) Each block must have at most $50$ states. (2) Every pair of states must be together in at least one block. Find the minimum number of blocks that must be formed.

Let $a,b,c$ be positive integers such that $a^2 - bc$ is a square. Prove that $2a + b + c$ is not prime. [i]Evan o'Dorney[/i]

Given is an integer sequence $\{a_n\}_{n \ge 0}$ such that $a_{0}=2$, $a_{1}=3$ and, for all positive integers $n \ge 1$, $a_{n+1}=2a_{n-1}$ or $a_{n+1}= 3a_{n} - 2a_{n-1}$. Does there exist a positive integer $k$ such that $1600 < a_{k} < 2000$?

Prove that exists sequences $ (a_n)_{n\ge 0}$ with $ a_n\in \{\minus{}1,\plus{}1\}$, for any $ n\in \mathbb{N}$, such that: \[ \lim_{n\rightarrow \infty}\left(\sqrt{n\plus{}a_1}\plus{}\sqrt{n\plus{}a_2}\plus{}...\plus{}\sqrt{n\plus{}a_n}\minus{}n\sqrt{n\plus{}a_0}\right)\equal{}\frac{1}{2}\]

Asheville, Bakersfield, Charter, and Darlington are four small towns along a straight road in that order. The distance from Bakersfield to Charter is one-third the distance from Asheville to Charter and one-quarter the distance from Bakersfield to Darlington. If it is $12$ miles from Bakersfield to Charter, how many miles is it from Asheville to Darlington?

A chord $PQ$ of the circumcircle of a triangle $ABC$ meets the sides $BC, AC$ at points $A', B'$ respectively. The tangents to the circumcircle at $A$ and $B$ meet at a point $X$, and the tangents at points $P$ and $Q$ meet at point $Y$. The line $XY$ meets $AB$ at a point $C'$. Prove that the lines $AA', BB'$ and $CC'$ concur.

A straight line joins the points $ (\minus{}1,1)$ and $ (3,9)$. Its $ x$-intercept is: $ \textbf{(A)}\ \minus{}\frac{3}{2}\qquad \textbf{(B)}\ \minus{}\frac{2}{3}\qquad \textbf{(C)}\ \frac{2}{5}\qquad \textbf{(D)}\ 2\qquad \textbf{(E)}\ 3$

Let $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$ be positive reals such that \[a_1 + b_1 = a_2 + b_2 = \ldots + a_n + b_n\] and \[\sqrt[n]{\dfrac{a_1a_2\ldots a_n}{b_1b_2\ldots b_n}} \ge n.\] Prove that \[\sqrt[n]{\dfrac{a_1a_2\ldots a_n}{b_1b_2\ldots b_n}} \ge \dfrac{a_1+a_2+\ldots+a_n}{b_1+b_2+\ldots+b_n}.\]

Charlotte is playing the hit new web number game, Primle. In this game, the objective is to guess a two-digit positive prime integer between $10$ and $99$, called the [i]Primle[/i]. For each guess, a digit is highlighted blue if it is in the [i]Primle[/i], but not in the correct place. A digit is highlighted orange if it is in the [i]Primle[/i] and is in the correct place. Finally, a digit is left unhighlighted if it is not in the [i]Primle[/i]. If Charlotte guesses $13$ and $47$ and is left with the following game board, what is the [i]Primle[/i]? $$\begin{array}{c} \boxed{1} \,\, \boxed{3} \\[\smallskipamount] \boxed{4}\,\, \fcolorbox{black}{blue}{\color{white}7} \end{array}$$ [i]Proposed by Andrew Wu and Jason Wang[/i]

A Mediterranean polynomial has only real roots and it is of the form \[ P(x) = x^{10}-20x^9+135x^8+a_7x^7+a_6x^6+a_5x^5+a_4x^4+a_3x^3+a_2x^2+a_1x+a_0 \] with real coefficients $a_0\ldots,a_7$. Determine the largest real number that occurs as a root of some Mediterranean polynomial. [i](Proposed by Gerhard Woeginger, Austria)[/i]

Let $n \geqslant 100$ be an integer. Ivan writes the numbers $n, n+1, \ldots, 2 n$ each on different cards. He then shuffles these $n+1$ cards, and divides them into two piles. Prove that at least one of the piles contains two cards such that the sum of their numbers is a perfect square.