When rolling a certain unfair six-sided die with faces numbered $1, 2, 3, 4, 5$, and $6$, the probability of obtaining face $F$ is greater than $\frac{1}{6}$, the probability of obtaining the face opposite is less than $\frac{1}{6}$, the probability of obtaining any one of the other four faces is $\frac{1}{6}$, and the sum of the numbers on opposite faces is $7$. When two such dice are rolled, the probability of obtaining a sum of $7$ is $\frac{47}{288}$. Given that the probability of obtaining face $F$ is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers, find $m+n$.

Let $ABC$ be an acute angled triangle with $H$ as its orthocentre. For any point $P$ on the circumcircle of triangle $ABC$, let $Q$ be the point of intersection of the line $BH$ with line $AP$. Show that there is a unique point $X$ on the circumcircle of triangle $ABC$ such that for every $P$ other than $B,C$, the circumcircle of $HPQ$ passes through $X$.

Let $r$ and $s$ be positive integers. Define $a_0 = 0$, $a_1 = 1$, and $a_n = ra_{n-1} + sa_{n-2}$ for $n \geq 2$. Let $f_n = a_1a_2\cdots a_n$. Prove that $\displaystyle\frac{f_n}{f_kf_{n-k}}$ is an integer for all integers $n$ and $k$ such that $0 < k < n$. [i]Evan O' Dorney.[/i]

Draw an equilateral triangle with center $O$. Rotate the equilateral triangle $30^\circ, 60^\circ, 90^\circ$ with respect to $O$ so there would be four congruent equilateral triangles on each other. Look at the diagram. If the smallest triangle has area $1$, the area of the original equilateral triangle could be expressed as $p+q\sqrt r$ where $p,q,r$ are positive integers and $r$ is not divisible by a square greater than $1$. Find $p+q+r$.

[u]Round 5[/u] [b]p13.[/b] Points $A, B, C$, and $D$ lie in a plane with $AB = 6$, $BC = 5$, and $CD = 5$, and $AB$ is perpendicular to $BC$. Point E lies on line $AD$ such that $D \ne E$, $AE = 3$ and $CE = 5$. Find $DE$. [b]p14.[/b] How many ordered pairs of integers $(x,y)$ are solutions to $x^2y = 36 + y$? [b]p15.[/b] Chicken nuggets come in boxes of two sizes, $a$ nuggets per box and $b$ nuggets per box. We know that $899$ nuggets is the largest number of nuggets we cannot obtain with some combination of $a$-sized boxes and $b$-sized boxes. How many different pairs $(a, b)$ are there with $a < b$? [u]Round 6[/u] [b]p16.[/b] You are playing a game with coins with your friends Alice and Bob. When all three of you flip your respective coins, the majority side wins. For example, if Alice, Bob, and you flip Heads, Tails, Heads in that order, then you win. If Alice, Bob, and you flip Heads, Heads, Tails in that order, then you lose. Notice that more than one person will “win.” Alice and Bob design their coins as follows: a value $p$ is chosen randomly and uniformly between $0$ and $1$. Alice then makes a biased coin that lands on heads with probability $p$, and Bob makes a biased coin that lands on heads with probability $1 -p$. You design your own biased coin to maximize your chance of winning without knowing $p$. What is the probability that you win? [b]p17.[/b] There are $N$ distinct students, numbered from $1$ to $N$. Each student has exactly one hat: $y$ students have yellow hats, $b$ have blue hats, and $r$ have red hats, where $y + b + r = N$ and $y, b, r > 0$. The students stand in a line such that all the $r$ people with red hats stand in front of all the $b$ people with blue hats. Anyone wearing red is standing in front of everyone wearing blue. The $y$ people with yellow hats can stand anywhere in the line. The number of ways for the students to stand in a line is $2016$. What is $100y + 10b + r$? [b]p18.[/b] Let P be a point in rectangle $ABCD$ such that $\angle APC = 135^o$ and $\angle BPD = 150^o$. Suppose furthermore that the distance from P to $AC$ is $18$. Find the distance from $P$ to $BD$. [u]Round 7 [/u] [b]p19.[/b] Let triangle $ABC$ be an isosceles triangle with $|AB| = |AC|$. Let $D$ and $E$ lie on $AB$ and $AC$, respectively. Suppose $|AD| = |BC| = |EC|$ and triangle $ADE$ is isosceles. Find the sum of all possible values of $\angle BAC$ in radians. Write your answer in the form $2 arcsin \left( \frac{a}{b}\right) + \frac{c}{d} \pi$, where $\frac{a}{b}$ and $\frac{c}{d}$ are in lowest terms, $-1 \le \frac{a}{b} \le 1$, and $-1 \le \frac{c}{d} \le 1$. [b]p20.[/b] Kevin is playing a game in which he aims to maximize his score. In the $n^{th}$ round, for $n \ge 1$, a real number between $0$ and $\frac{1}{3^n}$ is randomly generated. At each round, Kevin can either choose to have the randomly generated number from that round as his score and end the game, or he can choose to pass on the number and continue to the next round. Once Kevin passes on a number, he CANNOT claim that number as his score. Kevin may continue playing for as many rounds as he wishes. If Kevin plays optimally, the expected value of his score is $a + b\sqrt{c}$ where $a, b$, and $c$ are integers and $c$ is positive and not divisible by any positive perfect square other than $1$. What is $100a + 10b + c$? [b]p21.[/b] Lisa the ladybug (a dimensionless ladybug) lives on the coordinate plane. She begins at the origin and walks along the grid, at each step moving either right or up one unit. The path she takes ends up at $(2016, 2017)$. Define the “area” of a path as the area below the path and above the $x$-axis. The sum of areas over all paths that Lisa can take can be represented as as $a \cdot {{4033} \choose {2016}}$ . What is the remainder when $a$ is divided by $1000$? PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c4h2782871p24446475]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose $a,b,c,d$ are positive reals such that $ab+cd=1$ and $x_i,y_i$ are real numbers such that $x_i^2+y_i^2=1$ for $i=1,2,3,4$. Prove that \[(ax_1+bx_2+cx_3+dx_4)^2+(ay_4+by_3+cy_2+dy_1)^2\le 2\left(\frac{a^2+b^2}{ab}+\frac{c^2+d^2}{cd}\right).\] [i]Li Shenghong[/i]

Suppose that $a_0, a_1, \cdots $ and $b_0, b_1, \cdots$ are two sequences of positive integers such that $a_0, b_0 \ge 2$ and \[ a_{n+1} = \gcd{(a_n, b_n)} + 1, \qquad b_{n+1} = \operatorname{lcm}{(a_n, b_n)} - 1. \] Show that the sequence $a_n$ is eventually periodic; in other words, there exist integers $N \ge 0$ and $t > 0$ such that $a_{n+t} = a_n$ for all $n \ge N$.

Determine the value of $$\prod^{\infty}_{n=1} 3^{n/3^n}= \sqrt[3]{3} \sqrt[3^2]{3^2} \sqrt[3^3]{3^3} ...$$

Let $n>k \geq 1$ be integers and let $p$ be a prime dividing $\tbinom{n}{k}$. Prove that the $k$-element subsets of $\{1,\ldots,n\}$ can be split into $p$ classes of equal size, such that any two subsets with the same sum of elements belong to the same class. [i]Ankan Bhattacharya[/i]

In an infinite grid of regular triangles, Niels and Henrik are playing a game they made up. Every other time, Niels picks a triangle and writes $\times$ in it, and every other time, Henrik picks a triangle where he writes a $o$. If one of the players gets four in a row in some direction (see figure), he wins the game. Determine whether one of the players can force a victory. [img]https://cdn.artofproblemsolving.com/attachments/6/e/5e80f60f110a81a74268fded7fd75a71e07d3a.png[/img]

Let $AD$ and $BE$ be angle bisectors in triangle $ABC$. Let $x$, $y$ and $z$ be distances from point $M$, which lies on segment $DE$, from sides $BC$, $CA$ and $AB$, respectively. Prove that $z=x+y$

Find the number of ordered triplets $(a,b,c)$ of positive integers such that $a<b<c$ and $abc=2008$.

Let $N$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$, and let $M$ be the number of integral solutions of the equation \[x^2 - y^2 = z^3 - t^3 + 1\] satisfying the condition $0 \leq x, y, z, t \leq 10^6$. Prove that $N >M.$

Evaluate $\tfrac1{\sqrt1+\sqrt2}+\tfrac1{\sqrt2+\sqrt3}+\cdots+\tfrac1{\sqrt{1368}+\sqrt{1369}}$.

Given is a set of $n\ge5$ people and $m$ commissions with $3$ persons in each. Let all the commissions be [i]nice[/i] if there are no two commissions $A$ and $B$, such that $\mid A\cap B\mid=1$. Find the biggest possible $m$ (as a function of $n$).

[b]a)[/b] Prove that $ \lim_{x\to\infty } \sqrt{x}\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x}=1. $ [b]b)[/b] Show that $ \lim_{x\to\infty } \left( -\left\lfloor\sqrt{x}\right\rfloor +x\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x} \right) =\frac{-1}{2} $ [b]c)[/b] What about $ \lim_{x\to\infty } \left( -\sqrt{x} +x\cdot\sum_{k=1}^{\lfloor \sqrt{x} \rfloor} \frac{1}{k+x} \right) ? $

Let $a$ and $b$ be two positive real numbers with $a \le 2b \le 4a$. Prove that $4ab \le2 (a^2+ b^2) \le 5 ab$.

Let $n$ be the answer to this problem. We define the digit sum of a date as the sum of its $4$ digits when expressed in mmdd format (e.g. the digit sum of $13$ May is $0+5+1+3 = 9$). Find the number of dates in the year $2021$ with digit sum equal to the positive integer $n$.

In rectangle $ABCD$, point $E$ is chosen on $AB$ and $F$ is the foot of $E$ onto side $CD$ such that the circumcircle of $\vartriangle ABF$ intersects line segments $AD$ and $BC$ at points $G$ and $H$ respectively. Let $S$ be the intersection of $EF$ and $GH$, and $T$ the intersection of lines $EC$ and $DS$. If $\angle SF T = 15^o$ , compute the measure of $\angle CSD$.

Given right $n$-gon wit the point $O$ -- its centre. All the vertices are marked either with $+1$ or $-1$. We may change all the signs in the vertices of regular $k$-gon ($2 \le k \le n$) with the same centre $O$. (By $2$-gon we understand a segment, being halved by $O$.) Prove that in a), b) and c) cases there exists such a set of $(+1)$s and $(-1)$s, that we can never obtain a set of $(+1)$s only. a) $n = 15$, b) $n = 30$, c) $n > 2$, d) Let us denote $K(n)$ the maximal number of $(+1)$ and $(-1)$ sets such, that it is impossible to obtain one set from another. Prove, for example, that $K(200) = 2^{80}$

Natural numbers $1,2,...,500$ are written on a blackboard. Two players $A$ and $B$ consecutively make moves, $A$ starts. Each move a player chooses two numbers $n$ and $2n$ and erases them from the blackboard. If a player cannot perform a valid move, he loses. Which player can guarantee a win?

In a triangle $ABC$ with $\angle BAC = 90^{\circ}$ let $BL$ be the bisector, $L\in AC$. Let $D$ be a point symmetrical to $A$ with respect to $BL$. Let $M$ be the circumcenter of $ADC$. Prove that $CM$, $DL$, and $AB$ are concurrent.

Find $\lim_{n\to\infty} \sum_{k=1}^{2n} \frac{n}{2n^2+3nk+k^2}.$

GM Bisain's IQ is so high that he can move around in $10$ dimensional space. He starts at the origin and moves in a straight line away from the origin, stopping after $3$ units. How many lattice points can he land on? A lattice point is one with all integer coordinates. [i]2019 CCA Math Bonanza Lightning Round #4.2[/i]

What is the least number of weighings needed to determine the sum of weights of $13$ watermelons such that exactly two watermelons should be weighed in each weigh? $ \textbf{a)}\ 7 \qquad\textbf{b)}\ 8 \qquad\textbf{c)}\ 9 \qquad\textbf{d)}\ 10 \qquad\textbf{e)}\ 11 $