Find the largest integer $x<1000$ such that $\left(\begin{array}{c}1515 \\ x\end{array}\right)$ and $\left(\begin{array}{c}1975 \\ x\end{array}\right)$ are both odd.

Let $a,b,c,d,e,f$ be real numbers such that the polynomial \[ p(x)=x^8-4x^7+7x^6+ax^5+bx^4+cx^3+dx^2+ex+f \] factorises into eight linear factors $x-x_i$, with $x_i>0$ for $i=1,2,\ldots,8$. Determine all possible values of $f$.

Find the coefficient of $x^{7}y^{6}$ in $(xy+x+3y+3)^{8}$.

A magic $3 \times 5$ board can toggle its cells between black and white. Define a \textit{pattern} to be an assignment of black or white to each of the board's $15$ cells (so there are $2^{15}$ patterns total). Every day after Day 1, at the beginning of the day, the board gets bored with its black-white pattern and makes a new one. However, the board always wants to be unique and will die if any two of its patterns are less than $3$ cells different from each other. Furthermore, the board dies if it becomes all white. If the board begins with all cells black on Day $1$, compute the maximum number of days it can stay alive.

During a lecture, each of $26$ mathematicians falls asleep exactly once, and stays asleep for a nonzero amount of time. Each mathematician is awake at the moment the lecture starts, and the moment the lecture finishes. Prove that there are either $6$ mathematicians such that no two are asleep at the same time, or $6$ mathematicians such that there is some point in time during which all $6$ are asleep.

Let $n,d$ be integers with $n,k > 1$ such that $g.c.d(n,d!) = 1$. Prove that $n$ and $n+d$ are primes if and only if $$d!d((n-1)!+1) + n(d!-1) \equiv 0 \hspace{0.2cm} (\bmod n(n+d)).$$

Arnie draws $20$ real numbers independently and uniformly at random from the interval $[0, 1].$ Given that the largest number that Arnie draws equals $\tfrac{19}{20},$ the expected value of the average of the $20$ numbers can be written as $\tfrac{m}{n}$ for relatively prime positive integers $m$ and $n.$ Find $m + n.$

Given $8$ coins, at most one of them is counterfeit. A counterfeit coin is lighter than a real coin. You have a free weight balance. What is the minimum number of weighings necessary to determine the identity of the counterfeit coin if it exists

Solve the following equation in integers with gcd (x, y) = 1 $x^2 + y^2 = 2 z^2$

Given $n$ positive real numbers satisfying $x_1 \ge x_2 \ge \cdots \ge x_n \ge 0$ and $x_1^2+x_2^2+\cdots+x_n^2=1$, prove that \[\frac{x_1}{\sqrt{1}}+\frac{x_2}{\sqrt{2}}+\cdots+\frac{x_n}{\sqrt{n}}\ge 1.\]

Let $0<x_1\le x_2\le\ldots\le x_n$. Prove that $$\frac{x_1}{x_2}+\frac{x_2}{x_3}+\ldots+\frac{x_{n-1}}{x_n}+\frac{x_n}{x_1}\ge\frac{x_2}{x_1}+\frac{x_3}{x_2}+\ldots+\frac{x_n}{x_{n-1}}+\frac{x_1}{x_n}$$ [i]I. Tonov[/i]

Given an angle with vertex $B$. Construct point $M$ as follows. Let us take an arbitrary isosceles trapezoid whose sides lie on the sides of a given angle. Through two opposite ones draw tangents to the vertices of the circle circumscribed around it. Let $M$ denote the point of intersection of these tangents. What figure do all such points $M$ form?

If $a!+\left(a+2\right)!$ divides $\left(a+4\right)!$ for some nonnegative integer $a$, what are all possible values of $a$? [i]2019 CCA Math Bonanza Individual Round #8[/i]

Let $\triangle ABC$ be a right triangle with right angle $\angle ACB$. Square $DEFG$ is contained inside triangle $ABC$ such that $D$ lies on $AB$, $E$ lies on $BC$, $F$ lies on $AC$, $AD=AF$, and $GA=GD=GF$. Suppose that $CE=2$. If $M$ is the area of triangle $ABC$ and $N$ is the area of square $DEFG$, compute $M-N$.

Let $ A_1A_2A_3$ be a non-isosceles triangle with incenter $ I.$ Let $ C_i,$ $ i \equal{} 1, 2, 3,$ be the smaller circle through $ I$ tangent to $ A_iA_{i\plus{}1}$ and $ A_iA_{i\plus{}2}$ (the addition of indices being mod 3). Let $ B_i, i \equal{} 1, 2, 3,$ be the second point of intersection of $ C_{i\plus{}1}$ and $ C_{i\plus{}2}.$ Prove that the circumcentres of the triangles $ A_1 B_1I,A_2B_2I,A_3B_3I$ are collinear.

Given a triangle $ABC$ and a point $K$ . The lines $AK$,$BK$,$CK$ hit the opposite side of the triangle at $D,E,F$ respectively. On the exterior of $ABC$, we construct three pairs of similar triangles: $BDM$,$DCN$ on $BD$,$DC$, $CEP$,$EAQ$ on $CE$,$EA$, and $AFR$,$FBS$ on $AF$, $FB$. The lines $MN$,$PQ$,$RS$ intersect each other form a triangle $XYZ$. Prove that $AX$,$BY$,$CZ$ are concurrent.

In an isosceles triangle $ABC$ with $BC=AC$ and $\angle B<60^\circ$, $I$ is the incenter and $O$ the circumcenter. The circle with center $E$ that passes through $A,O$ and $I$ intersects the circumcircle of $\triangle ABC$ again at point $D$. Prove that the lines $DE$ and $CO$ intersect on the circumcircle of $ABC$.

An aircraft is equipped with three engines that operate independently. The probability of an engine failure is .01. What is the probability of a successful flight if only one engine is needed for the successful operation of the aircraft?

A positive number $a$ is given, such that $a$ could be expressed as difference of two inverses of perfect squares ($a=\frac1{n^2}-\frac1{m^2}$). Is it possible for $2a$ to be expressed as difference of two perfect squares?

Find the smallest natural number $x> 0$ so that all following fractions are simplified $\frac{3x+9}{8},\frac{3x+10}{9},\frac{3x+11}{10},...,\frac{3x+49}{48}$ , i.e. numerators and denominators are relatively prime.

Problem: Find all polynomials satisfying the equation $ f(x^2) = (f(x))^2 $ for all real numbers x. I'm not exactly sure where to start though it doesn't look too difficult. Thanks!

Let $N\ge2$ be a fixed positive integer. There are $2N$ people, numbered $1,2,...,2N$, participating in a tennis tournament. For any two positive integers $i,j$ with $1\le i<j\le 2N$, player $i$ has a higher skill level than player $j$. Prior to the first round, the players are paired arbitrarily and each pair is assigned a unique court among $N$ courts, numbered $1,2,...,N$. During a round, each player plays against the other person assigned to his court (so that exactly one match takes place per court), and the player with higher skill wins the match (in other words, there are no upsets). Afterwards, for $i=2,3,...,N$, the winner of court $i$ moves to court $i-1$ and the loser of court $i$ stays on court $i$; however, the winner of court 1 stays on court 1 and the loser of court 1 moves to court $N$. Find all positive integers $M$ such that, regardless of the initial pairing, the players $2, 3, \ldots, N+1$ all change courts immediately after the $M$th round. [i]Proposed by Ray Li[/i]

$ABC$-triangle with circumcenter $O$ and $\angle B=30$. $BO$ intersect $AC$ at $K$. $L$ - midpoint of arc $OC$ of circumcircle $KOC$, that does not contains $K$. Prove, that $A,B,L,K$ are concyclic.

The numbers -2, 4, 6, 9 and 12 are rearranged according to these rules: 1. The largest isn't first, but it is in one of the first three places. 2. The smallest isn't last, but it is in one of the last three places. 3. The median isn't first or last. What is the average of the first and last numbers? $\textbf{(A)}\: 3.5 \qquad\textbf{(B)} \:5 \qquad\textbf{(C)} \:6.5 \qquad\textbf{(D)} \:7.5 \qquad\textbf{(E)} \:8$

Angle bisectors $AA', BB'$and $CC'$ are drawn in triangle $ABC$ with angle $\angle B= 120^o$. Find $\angle A'B'C'$.