Define a sequence of polynomials $P_0\left(x\right)=x$ and $P_k\left(x\right)=P_{k-1}\left(x\right)^2-\left(-1\right)^kk$ for each $k\geq1$. Also define $Q_0\left(x\right)=x$ and $Q_k\left(x\right)=Q_{k-1}\left(x\right)^2+\left(-1\right)^kk$ for each $k\geq1$. Compute the product of the distinct real roots of \[P_1\left(x\right)Q_1\left(x\right)P_2\left(x\right)Q_2\left(x\right)\cdots P_{2018}\left(x\right)Q_{2018}\left(x\right).\] [i]2018 CCA Math Bonanza Tiebreaker Round #2[/i]

Find the largest natural number $n$ such that any set of $n$ tetraminoes, each of which is one of the four shapes in the picture, can be placed without overlapping in a $20 \times 20$ table (no tetramino extends beyond the borders of the table), such that each tetramino covers exactly 4 cells of the 20x20 table. An individual tetramino is allowed to turn and flip at will. [img]https://cdn.artofproblemsolving.com/attachments/b/9/0dddb25c2aa07536b711ded8363679e47972d6.png[/img]

Let $ABC$ be an acute-angled triangle with $AB < AC$. Let $\Omega$ be the circumcircle of $ABC$. Let $S$ be the midpoint of the arc $CB$ of $\Omega$ containing $A$. The perpendicular from $A$ to $BC$ meets $BS$ at $D$ and meets $\Omega$ again at $E \neq A$. The line through $D$ parallel to $BC$ meets line $BE$ at $L$. Denote the circumcircle of triangle $BDL$ by $\omega$. Let $\omega$ meet $\Omega$ again at $P \neq B$. Prove that the line tangent to $\omega$ at $P$ meets line $BS$ on the internal angle bisector of $\angle BAC$.

Elmo has 2023 cookie jars, all initially empty. Every day, he chooses two distinct jars and places a cookie in each. Every night, Cookie Monster finds a jar with the most cookies and eats all of them. If this process continues indefinitely, what is the maximum possible number of cookies that the Cookie Monster could eat in one night? [i]Proposed by Espen Slettnes[/i]

Prove that from an arbitrary set of three-digit numbers, including at least four numbers that are mutually prime, you can choose four numbers that are also mutually prime

Let \(ABCDE\) be a regular pentagon. Let \(P\) be a variable point on the interior of segment \(AB\) such that \(PA\ne PB\). The circumcircles of \(\triangle PAE\) and \(\triangle PBC\) meet again at \(Q\). Let \(R\) be the circumcenter of \(\triangle DPQ\). Show that as \(P\) varies, \(R\) lies on a fixed line. [i]Proposed by Karthik Vedula[/i]

Consider positive numbers $h, s_1, s_2$, and a spatial triangle $\vartriangle ABC$. How many ways are there to select a point $D$ so that the height of tetrahedron $ABCD$ drawn from $D$ equals $h$, and the areas of faces $ACD$ and $BCD$ equal $s_1$ and $s_2$, respectively?

Let $\gamma,\gamma_0,\gamma_1,\gamma_2$ be four circles in plane,such that $\gamma_i$ is interiorly tangent to $\gamma$ in point $A_i$,and $\gamma_i$ and $\gamma_{i+1}$ are exteriorly tangent in point $B_{i+2}$,$i=0,1,2$(the indexes are reduced modulo $3$).The tangent in $B_i$,common for circles $\gamma_{i-1}$ and $\gamma_{i+1}$,intersects circle $\gamma$ in point $C_i$,situated in the opposite semiplane of $A_i$ with respect to line $A_{i-1}A_{i+1}$.Prove that the three lines $A_iC_i$ are concurrent.

The graph shows the number of minutes studied by both Asha (black bar) and Sasha (grey bar) in one week. On the average, how many more minutes per day did Sasha study than Asha? [asy] size(300); real i; defaultpen(linewidth(0.8)); draw((0,140)--origin--(220,0)); for(i=1;i<13;i=i+1) { draw((0,10*i)--(220,10*i)); } label("$0$",origin,W); label("$20$",(0,20),W); label("$40$",(0,40),W); label("$60$",(0,60),W); label("$80$",(0,80),W); label("$100$",(0,100),W); label("$120$",(0,120),W); path MonD=(20,0)--(20,60)--(30,60)--(30,0)--cycle,MonL=(30,0)--(30,70)--(40,70)--(40,0)--cycle,TuesD=(60,0)--(60,90)--(70,90)--(70,0)--cycle,TuesL=(70,0)--(70,80)--(80,80)--(80,0)--cycle,WedD=(100,0)--(100,100)--(110,100)--(110,0)--cycle,WedL=(110,0)--(110,120)--(120,120)--(120,0)--cycle,ThurD=(140,0)--(140,80)--(150,80)--(150,0)--cycle,ThurL=(150,0)--(150,110)--(160,110)--(160,0)--cycle,FriD=(180,0)--(180,70)--(190,70)--(190,0)--cycle,FriL=(190,0)--(190,50)--(200,50)--(200,0)--cycle; fill(MonD,grey); fill(MonL,lightgrey); fill(TuesD,grey); fill(TuesL,lightgrey); fill(WedD,grey); fill(WedL,lightgrey); fill(ThurD,grey); fill(ThurL,lightgrey); fill(FriD,grey); fill(FriL,lightgrey); draw(MonD^^MonL^^TuesD^^TuesL^^WedD^^WedL^^ThurD^^ThurL^^FriD^^FriL); label("M",(30,-5),S); label("Tu",(70,-5),S); label("W",(110,-5),S); label("Th",(150,-5),S); label("F",(190,-5),S); label("M",(-25,85),W); label("I",(-27,75),W); label("N",(-25,65),W); label("U",(-25,55),W); label("T",(-25,45),W); label("E",(-25,35),W); label("S",(-26,25),W);[/asy] $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 8\qquad\textbf{(C)}\ 9\qquad\textbf{(D)}\ 10\qquad\textbf{(E)}\ 12 $

Let $n$ be a positive integer. Find all real solutions $(a_1, a_2, \dots, a_n)$ to the system: \[a_1^2 + a_1 - 1 = a_2\] \[ a_2^2 + a_2 - 1 = a_3\] \[\hspace*{3.3em} \vdots \] \[a_{n}^2 + a_n - 1 = a_1\]

A rectangle $ D$ is partitioned in several ($ \ge2$) rectangles with sides parallel to those of $ D$. Given that any line parallel to one of the sides of $ D$, and having common points with the interior of $ D$, also has common interior points with the interior of at least one rectangle of the partition; prove that there is at least one rectangle of the partition having no common points with $ D$'s boundary. [i]Author: Kei Irie, Japan[/i]

Find all functions $ f: \mathbb{Z} \minus{} \{ 0 \} \rightarrow \mathbb{Q}$ satisfying: $ f \left( \frac{x\plus{}y}{3} \right)\equal{}\frac {f(x)\plus{}f(y)}{2},$ whenever $ x,y,\frac{x\plus{}y}{3} \in \mathbb{Z} \minus{} \{ 0 \}.$

Show that $e=\sum^{\infty}_{n=0} \frac{1}{n!}$ is irrational.

A five-legged Martian has a drawer full of socks, each of which is red, white or blue, and there are at least five socks of each color. The Martian pulls out one sock at a time without looking. How many socks must the Martian remove from the drawer to be certain there will be 5 socks of the same color? $ \textbf{(A)}\ 6\qquad\textbf{(B)}\ 9\qquad\textbf{(C)}\ 12\qquad\textbf{(D)}\ 13\qquad\textbf{(E)}\ 15 $

$\boxed{A7}$Prove that for all $x,y,z>0$ with $\frac{1}{x}+\frac{1}{y}+\frac{1}{z}=1$ and $0\leq a,b,c<1$ the following inequality holds \[\frac{x^2+y^2}{1-a^z}+\frac{y^2+z^2}{1-b^x}+\frac{z^2+x^2}{1-c^y}\geq \frac{6(x+y+z)}{1-abc}\]

Find two roots of the equation $$5x^6 - 16x^4 - 33x^3 - 40x^2 +8 = 0,$$ whose product is equal to $1$.

Two integers $0 < k < n$ and distinct real numbers $a_1, a_2, \dots ,a_n$ are given. Define the sets as the following, where all indices are modulo $n$. \begin{align*} A &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \text{ or } a_i < a_{i-k}, a_{i-1}, a_{i+1}, a_{i+k} \} \\ B &= \{ 1 \le i \le n : a_i > a_{i-k}, a_{i+k} \text{ and } a_i < a_{i-1}, a_{i+1} \} \\ C &= \{ 1 \le i \le n ; a_i > a_{i-1}, a_{i+1} \text{ and } a_i < a_{i-k}, a_{i+k} \} \end{align*} Prove that $\lvert A \rvert \ge \lvert B \rvert + \lvert C \rvert$.

On a circular billiard table a ball rebounds from the rails as if the rail was the tangent to the circle at the point of impact. A regular hexagon with its vertices on the circle is drawn on a circular billiard table. A (point-shaped) ball is placed somewhere on the circumference of the hexagon, but not on one of its edges. Describe a periodical track of this ball with exactly four points at the rails. With how many different directions of impact can the ball be brought onto such a track?

Let $A_1,A_2,\ldots,A_n$ be subsets of a finite set $S$ such that $|A_j|=8$ for each $j$. For a subset $B$ of $S$ let $F(B)=\{j \mid 1\le j\le n \ \ \text{and} \ A_j \subset B\}$. Suppose for each subset $B$ of $S$ at least one of the following conditions holds [list][b](a)[/b] $|B| > 25$, [b](b)[/b] $F(B)={\O}$, [b](c)[/b] $\bigcap_{j\in F(B)} A_j \neq {\O}$.[/list] Prove that $A_1\cap A_2 \cap \cdots \cap A_n \neq {\O}$.

A positive integer $n$ is good if $n$ can be written as the sum of $2004$ positive integers $a_1$, $a_2$, ..., $a_{2004}$ such that $1 \le a_1 < a_2<...<a_{2004}$ and $a_i$ divides $a_{i+1}$ for $i=1$, $2$, ..., $2003$. Show that there are only finitely many positive integers that are not good.

The tangents to the circumcircle of the acute triangle $ABC$, passing through $B$ and $C$, meet at point $F$. The points $M$, $L$, and $N$ are the feet of perpendiculars from the vertex $A$ to the lines $FB$, $FC$, and $BC$, respectively. Prove the inequality $AM+AL\ge 2AN$. [i](V. Karamzin)[/i]

$A, B, C$, and $D$ are all on a circle, and $ABCD$ is a convex quadrilateral. If $AB = 13$, $BC = 13$, $CD = 37$, and $AD = 47$, what is the area of $ABCD$?

Prove that if the distance from a point inside a convex polyhedra with $n$ faces to the vertices of the polyhedra is at most 1, then the sum of the distances from this point to the faces of the polyhedra is smaller than $n-2$. [i]Calin Popescu[/i]

Natural $p$ and $q$ are relatively prime. The $[0,1]$ is divided onto $(p+q)$ equal segments. Prove that every segment except two marginal contain exactly one from the $(p+q-2)$ numbers $$\{1/p, 2/p, ... , (p-1)/p, 1/q, 2/q, ... , (q-1)/q\}$$

The king assembled 300 wizards and gave them the following challenge. For this challenge, 25 colors can be used, and they are known to the wizards. Each of the wizards receives a hat of one of those 25 colors. If for each color the number of used hats would be written down then all these number would be different, and the wizards know this. Each wizard sees what hat was given to each other wizard but does not see his own hat. Simultaneously each wizard reports the color of his own hat. Is it possible for the wizards to coordinate their actions beforehand so that at least 150 of them would report correctly?