Sum of all roots of the equation $$cos^{100} x + a_1 cos^{99} x + a_2cos^{98} x +... + a_99 cos x+ a_{100} = 0$$, in interval $\left[\pi, \frac{3\pi}{2} \right]$, is equal to $21\pi$, and the sum of all roots of the equation $$sin^{100} x + a_1 sin^{99} x + a_2sin ^{98} x +... + a_99sin x+ a_{100} = 0$$, in the same interval, is equal to $24\pi $. How many roots does the first equation have on the segment $\left[ \frac{\pi}{2}, \pi\right]$?

Let $a_1, a_2, ..., a_{2012}$ be pairwise distinct integers. Show that the equation $(x -a_1)(x - a_2)...(x - a_{2012}) = (1006!)^2$ has at most one integral solution.

Let $ ABC$ be a triangle with centroid $ G$ and $ A_1,B_1,C_1$ midpoints of the sides $ BC,CA,AB$. A paralel through $ A_1$ to $ BB_1$ intersects $ B_1C_1$ at $ F$. Prove that triangles $ ABC$ and $ FA_1A$ are similar if and only if quadrilateral $ AB_1GC_1$ is cyclic.

Let $a,b,c$ be integers satisfying $a+b+c=1$ and $ab+bc+ca<abc$. Show that $ab+bc+ca<2abc$.

Let $A = \{1,2,3,4,5,6,7,8\}$, $B = \{9,10,11,12,13,14,15,16\}$ and $C =\{17,18,19,20,21,22,23,24\}$. Find the number of triples $(x, y, z)$ such that $x \in A, y \in B, z \in C $ and $x + y + z = 36$.

Grid the plane forming an infinite board. In each cell of this board, there is a lamp, initially turned off. A permitted operation consists of selecting a square of \(3\times 3\), \(4\times 4\), or \(5\times 5\) cells and changing the state of all lamps in that square (those that are off become on, and those that are on become off). (a) Prove that for any finite set of lamps, it is possible to achieve, through a finite sequence of permitted operations, that those are the only lamps turned on on the board. (b) Prove that if in a sequence of permitted operations only two out of the three square sizes are used, then it is impossible to achieve that at the end the only lamps turned on on the board are those in a \(2\times 2\) square.

How many lattice points $P$ in or on the circle $x^2+y^2=25$ have the property that there exists a unique line with rational slope through $P$ that divides the circle into two parts with equal areas? [i]Proposed by Nathan Ramesh

Let $m\ge 2$ be an integer, $A$ a finite set of integers (not necessarily positive) and $B_1,B_2,...,B_m$ subsets of $A$. Suppose that, for every $k=1,2,...,m$, the sum of the elements of $B_k$ is $m^k$. Prove that $A$ contains at least $\dfrac{m}{2}$ elements.

Prove that $$(1 + x)(1 + x^2)(1 + x^4)(1 + x^8) ... (1 + x^{2^{k-1}} ) = 1 + x + x^2 + x^3 +... + x^{2^{k-1}}$$

Among the points corresponding to number $1,2,...,2n$ on the real line, $n$ are colored in blue and $n$ in red. Let $a_1,a_2,...,a_n$ be the blue points and $b_1,b_2,...,b_n$ be the red points. Prove that the sum $\mid a_1-b_1\mid+...+\mid a_n-b_n\mid$ does not depend on coloring , and compute its value. :roll:

At least $3$ players take part in a tennis tournament. Each participant plays exactly one match against each other participant. After the tournament has ended, we find out that each player has won at least one match. (There are no ties in tennis). Show that in the tournament, there was at least one trio of players $A,B,C$ such that $A$ beat $B$, $B$ beat $C$, and $C$ beat $A$.

Define $ f: \mathbb{R}\to\mathbb{R}$ by \[ f(x)\equal{}\begin{cases}x&\text{if }x\le e\\ xf(\ln x)&\text{if }x>e\end{cases}\] Does $ \displaystyle\sum_{n\equal{}1}^{\infty}\frac1{f(n)}$ converge?

Does there exist a set $ M$ of points in space such that every plane intersects $ M$ at a finite but nonzero number of points?

Let $ABCD$ be a quadrilateral whose diagonals are not perpendicular and whose sides $AB$ and $CD$ are not parallel.Let $O$ be the intersection of its diagonals.Denote with $H_1$ and $H_2$ the orthocenters of triangles $AOB$ and $COD,$ respectively.If $M$ and $N$ are the midpoints of the segment lines $AB$ and $CD,$ respectively.Prove that the lines $H_1H_2$ and $MN$ are parallel if and only if $AC=BD.$

Consider the harmonic sequence $\frac{2017}{4},\frac{2017}{7},\frac{2017}{10},\ldots$, where the reciprocals of the terms of the sequence form an arithmetic sequence. How many terms of this sequence are integers? [i]2017 CCA Math Bonanza Lightning Round #1.1[/i]

How many of the first ten numbers of the sequence $121$, $11211$, $1112111$, ... are prime numbers? $\textbf{(A) } 0 \qquad \textbf{(B) }1 \qquad \textbf{(C) }2 \qquad \textbf{(D) }3 \qquad \textbf{(E) }4$

Let $SABC$ be a pyramid with right angles at the vertex $S$. Points $A', B', C'$ lie on the edges $SA, SB, SC$ respectively in such a way that the triangles $ABC$ and $A'B'C'$ are similar. Does this yield that the planes $ABC$ and $A'B'C'$ are parallel?

The teacher wrote $5$ distinct real numbers on the board. After this, Petryk calculated the sums of each pair of these numbers and wrote them on the left part of the board, and Vasyl calculated the sums of each triple of these numbers and wrote them on the left part of the board (each of them wrote $10$ numbers). Could the multisets of numbers written by Petryk and Vasyl be identical?

Let $m$ be a nonnegative integer. Show that the number of tilings of a $(2m + 2) \times (2m + 2)$ grid of squares by $1 \times 2$ or $2 \times 1$ rectangles is at least $$2 \cdot 2^{\frac{5}{2}m} \cdot 5120^{\frac{1}{8}m^2}.$$ [i]Proposed by Milan Haiman[/i]

Given a quadrilateral $ABCD$ simultaneously inscribed and circumscribed, assume that none of its diagonals or sides is a diameter of the circumscribed circle. Let $P$ be the intersection point of the external bisectors of the angles near $A$ and $B$. Similarly, let $Q$ be the intersection point of the external bisectors of the angles $C$ and $D$. If $J$ and $O$ respectively are the incenter and circumcenter of $ABCD$ prove that $OJ\perp PQ$.

Andrew, Benji, and Carlson want to split a pile of $5$ indistinguishable left shoes and $7$ indistinguishable right shoes. Andrew is practical and wants the same number of left and right shoes. Benji is greedy and wants the most shoes out of the three of them. Carlson is a trickster and wants Benji to have a different number of left and right shoes. How many ways are there to split up the shoes in a way that suits everyone’s desires?

Let $k$ be a natural number. For each function $f : \mathbb{N}\to \mathbb{N}$ define the sequence of functions $(f_{m})_{m\geq 1}$ by $f_{1}= f$ and $f_{m+1}= f \circ f_{m}$ for $m \geq 1$ . Function $f$ is called $k$-[i]nice[/i] if for each $n \in\mathbb{N}: f_{k}(n) = f (n)^{k}$. (a) For which $k$ does there exist an injective $k$-nice function $f$ ? (b) For which $k$ does there exist a surjective $k$-nice function $f$ ?

In a rectangular coordinate system we call a horizontal line parallel to the $x$ -axis triangular if it intersects the curve with equation \[y = x^4 + px^3 + qx^2 + rx + s\] in the points $A,B,C$ and $D$ (from left to right) such that the segments $AB, AC$ and $AD$ are the sides of a triangle. Prove that the lines parallel to the $x$ - axis intersecting the curve in four distinct points are all triangular or none of them is triangular.

Let the [i]square decomposition[/i] of a number be defined as the sequence of numbers given by the following algorithm. Given a positive integer $n$, add the largest possible perfect square that is less than or equal to $n$ to a sequence, and then subtract that number from $n$. Repeat as many times as necessary until your current $n$ is $0$. So for example, the square decomposition of $60$ would be $49, 9, 1, 1$. Define the size of a square decomposition to be the number of numbers in the sequence. Say that the maximal size of a square decomposition of a number in the range $[1, 2020]$ is $m$. Find the largest number in the range $[1, 2020]$ that has a square decomposition of size $m$. [i]Proposed by Timothy Qian[/i]

Let $n$ be a positive integer and let $P(x) = x^n + a_{n-1}x^{n-1} +... + a_1x + 1$ be a polynomial with positive real coefficients. Under the assumption that the roots of $P$ are all real, show that $P(x) \ge (x + 1)^n$ for all $x > 0$.