Let $L$ be the number of times the letter $L$ appeared on the Speed Round, $M$ be the number of times the letter $M$ appeared on the Speed Round, and $T$ be the number of times the letter $T$ appeared on the Speed Round. Find the value of $LMT$.

[center][u]Guts Round[/u] / [u]Set 7[/u][/center] [b]p19.[/b] Let $N_{21}$ be the answer to question 21. Suppose a jar has $3N_{21}$ colored balls in it: $N_{21}$ red, $N_{21}$ green, and $N_{21}$ blue balls. Jonathan takes one ball at a time out of the jar uniformly at random without replacement until all the balls left in the jar are the same color. Compute the expected number of balls left in the jar after all balls are the same color. [b]p20.[/b] Let $N_{19}$ be the answer to question 19. For every non-negative integer $k$, define $$f_k(x) = x(x - 1) + (x + 1)(x - 2) + ...+ (x + k)(x - k - 1),$$ and let $r_k$ and $s_k$ be the two roots of $f_k(x)$. Compute the smallest positive integer $m$ such that $|r_m - s_m| > 10N_{19}$. [b]p21.[/b] Let $N_{20}$ be the answer to question 20. In isosceles trapezoid $ABCD$ (where $\overline{BC}$ and $\overline{AD}$ are parallel to each other), the angle bisectors of $A$ and $D$ intersect at $F$, and the angle bisectors of points $B$ and $C$ intersect at $H$. Let $\overline{BH}$ and $\overline{AF}$ intersect at $E$, and let $\overline{CH}$ and $\overline{DF}$ intersect at $G$. If $CG = 3$, $AE = 15$, and $EG = N_{20}$, compute the area of the quadrilateral formed by the four tangency points of the largest circle that can fit inside quadrilateral $EFGH$.

Given integer $ n$ larger than $ 5$, solve the system of equations (assuming $x_i \geq 0$, for $ i=1,2, \dots n$): \[ \begin{cases} \displaystyle x_1+ \phantom{2^2} x_2+ \phantom{3^2} x_3 + \cdots + \phantom{n^2} x_n &= n+2, \\ x_1 + 2\phantom{^2}x_2 + 3\phantom{^2}x_3 + \cdots + n\phantom{^2}x_n &= 2n+2, \\ x_1 + 2^2x_2 + 3^2 x_3 + \cdots + n^2x_n &= n^2 + n +4, \\ x_1+ 2^3x_2 + 3^3x_3+ \cdots + n^3x_n &= n^3 + n + 8. \end{cases} \]

The 2010 positive numbers $a_1, a_2, \ldots , a_{2010}$ satisfy the inequality $a_ia_j \le i+j$ for all distinct indices $i, j$. Determine, with proof, the largest possible value of the product $a_1a_2\ldots a_{2010}$.

Prove that $\frac{5^{125}-1}{5^{25}-1}$ is a composite number.

Let $P(x)$ be a non-constant polynomial with integer coefficients. Prove that there is no function $T$ from the set of integers into the set of integers such that the number of integers $x$ with $T^n(x)=x$ is equal to $P(n)$ for every $n\geq 1$, where $T^n$ denotes the $n$-fold application of $T$. [i]Proposed by Jozsef Pelikan, Hungary[/i]

Find all functions $f:\mathbb{R}^+\to\mathbb{R}^+$ such that for any real numbers $a, b, c, d >0$ satisfying $abcd=1$,\[(f(a)+f(b))(f(c)+f(d))=(a+b)(c+d)\] holds true. [i](Swiss Mathematical Olympiad 2011, Final round, problem 4)[/i]

Prove that the equation $$ (x - a) (x - c) + 2 (x - b) (x - d) = 0,$$ in which $ a < b < c < d $, has two real roots.

Suppose $S=\{1,2,3,...,2017\}$,for every subset $A$ of $S$,define a real number $f(A)\geq 0$ such that: $(1)$ For any $A,B\subset S$,$f(A\cup B)+f(A\cap B)\leq f(A)+f(B)$; $(2)$ For any $A\subset B\subset S$, $f(A)\leq f(B)$; $(3)$ For any $k,j\in S$,$$f(\{1,2,\ldots,k+1\})\geq f(\{1,2,\ldots,k\}\cup \{j\});$$ $(4)$ For the empty set $\varnothing$, $f(\varnothing)=0$. Confirm that for any three-element subset $T$ of $S$,the inequality $$f(T)\leq \frac{27}{19}f(\{1,2,3\})$$ holds.

Let $n$ be an integer and $n \geq 2$, $x_1, x_2, \cdots , x_n$ are arbitrary real number, find the maximum value of $$2\sum_{1\leq i<j \leq n}\left \lfloor x_ix_j \right \rfloor-\left ( n-1 \right )\sum_{i=1}^{n}\left \lfloor x_i^2 \right \rfloor $$

Consider fractions $\frac{a}{b}$ where $a$ and $b$ are positive integers. (a) Prove that for every positive integer $n$, there exists such a fraction $\frac{a}{b}$ such that $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}+1$. (b) Show that there are infinitely many positive integers $n$ such that no such fraction $\frac{a}{b}$ satisfies $\sqrt{n} \le \frac{a}{b} \le \sqrt{n+1}$ and $b \le \sqrt{n}$.

Let $n \ge 1$ be a fixed positive integer. We consider all the sets $S$ which consist of sub-sequences of the sequence $0, 1,2, ..., n$ satisfying the following conditions: i) If $(a_i)_{i=0}^k$ belongs to $S$, then $a_0 = 0$, $a_k = n$ and $a_{i+1} - a_i \le 2$ for all $0 \le i \le k - 1$. ii) If $(a_i)_{i=0}^k$ and $(b_j)^h_{j=0}$ both belong to $S$, then there exist $0 \le i_0 \le k - 1$ and $0 \le j_0 \le h - 1$ such that $a_{i_0} = b_{j_0}$ and $a_{i_0+1} = b_{j_0+1}$. Find the maximum value of $|S|$ (among all the above-mentioned sets $S$).

Ephram Chun is a senior and math captain at Lexington High School. He is well-loved by the freshmen, who seem to only listen to him. Other than being the father figure that the freshmen never had, Ephramis also part of the Science Bowl and Science Olympiad teams along with being part of the highest orchestra LHS has to offer. His many hobbies include playing soccer, volleyball, and the many forms of chess. We hope that he likes the questions that we’ve dedicated to him! [b]p1.[/b] Ephram is scared of freshmen boys. How many ways can Ephram and $4$ distinguishable freshmen boys sit together in a row of $5$ chairs if Ephram does not want to sit between $2$ freshmen boys? [b]p2.[/b] Ephram, who is a chess enthusiast, is trading chess pieces on the black market. Pawns are worth $\$100$, knights are worth $\$515$, and bishops are worth $\$396$. Thirty-four minutes ago, Ephrammade a fair trade: $5$ knights, $3$ bishops, and $9$ rooks for $8$ pawns, $2$ rooks, and $11$ bishops. Find the value of a rook, in dollars. [b]p3.[/b] Ephramis kicking a volleyball. The height of Ephram’s kick, in feet, is determined by $$h(t) = - \frac{p}{12}t^2 +\frac{p}{3}t ,$$ where $p$ is his kicking power and $t$ is the time in seconds. In order to reach the height of $8$ feet between $1$ and $2$ seconds, Ephram’s kicking power must be between reals $a$ and $b$. Find is $100a +b$. [b]p4.[/b] Disclaimer: No freshmen were harmed in the writing of this problem. Ephram has superhuman hearing: He can hear sounds up to $8$ miles away. Ephramstands in the middle of a $8$ mile by $24$ mile rectangular grass field. A freshman falls from the sky above a point chosen uniformly and randomly on the grass field. The probability Ephram hears the freshman bounce off the ground is $P\%$. Find $P$ rounded to the nearest integer. [img]https://cdn.artofproblemsolving.com/attachments/4/4/29f7a5a709523cd563f48176483536a2ae6562.png[/img] [b]p5.[/b] Ephram and Brandon are playing a version of chess, sitting on opposite sides of a $6\times 6$ board. Ephram has $6$ white pawns on the row closest to himself, and Brandon has $6$ black pawns on the row closest to himself. During each player’s turn, their only legal move is to move one pawn one square forward towards the opposing player. Pawns cannot move onto a space occupied by another pawn. Players alternate turns, and Ephram goes first (of course). Players take turns until there are no more legal moves for the active player, at which point the game ends. Find the number of possible positions the game can end in. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

[b]1.[/b] For each real number $r$ between $0$ and $1$ we can represent $r$ as an infinite decimal $r = 0.r_1r_2r_3\dots$ with $0 \leq r_i \leq 9$. For example, $\frac{1}{4} = 0.25000\dots$, $\frac{1}{3} = 0.333\dots$ and $\frac{1}{\sqrt{2}} = 0.707106\dots$. a) Show that we can choose two rational numbers $p$ and $q$ between $0$ and $1$ such that, from their decimal representations $p = 0.p_1p_2p_3\dots$ and $q = 0.q_1q_2q_3\dots$, it's possible to construct an irrational number $\alpha = 0.a_1a_2a_3\dots$ such that, for each $i = 1, 2, 3, \dots$, we have $a_i = p_1$ or $a_1 = q_i$. b) Show that there's a rational number $s = 0.s_1s_2s_3\dots$ and an irrational number $\beta = 0.b_1b_2b_3\dots$ such that, for all $N \geq 2017$, the number of indexes $1 \leq i \leq N$ satisfying $s_i \neq b_i$ is less than or equal to $\frac{N}{2017}$.

Prove that these polynomials are irreducible in $\mathbb{Q}[x]:$ a) $\frac{{{x^p}}}{{p!}} + \frac{{{x^{p - 1}}}}{{(p - 1)!}} + ... + \frac{{{x^2}}}{2} + x + 1,$ with $p$ is a prime number. b) $x^{2^n}+1,$ with $n$ is a positive integer.

a) Find all real numbers $k$ such that there exists a positive constant $c_k$ satisfying $$(x^2 + 1)(y^2 + 1)(z^2 + 1) \ge c_k(x + y + z)^k$$ for all positive real numbers. b) Given the numbers $k$ found, determine the largest number $c_k$.

For $a,b \in [1;\infty)$ show that \[ab\leq e^{a-1}+b\ln b\]

Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.

Given a sequence $ (c_n) $ of natural numbers defined recursively: $ c_1 = 2 $, $ c_{n+1} = \left[ \frac{3}{2}c_n\right] $. Prove that there are infinitely many even numbers and infinitely many odd numbers among the terms of this sequence.

Let $P$ be a given quadratic polynomial. Find all functions $f : \mathbb{R}\to\mathbb{R}$ such that $$f(x+y)=f(x)+f(y)\text{ and } f(P(x))=f(x)\text{ for all }x,y\in\mathbb{R}.$$

Let $ P(z)$ be a polynomial of degree $ n$ with complex coefficients, \[ P(0)\equal{}1, \;\textrm{and}\ \;|P(z)|\leq M\ \;\textrm{for}\ \;|z| \leq 1\ .\] Prove that every root of $ P(z)$ in the closed unit disc has multiplicity at most $ c\sqrt{n}$, where $ c\equal{}c(M) >0$ is a constant depending only on $ M$. [i]G. Halasz[/i]

The graphs of a square trinomial and its derivative divide the coordinate plane into four parts. How many roots does this square trinomial has?

Solve the following system of equations, in which $a$ is a given number satisfying $|a| > 1$: $\begin{matrix} x_{1}^2 = ax_2 + 1 \\ x_{2}^2 = ax_3 + 1 \\ \ldots \\ x_{999}^2 = ax_{1000} + 1 \\ x_{1000}^2 = ax_1 + 1 \\ \end{matrix}$

Find all triples $(x, y, z)$ of real numbers that satisfy $x^2 + y^2 + z^2 + 1 = xy + yz + zx +|x - 2y + z|$.

Let $a>0$ be a real number. Find the minimal constant $C_a$ for which the inequality$$\displaystyle C_a\sum_{k=1}^n \frac1{x_k-x_{k-1}} >\sum_{k=1}^n \frac{k+a}{x_k}$$holds for any positive integer $n$ and any sequence $0=x_0<x_1<\cdots <x_n$ of real numbers.