Let $P$ be an interior point of triangle $ABC$ and extend lines from the vertices through $P$ to the opposite sides. Let $a$, $b$, $c$, and $d$ denote the lengths of the segments indicated in the figure. Find the product $abc$ if $a + b + c = 43$ and $d = 3$. [asy] size(200); defaultpen(fontsize(10)); pair A=origin, B=(14,0), C=(9,12), D=midpoint(B--C), E=midpoint(A--C), F=midpoint(A--B), P=centroid(A,B,C); draw(D--A--B--C--A^^B--E^^C--F); dot(A^^B^^C^^P); label("$a$", P--A, dir(-90)*dir(P--A)); label("$b$", P--B, dir(90)*dir(P--B)); label("$c$", P--C, dir(90)*dir(P--C)); label("$d$", P--D, dir(90)*dir(P--D)); label("$d$", P--E, dir(-90)*dir(P--E)); label("$d$", P--F, dir(-90)*dir(P--F)); label("$A$", A, SW); label("$B$", B, SE); label("$C$", C, N); label("$P$", P, 1.8*dir(285));[/asy]

Polynomial $p(x)$ with real coefficients, which is different from the constant, has the following property: [i] for any naturals $n$ and $k$ the $\frac{p(n+1)p(n+2)...p(n+k)}{p(1)p(2)...p(k)}$ is an integer.[/i] Prove that this polynomial is divisible by $x$.

A $ 3 \times 3 \times 3$ cube is formed by gluing together 27 standard cubical dice. (On a standard die, the sum of the numbers on any pair of opposite faces is 7.) The smallest possible sum of all the numbers showing on the surface of the $ 3 \times 3 \times 3$ cube is $ \text{(A)}\ 60 \qquad \text{(B)}\ 72 \qquad \text{(C)}\ 84 \qquad \text{(D)}\ 90 \qquad \text{(E)}\ 96$

$512$ persons meet at a meeting[ Under every six of these people there is always at least two who know each other. Prove that there must be six people at this gathering, all mutual know.

Let $ABCD$ be a rectangle with area $2012$. There exist points $E$ on $AB$ and $F$ on $CD$ such that $DE = EF = F B$. Diagonal $AC$ intersects $DE$ at $X$ and $EF$ at $Y$ . Compute the area of triangle $EXY$ .

Homer goes on the $100$-Donut Diet. A $100$-Donut Diet Plan specifies how many of $100$ total donuts Homer will eat each day. The diet requires that the number of donuts he eats does not increase from one day to the next. For example, one $5$-day Donut Diet Plan is $40$, $25$, $25$, $8$, $2$. Are there more $100$-Donut Diet Plans with an odd number of days or plans where Homer eats an odd number of donuts on the first day?

Let $n\geqslant 2$ be a positive integer. Paul has a $1\times n^2$ rectangular strip consisting of $n^2$ unit squares, where the $i^{\text{th}}$ square is labelled with $i$ for all $1\leqslant i\leqslant n^2$. He wishes to cut the strip into several pieces, where each piece consists of a number of consecutive unit squares, and then [i]translate[/i] (without rotating or flipping) the pieces to obtain an $n\times n$ square satisfying the following property: if the unit square in the $i^{\text{th}}$ row and $j^{\text{th}}$ column is labelled with $a_{ij}$, then $a_{ij}-(i+j-1)$ is divisible by $n$. Determine the smallest number of pieces Paul needs to make in order to accomplish this.

Find the sum of all integers $n$ satisfying the following inequality: \[\frac{1}{4}<\sin\frac{\pi}{n}<\frac{1}{3}.\]

A certain town is represented as an infinite plane, which is divided by straight lines into squares. The lines are streets, while the squares are blocks. Along a certain street there stands a policeman on each $100$th intersection . Somewhere in the town there is a bandit , whose position and speed are unknown, but he can move only along the streets. The aim of the police is to see the bandit . Does there exist an algorithm available to the police to enable them to achieve their aim? (A. Andjans, Riga)

At a party, five of Ryan’s friends arrive, each hanging their coats on the coat rack. When they leave, Ryan hands out coats in a random order to his friends. What is the probability that at least half of them receive the right coat? (Half of them is $3$ or more) [i]2015 CCA Math Bonanza Team Round #7[/i]

Suppose $z_0,z_1,\ldots,z_{n-1}$ are complex numbers such that $z_k=e^{2k\pi i/n}$ for $k=0,1,2,\ldots,n-1$. Prove that for any complex number $z$, $\sum_{k=0}^{n-1}|z-z_k|\ge n$.

A square pyramid with base $ABCD$ and vertex $E$ has eight edges of length 4. A plane passes through the midpoints of $\overline{AE}$, $\overline{BC}$, and $\overline{CD}$. The plane's intersection with the pyramid has an area that can be expressed as $\sqrt{p}$. Find $p$.

Let $ S$ be the set of all points with coordinates $ (x,y,z)$, where $ x, y,$ and $ z$ are each chosen from the set $ \{ 0, 1, 2\}$. How many equilateral triangles have all their vertices in $ S$? $ \textbf{(A)}\ 72 \qquad \textbf{(B)}\ 76 \qquad \textbf{(C)}\ 80 \qquad \textbf{(D)}\ 84 \qquad \textbf{(E)}\ 88$

The $19$ numbers $472$ , $473$ , $...$ , $490$ are juxtaposed in some order to form a $57$-digit number. Can any of the numbers thus obtained be prime?

A natural number is a [i]palindrome[/i] when one obtains the same number when writing its digits in reverse order. For example, $481184$, $131$ and $2$ are palindromes. Determine all pairs $(m,n)$ of positive integers such that $\underbrace{111\ldots 1}_{m\ {\rm ones}}\times\underbrace{111\ldots 1}_{n\ {\rm ones}}$ is a palindrome.

For 3 real numbers $a,b,c$ let $s_n=a^{n}+b^{n}+c^{n}$. It is known that $s_1=2$, $s_2=6$ and $s_3=14$. Prove that for all natural numbers $n>1$, we have $|s^2_n-s_{n-1}s_{n+1}|=8$

Show that the equation $ y^{37} \equal{} x^3 \plus{}11\pmod p$ is solvable for every prime $ p$, where $ p\le 100$.

Adithya and Bill are playing a game on a connected graph with $n > 2$ vertices, two of which are labeled $A$ and $B$, so that $A$ and $B$ are distinct and non-adjacent and known to both players. Adithya starts on vertex $A$ and Bill starts on $B$. Each turn, both players move simultaneously: Bill moves to an adjacent vertex, while Adithya may either move to an adjacent vertex or stay at his current vertex. Adithya loses if he is on the same vertex as Bill, and wins if he reaches $B$ alone. Adithya cannot see where Bill is, but Bill can see where Adithya is. Given that Adithya has a winning strategy, what is the maximum possible number of edges the graph may have? (Your answer may be in terms of $n$.) [i]Proposed by Steven Liu[/i]

A triangle is composed of circular cells arranged in $5784$ rows: the first row has one cell, the second has two cells, and so on (see the picture). The cells are divided into pairs of adjacent cells (circles touching each other), so that each cell belongs to exactly one pair. A pair of adjacent cells is called [b]diagonal[/b] if the two cells in it [i]aren't[/i] in the same row. What is the minimum possible amount of diagonal pairs in the division? An example division into pairs is depicted in the image.

S is a parabola with focus F and axis L. Three distinct normals to S pass through P. Show that the sum of the angles which these make with L less the angle which PF makes with L is a multiple of π.

Let the sequence $(a_n)$ be constructed in the following way: $$ a_1=1,\mbox{ }a_2=1,\mbox{ }a_{n+2}=a_{n+1}+\frac{1}{a_n},\mbox{ }n=1,2,\ldots. $$ Prove that $a_{180}>19$. [i](Folklore)[/i]

A circle passes through the vertices of a triangle with side-lengths of $7\tfrac{1}{2},10,12\tfrac{1}{2}$. The radius of the circle is: $\textbf{(A)}\ \dfrac{15}{4} \qquad \textbf{(B)}\ 5 \qquad \textbf{(C)}\ \dfrac{25}{4} \qquad \textbf{(D)}\ \dfrac{35}{4} \qquad \textbf{(E)}\ \dfrac{15\sqrt2}{2} $

We are given a right-angled triangle $MNP$ with right angle in $P$. Let $k_M$ be the circle with center $M$ and radius $MP$, and let $k_N$ be the circle with center $N$ and radius $NP$. Let $A$ and $B$ be the common points of $k_M$ and the line $MN$, and let $C$ and $D$ be the common points of $k_N$ and the line $MN$ with with $C$ between $A$ and $B$. Prove that the line $PC$ bisects the angle $\angle APB$.

Let $ABCD$ be a parallelogram and let $P{}$ be a point inside it such that $\angle PDA= \angle PBA$. Let $\omega_1$ be the excircle of $PAB$ opposite to the vertex $A{}$. Let $\omega_2$ be the incircle of the triangle $PCD$. Prove that one of the common tangents of $\omega_1$ and $\omega_2$ is parallel to $AD$. [i]Ivan Frolov[/i]

Blue rolls a fair $n$-sided die that has sides its numbered with the integers from $1$ to $n$, and then he flips a coin. Blue knows that the coin is weighted to land heads either $\dfrac{1}{3}$ or $\dfrac{2}{3}$ of the time. Given that the probability of both rolling a $7$ and flipping heads is $\dfrac{1}{15}$, find $n$. [i]Proposed by Jacob Xu[/i] [hide=Solution][i]Solution[/i]. $\boxed{10}$ The chance of getting any given number is $\dfrac{1}{n}$ , so the probability of getting $7$ and heads is either $\dfrac{1}{n} \cdot \dfrac{1}{3}=\dfrac{1}{3n}$ or $\dfrac{1}{n} \cdot \dfrac{2}{3}=\dfrac{2}{3n}$. We get that either $n = 5$ or $n = 10$, but since rolling a $7$ is possible, only $n = \boxed{10}$ is a solution.[/hide]