There is a polynomial $P(x)$ with integer coefficients such that $$P(x)=\frac{(x^{2310}-1)^6}{(x^{105}-1)(x^{70}-1)(x^{42}-1)(x^{30}-1)}$$ holds for every $0<x<1.$ Find the coefficient of $x^{2022}$ in $P(x)$

Compute the number of quadruples $(a,b,c,d)$ of positive integers satisfying $$12a+21b+28c+84d=2024.$$

The $8$ eyelets for the lace of a sneaker all lie on a rectangle, four equally spaced on each of the longer sides. The rectangle has a width of $50$ mm and a length of $80$ mm. There is one eyelet at each vertex of the rectangle. The lace itself must pass between the vertex eyelets along a width side of the rectangle and then crisscross between successive eyelets until it reaches the two eyelets at the other width side of the rectrangle as shown. After passing through these final eyelets, each of the ends of the lace must extend at least $200$ mm farther to allow a knot to be tied. Find the minimum length of the lace in millimeters. [asy] size(200); defaultpen(linewidth(0.7)); path laceL=(-20,-30)..tension 0.75 ..(-90,-135)..(-102,-147)..(-152,-150)..tension 2 ..(-155,-140)..(-135,-40)..(-50,-4)..tension 0.8 ..origin; path laceR=reflect((75,0),(75,-240))*laceL; draw(origin--(0,-240)--(150,-240)--(150,0)--cycle,gray); for(int i=0;i<=3;i=i+1) { path circ1=circle((0,-80*i),5),circ2=circle((150,-80*i),5); unfill(circ1); draw(circ1); unfill(circ2); draw(circ2); } draw(laceL--(150,-80)--(0,-160)--(150,-240)--(0,-240)--(150,-160)--(0,-80)--(150,0)^^laceR,linewidth(1));[/asy]

For $n \ge 1$ call a finite sequence $(a_1, a_2 \ldots a_n)$ of positive integers [i]progressive[/i] if $a_i < a_{i+1}$ and $a_i$ divides $a_{i+1}$ for all $1 \le i \le n-1$. Find the number of progressive sequences such that the sum of the terms in the sequence is equal to $360$.

The number $2013$ has the property that its units digit is the sum of its other digits, that is $2+0+1=3$. How many integers less than $2013$ but greater than $1000$ share this property? ${ \textbf{(A)}\ 33 \qquad\textbf{(B)}\ 34 \qquad\textbf{(C)}\ 45 \qquad\textbf{(D)}}\ 46\qquad\textbf{(E)}\ 58 $

Find, with proof, all pairs of positive integers $(n,d)$ with the following property: for every integer $S$, there exists a unique non-decreasing sequence of $n$ integers $a_1,a_2,...,a_n$ such that $a_1 + a_2 + ... + a_n = S$ and $a_n-a_1=d.$

Let $n \geq 1$ be an integer. A [b]path[/b] from $(0,0)$ to $(n,n)$ in the $xy$ plane is a chain of consecutive unit moves either to the right (move denoted by $E$) or upwards (move denoted by $N$), all the moves being made inside the half-plane $x \geq y$. A [b]step[/b] in a path is the occurence of two consecutive moves of the form $EN$. Show that the number of paths from $(0,0)$ to $(n,n)$ that contain exactly $s$ steps $(n \geq s \geq 1)$ is \[\frac{1}{s} \binom{n-1}{s-1} \binom{n}{s-1}.\]

[b]p1.[/b] David runs at $3$ times the speed of Alice. If Alice runs $2$ miles in $30$ minutes, determine how many minutes it takes for David to run a mile. [b]p2.[/b] Al has $2019$ red jelly beans. Bob has $2018$ green jelly beans. Carl has $x$ blue jelly beans. The minimum number of jelly beans that must be drawn in order to guarantee $2$ jelly beans of each color is $4041$. Compute $x$. [b]p3.[/b] Find the $7$-digit palindrome which is divisible by $7$ and whose first three digits are all $2$. [b]p4.[/b] Determine the number of ways to put $5$ indistinguishable balls in $6$ distinguishable boxes. [b]p5.[/b] A certain reduced fraction $\frac{a}{b}$ (with $a,b > 1$) has the property that when $2$ is subtracted from the numerator and added to the denominator, the resulting fraction has $\frac16$ of its original value. Find this fraction. [b]p6.[/b] Find the smallest positive integer $n$ such that $|\tau(n +1)-\tau(n)| = 7$. Here, $\tau(n)$ denotes the number of divisors of $n$. [b]p7.[/b] Let $\vartriangle ABC$ be the triangle such that $AB = 3$, $AC = 6$ and $\angle BAC = 120^o$. Let $D$ be the point on $BC$ such that $AD$ bisect $\angle BAC$. Compute the length of $AD$. [b]p8.[/b] $26$ points are evenly spaced around a circle and are labeled $A$ through $Z$ in alphabetical order. Triangle $\vartriangle LMT$ is drawn. Three more points, each distinct from $L, M$, and $T$ , are chosen to form a second triangle. Compute the probability that the two triangles do not overlap. [b]p9.[/b] Given the three equations $a +b +c = 0$ $a^2 +b^2 +c^2 = 2$ $a^3 +b^3 +c^3 = 19$ find $abc$. [b]p10.[/b] Circle $\omega$ is inscribed in convex quadrilateral $ABCD$ and tangent to $AB$ and $CD$ at $P$ and $Q$, respectively. Given that $AP = 175$, $BP = 147$,$CQ = 75$, and $AB \parallel CD$, find the length of $DQ$. [b]p11. [/b]Let $p$ be a prime and m be a positive integer such that $157p = m^4 +2m^3 +m^2 +3$. Find the ordered pair $(p,m)$. [b]p12.[/b] Find the number of possible functions $f : \{-2,-1, 0, 1, 2\} \to \{-2,-1, 0, 1, 2\}$ that satisfy the following conditions. (1) $f (x) \ne f (y)$ when $x \ne y$ (2) There exists some $x$ such that $f (x)^2 = x^2$ [b]p13.[/b] Let $p$ be a prime number such that there exists positive integer $n$ such that $41pn -42p^2 = n^3$. Find the sum of all possible values of $p$. [b]p14.[/b] An equilateral triangle with side length $ 1$ is rotated $60$ degrees around its center. Compute the area of the region swept out by the interior of the triangle. [b]p15.[/b] Let $\sigma (n)$ denote the number of positive integer divisors of $n$. Find the sum of all $n$ that satisfy the equation $\sigma (n) =\frac{n}{3}$. [b]p16[/b]. Let $C$ be the set of points $\{a,b,c\} \in Z$ for $0 \le a,b,c \le 10$. Alice starts at $(0,0,0)$. Every second she randomly moves to one of the other points in $C$ that is on one of the lines parallel to the $x, y$, and $z$ axes through the point she is currently at, each point with equal probability. Determine the expected number of seconds it will take her to reach $(10,10,10)$. [b]p17.[/b] Find the maximum possible value of $$abc \left( \frac{1}{a}+\frac{1}{b}+\frac{1}{c}\right)^3$$ where $a,b,c$ are real such that $a +b +c = 0$. [b]p18.[/b] Circle $\omega$ with radius $6$ is inscribed within quadrilateral $ABCD$. $\omega$ is tangent to $AB$, $BC$, $CD$, and $DA$ at $E, F, G$, and $H$ respectively. If $AE = 3$, $BF = 4$ and $CG = 5$, find the length of $DH$. [b]p19.[/b] Find the maximum integer $p$ less than $1000$ for which there exists a positive integer $q$ such that the cubic equation $$x^3 - px^2 + q x -(p^2 -4q +4) = 0$$ has three roots which are all positive integers. [b]p20.[/b] Let $\vartriangle ABC$ be the triangle such that $\angle ABC = 60^o$,$\angle ACB = 20^o$. Let $P$ be the point such that $CP$ bisects $\angle ACB$ and $\angle PAC = 30^o$. Find $\angle PBC$. PS. You had better use hide for answers.

Allen and Alan play a game. A nonconstant polynomial $P(x,y)$ with real coefficients and a positive integer $d$ greater than the degree of $P$ are known to both Allen and Alan. Alan thinks of a polynomial $Q(x,y)$ with real coefficients and degree at most $d$ and keeps it secret. Allen can make queries of the form $(s,t)$, where $s$ and $t$ are real numbers such that $P(s,t)\neq0$. Alan must respond with the value $Q(s,t)$. Allen's goal is to determine whether $P$ divides $Q$. Find (in terms of $P$ and $d$) the smallest positive integer, $g$, such that Allen can always achieve this goal making no more than $g$ queries. [i]Linus Tang[/i]

Jason rolls three fair standard six-sided dice. Then he looks at the rolls and chooses a subset of the dice (possibly empty, possibly all three dice) to reroll. After rerolling, he wins if and only if the sum of the numbers face up on the three dice is exactly $7$. Jason always plays to optimize his chances of winning. What is the probability that he chooses to reroll exactly two of the dice? $\textbf{(A) } \frac{7}{36} \qquad\textbf{(B) } \frac{5}{24} \qquad\textbf{(C) } \frac{2}{9} \qquad\textbf{(D) } \frac{17}{72} \qquad\textbf{(E) } \frac{1}{4}$

Five different awards are to be given to three students. Each student will receive at least one award. In how many ways can the awards be distributed? $\textbf{(A)}\ 120 \qquad \textbf{(B)}\ 150 \qquad \textbf{(C)}\ 180 \qquad \textbf{(D)}\ 210 \qquad \textbf{(E)}\ 240$

Let $f(x)$ be a monic polynomial of degree $2023$ with positive integer coefficients. Show that for any sufficiently large integer $N$ and any prime number $p>2023N$, the product \[f(1)f(2)\dots f(N)\] is at most $\binom{2023}{2}$ times divisible by $p$. [i]Proposed by Ashwin Sah[/i]

For $m$ a positive integer, let $s(m)$ be the sum of the digits of $m$. For $n\ge 2$, let $f(n)$ be the minimal $k$ for which there exists a set $S$ of $n$ positive integers such that $s\left(\sum_{x\in X} x\right)=k$ for any nonempty subset $X\subset S$. Prove that there are constants $0<C_1<C_2$ with \[C_1 \log_{10} n \le f(n) \le C_2 \log_{10} n.\]

As a reward for working for NIMO, Evan divides $100$ indivisible marbles among three of his volunteers: David, Justin, and Michael. (Of course, each volunteer must get at least one marble!) However, Evan knows that, in the middle of the night, Lewis will select a positive integer $n > 1$ and, for each volunteer, steal exactly $\frac 1n$ of his marbles (if possible, i.e. if $n$ divides the number of marbles). In how many ways can Evan distribute the $100$ marbles so that Lewis is unable to steal marbles from every volunteer, regardless of which $n$ he selects? [i]Proposed by Jack Cornish[/i]

Let $N$ be the number of polynomials $P(x_1, x_2, \dots, x_{2016})$ of degree at most $2015$ with coefficients in the set $\{0, 1, 2 \}$ such that $P(a_1,a_2,\cdots ,a_{2016}) \equiv 1 \pmod{3}$ for all $(a_1,a_2,\cdots ,a_{2016}) \in \{0, 1\}^{2016}.$ Compute the remainder when $v_3(N)$ is divided by $2011$, where $v_3(N)$ denotes the largest integer $k$ such that $3^k | N.$ [i]Proposed by Yang Liu[/i]