Let $C$ be the coefficient of $x^2$ in the expansion of the product \[(1 - x)(1 + 2x)(1 - 3x)\cdots(1 + 14x)(1 - 15x).\] Find $|C|$.

a. Does there exist 4 distinct positive integers such that the sum of any 3 of them is prime? b. Does there exist 5 distinct positive integers such that the sum of any 3 of them is prime?

A real number $x$ is chosen uniformly at random from the interval $(0,10).$ Compute the probability that $\sqrt{x}, \sqrt{x+7},$ and $\sqrt{10-x}$ are the side lengths of a non-degenerate triangle.

Denote by $l(n)$ the largest prime divisor of $n$. Let $a_{n+1} = a_n + l(a_n)$ be a recursively defined sequence of integers with $a_1 = 2$. Determine all natural numbers $m$ such that there exists some $i \in \mathbb{N}$ with $a_i = m^2$. [i]Proposed by Nikola Velov, North Macedonia[/i]

If $y$ varies directly as $x$, and if $y=8$ when $x=4$, the value of $y$ when $x=-8$ is: ${{ \textbf{(A)}\ -16} \qquad\textbf{(B)}\ -4 \qquad\textbf{(C)}\ -2 \qquad\textbf{(D)}\ 4k, k= \pm1, \pm2, \dots}$ ${\qquad\textbf{(E)}\ 16k, k=\pm1,\pm2,\dots } $

The radius of the circle inscribed in triangle $ABC$ is equal to $r$, and the radius of the circle tangent to the segment $BC$ and the extensions of sides $AB$ and $AC$ (the exscribed circle corresponding to angle $A$) is equal to $R$. A circle with radius $x < r$ is inscribed in angle $\angle BAC$. Tangents to this circles passing through points $B$ and $C$ and different from $BA$ and $AC$ intersect at point $A'$. Let $y$ be the radius of the circle inscribed in triangle $BCK$. Find the greatest value of the sum $x + y$ as x changes from $0$ to $r$. (In this case, it is necessary to prove that this largest value is the same in any triangle with given $r$ and $R$).

In the triangle $ABC$ we have $\angle A = 2\angle C$ and $2\angle B = \angle A + \angle C$. The angle bisector of $\angle C$ intersects the segment $AB$ in $E$, let $F$ be the midpoint of $AE$, let $AD$ be the altitude of the triangle $ABC$. The perpendicular bisector of $DF$ intersects $AC$ in $M$. Prove that $AM = CM$.

Determine all functions $f:\mathbb{R}\to\mathbb{R}$ satisfying \[f(xy+f(x))+f(y)=xf(y)+f(x+y),\]for all real numbers $x,y$.

There are six empty purses on the table. How many ways are there to put 12 two-euro coins in purses in such a way that at most one purse remains empty?

Among any four people at a party there is one who has met the three others before the party. Show that among any four people at the party there must be one who has met everyone at the party before the party

Find all real numbers $a > 1$ such that there exists an integer $k \ge 1$ such that the sequence $\{x_n\}_{n\ge 1}$ formed with the first $k$ digits of the number $\lfloor a^n\rfloor$ is periodical.

Let $H$ be the orthocenter of an acute triangle $ABC,$ and let $A_1, \: B_1, \: C_1$ be the feet of the altitudes belonging to the vertices $A, \: B, \: C,$ respectively. Let $K$ be a point on the smaller $AB_1$ arc of the circle with diameter $AB$ satisfying the condition $\angle HKB = \angle C_1KB.$ Let $M$ be the point of intersection of the line segment $AA_1$ and the circle with center $C$ and radius $CL$ where $KB \cap CC_1=\{L\}.$ Let $P$ and $Q$ be the points of intersection of the line $CC_1$ and the circle with center $B$ and radius $BM.$ Show that $A, \: K, \: P, \: Q$ are concyclic.

For a real number $x$, let $\lfloor x\rfloor$ stand for the largest integer that is less than or equal to $x$. Prove that \[ \left\lfloor{(n-1)!\over n(n+1)}\right\rfloor \] is even for every positive integer $n$.

A capacitor is made with two square plates, each with side length $L$, of negligible thickness, and capacitance $C$. The two-plate capacitor is put in a microwave which increases the side length of each square plate by $ 1 \% $. By what percent does the voltage between the two plates in the capacitor change? $ \textbf {(A) } \text {decreases by } 2\% \\ \textbf {(B) } \text {decreases by } 1\% \\ \textbf {(C) } \text {it does not change} \\ \textbf {(D) } \text {increases by } 1\% \\ \textbf {(E) } \text {increases by } 2\% $ [i]Problem proposed by Ahaan Rungta[/i]

Let $m$ and $n$ be positive integers such that $m>n$. Define $x_k=\frac{m+k}{n+k}$ for $k=1,2,\ldots,n+1$. Prove that if all the numbers $x_1,x_2,\ldots,x_{n+1}$ are integers, then $x_1x_2\ldots x_{n+1}-1$ is divisible by an odd prime.

Define a "hook" to be a figure made up of six unit squares as shown below in the picture, or any of the figures obtained by applying rotations and reflections to this figure. [asy] unitsize(0.5 cm); draw((0,0)--(1,0)); draw((0,1)--(1,1)); draw((2,1)--(3,1)); draw((0,2)--(3,2)); draw((0,3)--(3,3)); draw((0,0)--(0,3)); draw((1,0)--(1,3)); draw((2,1)--(2,3)); draw((3,1)--(3,3)); [/asy] Determine all $ m\times n$ rectangles that can be covered without gaps and without overlaps with hooks such that - the rectangle is covered without gaps and without overlaps - no part of a hook covers area outside the rectangle.

Consider integers $ a_i,i\equal{}\overline{1,2002}$ such that $ a_1^{ \minus{} 3} \plus{} a_2^{ \minus{} 3} \plus{} \ldots \plus{} a_{2002}^{ \minus{} 3} \equal{} \frac {1}{2}$ Prove that at least 3 of the numbers are equal.

The Princeton University Band plays a setlist of 8 distinct songs, 3 of which are tiring to play. If the Band can't play any two tiring songs in a row, how many ways can the band play its 8 songs?

Patty is standing on a line of planks playing a game. Define a block to be a sequence of adjacent planks, such that both ends are not adjacent to any planks. Every minute, a plank chosen uniformly at random from the block that Patty is standing on disappears, and if Patty is standing on the plank, the game is over. Otherwise, Patty moves to a plank chosen uniformly at random within the block she is in; note that she could end up at the same plank from which she started. If the line of planks begins with $n$ planks, then for sufficiently large n, the expected number of minutes Patty lasts until the game ends (where the first plank disappears a minute after the game starts) can be written as $P(1/n)f(n) + Q(1/n)$, where $P,Q$ are polynomials and $f(n) =\sum^n_{i=1}\frac{1}{i}$ . Find $P(2023) + Q(2023)$.

In triangle $ ABC$, $ 3\sin A \plus{} 4\cos B \equal{} 6$ and $ 4\sin B \plus{} 3\cos A \equal{} 1$. Then $ \angle C$ in degrees is $ \textbf{(A)}\ 30\qquad \textbf{(B)}\ 60\qquad \textbf{(C)}\ 90\qquad \textbf{(D)}\ 120\qquad \textbf{(E)}\ 150$

Let $n$ be an integer, $n \ge 3$. Select $n$ points on the plane, none of which are three on the same line. Consider all triangles with vertices at selected points, denote the smallest of all the interior angles of these triangles by the variable $\alpha$. Find the largest possible value of $\alpha$ and identify all the selected $n$ point placements for which the max occurs.

Let $E$ be a point outside the square $ABCD$ such that $m(\widehat{BEC})=90^{\circ}$, $F\in [CE]$, $[AF]\perp [CE]$, $|AB|=25$, and $|BE|=7$. What is $|AF|$? $ \textbf{(A)}\ 29 \qquad\textbf{(B)}\ 30 \qquad\textbf{(C)}\ 31 \qquad\textbf{(D)}\ 32 \qquad\textbf{(E)}\ 33 $

Find the maximum value of $ x_{0}$ for which there exists a sequence $ x_{0},x_{1}\cdots ,x_{1995}$ of positive reals with $ x_{0} \equal{} x_{1995}$, such that \[ x_{i \minus{} 1} \plus{} \frac {2}{x_{i \minus{} 1}} \equal{} 2x_{i} \plus{} \frac {1}{x_{i}}, \] for all $ i \equal{} 1,\cdots ,1995$.

The nonnegative integers $2000$, $17$ and $n$ are written on the blackboard. Alice and Bob play the following game: Alice begins, then they play in turns. A move consists in replacing one of the three numbers by the absolute difference of the other two. No moves are allowed, where all three numbers remain unchanged. The player who is in turn and cannot make an allowed move loses the game. [list] [*] Prove that the game will end for every number $n$. [*] Who wins the game in the case $n = 2017$? [/list] [i]Proposed by Richard Henner[/i]

Let $A=20132013...2013$ be formed by joining $2013$, $165$ times. Prove that $2013^2 \mid A$.