let $a_1,a_2,...a_n$ a sequence of real numbers such that $a_1+....+a_n=0$. define $b_i=a_1+a_2+....a_i$ for all $1 \leq i \leq n$ .suppose $b_i(a_{j+1}-a_{i+1}) \geq 0$ for all $1 \leq i \leq j \leq n-1$. Show that $$\max_{1 \leq l \leq n} |a_l| \geq \max_{1 \leq m \leq n} |b_m|$$

Let $ABCDEF$ be a regular hexagon with side length two. Extend $FE$ and $BD$ to meet at $G$. Compute the area of $ABGF$.

Sierpinski's triangle is formed by taking a triangle, and drawing an upside down triangle inside each upright triangle that appears. A snake sees the fractal, but decides that the triangles need circles inside them. Therefore, she draws a circle inscribed in every upside down triangle she sees (assume that the snake can do an infinite amount of work). If the original triangle had side length $1$, what is the total area of all the individual circles? [i]2015 CCA Math Bonanza Lightning Round #4.4[/i]

Convex quadrilateral $ABCD$ has sides $AB=BC=7$, $CD=5$, and $AD=3$. Given additionally that $m\angle ABC=60^\circ$, find $BD$.

Find all two-variable polynomials $p(x,y)$ such that for each $a,b,c\in\mathbb R$: \[p(ab,c^2+1)+p(bc,a^2+1)+p(ca,b^2+1)=0\]

At the start of this problem, six frogs are sitting at each of the six vertices of a regular hexagon, one frog per vertex. Every minute, we choose a frog to jump over another frog using one of the two rules illustrated below. If a frog at point $F$ jumps over a frog at point $P$ the frog will land at point $F'$ such that $F, P,$ and $F'$ are collinear and: - using Rule 1, $F'P = 2FP$. - using Rule 2, $F'P = FP/2$. [img]https://cdn.artofproblemsolving.com/attachments/7/0/2936bda61eb60c7b89bcd579386041022ba81f.png[/img] It is up to us to choose which frog to take the leap and which frog to jump over. (a) If we only use Rule 1, is it possible for some frog to land at the center of the original hexagon after a finite amount of time? (b) If both Rule 1 and Rule 2 are allowed (freely choosing which rule to use, which frog to jump, and which frog it jumps over), is it possible for some frog to land at the center of the original hexagon after a finite amount of time?

Let $P(x)=8x^3+ax+b+1$ for $a,b\in\mathbb{Z}$. It is known that $P$ has a root $x_0=p+\sqrt{q}+\sqrt[3]{r}$, where $p,q,r\in\mathbb{Q}$, $q\ge0$; however, $P$ has no $\textit{rational}$ roots. Find the smallest possible value of $a+b$.

Given an $ n\times n$ chessboard. a) Find the number of rectangles on the chessboard. b) Assume there exists an $ r\times r$ square (label $ B$) with $ r<n$ which is located on the upper left corner of the board. Define "inner border" of $ A$ as the border of $ A$ which is not the border of the chessboard. How many rectangles in $ B$ that touch exactly one inner border of $ B$?

Consider a $5 \times 5$ grid of squares. Vladimir colors some of these squares red, such that the centers of any four red squares do $\textbf{not}$ form an axis-parallel rectangle (i.e. a rectangle whose sides are parallel to those of the squares). What is the maximum number of squares he could have colored red?

Let $ a > b > 1, b$ is an odd number, let $ n$ be a positive integer. If $ b^n|a^n\minus{}1,$ then $ a^b > \frac {3^n}{n}.$

Let $ n$ be a positive integer, and let $ x$ and $ y$ be a positive real number such that $ x^n \plus{} y^n \equal{} 1.$ Prove that \[ \left(\sum^n_{k \equal{} 1} \frac {1 \plus{} x^{2k}}{1 \plus{} x^{4k}} \right) \cdot \left( \sum^n_{k \equal{} 1} \frac {1 \plus{} y^{2k}}{1 \plus{} y^{4k}} \right) < \frac {1}{(1 \minus{} x) \cdot (1 \minus{} y)}. \] [i]Author: Juhan Aru, Estonia[/i]

Points $ABCDEF$ are evenly spaced on a unit circle and line segments $AD$, $DF$, $FB$, $BE$, $EC$, $CA$ are drawn. The line segments intersect each other at seven points inside the circle. Denote these intersections $p_1$, $p_2$, $...$,$p_7$, where $p_7$ is the center of the circle. What is the area of the $12$-sided shape $A_{p_1}B_{p_2}C_{p_3}D_{p_4}E_{p_5}F_{p_6}$? [img]https://cdn.artofproblemsolving.com/attachments/9/2/645b3c31b0bb7f81d0c0b86e13b27ec5b32864.png[/img]

Determine the sum of all distinct real values of $x$ such that $||| \cdots ||x|+x| \cdots |+x|+x|=1$ where there are $2017$ $x$s in the equation.

Consider the second-degree polynomial \(P(x) = 4x^2+12x-3015\). Define the sequence of polynomials \(P_1(x)=\frac{P(x)}{2016}\) and \(P_{n+1}(x)=\frac{P(P_n(x))}{2016}\) for every integer \(n \geq 1\). [list='a'] [*]Show that exists a real number \(r\) such that \(P_n(r) < 0\) for every positive integer \(n\). [*]Find how many integers \(m\) are such that \(P_n(m)<0\) for infinite positive integers \(n\). [/list]

Let $a$ be non zero real number. Find the area of the figure enclosed by the line $y=ax$, the curve $y=x\ln (x+1).$

Let $P_1P_2P_3P_4$ be a tetrahedron in $\mathbb{R}^3$ and let $O$ be a point equidistant from each of its vertices. Suppose there exists a point $H$ such that for each $i$, the line $P_iH$ is perpendicular to the plane through the other three vertices. Line $P_1H$ intersects the plane through $P_2, P_3, P_4$ at $A$, and contains a point $B\neq P_1$ such that $OP_1=OB$. Show that $HB=3HA$. [i]Michael Ren[/i]

Let $k$ and $n$ be integers with $0 < k < n^2/4$ such that k has no prime divisor greater than $n$. Prove that $k$ divides $n!$.

Let $a_1,a_2,\ldots$ be a sequence of integers with infinitely many positive and negative terms. Suppose that for every positive integer $n$ the numbers $a_1,a_2,\ldots,a_n$ leave $n$ different remainders upon division by $n$. Prove that every integer occurs exactly once in the sequence $a_1,a_2,\ldots$.

Suppose that $(a_n)$ is a sequence of real numbers such that the series $$\sum_{n=1}^\infty\frac{a_n}n$$is convergent. Show that the sequence $$b_n=\frac1n\sum^n_{j=1}a_j$$is convergent and find its limit.

Let $P_1$, $P_2$, $\ldots$, $P_{1993} = P_0$ be distinct points in the $xy$-plane with the following properties: (i) both coordinates of $P_i$ are integers, for $i = 1, 2, \ldots, 1993$; (ii) there is no point other than $P_i$ and $P_{i+1}$ on the line segment joining $P_i$ with $P_{i+1}$ whose coordinates are both integers, for $i = 0, 1, \ldots, 1992$. Prove that for some $i$, $0 \leq i \leq 1992$, there exists a point $Q$ with coordinates $(q_x, q_y)$ on the line segment joining $P_i$ with $P_{i+1}$ such that both $2q_x$ and $2q_y$ are odd integers.

Let be a natural number $ n\ge 2 $ and $ n $ positive real numbers $ a_1,a_2,\ldots ,a_n $ whose product is $ 1. $ Prove that the function $ f:\mathbb{R}_{>0}\longrightarrow\mathbb{R} ,\quad f(x)=\prod_{i=1}^n \left( 1+a_i^x \right) , $ is nondecreasing.

$f$ and $g$ are real-valued functions defined on the real line. For all $x$ and $y, f(x+y)+f(x-y)=2f(x)g(y)$. $f$ is not identically zero and $|f(x)|\le1$ for all $x$. Prove that $|g(x)|\le1$ for all $x$.

Let $a, b, c$ be positive real numbers satisfying the condition $\frac{1}{ab}+\frac{1}{ac}+\frac{1}{bc}=1$ . Prove the inequality $$\frac{a}{\sqrt{1+a^2}}+\frac{b}{\sqrt{1+b^2}}+\frac{c}{\sqrt{1+c^2}} \le \frac{3\sqrt3}{2}$$ When does the equality hold? (L. Parts)

There are some players in a Ping Pong tournament, where every $2$ players play with each other at most once. Given: \\(1) Each player wins at least $a$ players, and loses to at least $b$ players. ($a,b\geq 1$) \\(2) For any two players $A,B$, there exist some players $P_1,...,P_k$ ($k\geq 2$) (where $P_1=A$,$P_k=B$), such that $P_i$ wins $P_{i+1}$ ($i=1,2...,k-1$). \\Prove that there exist $a+b+1$ distinct players $Q_1,...Q_{a+b+1}$, such that $Q_i$ wins $Q_{i+1}$ ($i=1,...,a+b$)

Let $x$, $y$, $z > 0$, $\lambda \in (-\infty, 0) \cup (1,+\infty)$ such that $x + y + z = 1$. Then$$\sum \limits_{cyc} x^{\lambda}y^{\lambda}\sum \limits_{cyc}\frac{1}{(x+y)^{2\lambda}}\geq 9\left(\frac{1}{4}-\frac{1}{9}\sum \limits_{cyc}\frac{1}{(x+1)^2} \right)^{\lambda}$$