$100$ heaps of stones lie on a table. Two players make moves in turn. At each move, a player can remove any non-zero number of stones from the table, so that at least one heap is left untouched. The player that cannot move loses. Determine, for each initial position, which of the players, the first or the second, has a winning strategy. [i]K. Kokhas[/i] [b]EDIT.[/b] It is indeed confirmed by the sender that empty heaps are still heaps, so the third post contains the right guess of an interpretation.

Find the number of primes$ p$, such that $ x^{3} \minus{}5x^{2} \minus{}22x\plus{}56\equiv 0\, \, \left(mod\, p\right)$ has no three distinct integer roots in $ \left[0,\left. p\right)\right.$. $\textbf{(A)}\ 1 \qquad\textbf{(B)}\ 2 \qquad\textbf{(C)}\ 3 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ \text{None}$

There are $5$ people left in a game of Among Us, $4$ of whom are crewmates and the last is the impostor. None of the crewmates know who the impostor is. The person with the most votes is ejected, unless there is a tie in which case no one is ejected. Each of the $5$ remaining players randomly votes for someone other than themselves. The probability the impostor is ejected can be expressed as $\frac{m}{n}$. Find $m+n$. [i]Proposed by Sammy Charney[/i]

Let $ABC$ be a triangle and let $P$ be a point in its interior. Lines $PA$, $PB$, $PC$ intersect sides $BC$, $CA$, $AB$ at $D$, $E$, $F$, respectively. Prove that \[ [PAF]+[PBD]+[PCE]=\frac{1}{2}[ABC] \] if and only if $P$ lies on at least one of the medians of triangle $ABC$. (Here $[XYZ]$ denotes the area of triangle $XYZ$.)

Let $a, b, c, d > 0$ satisfy $36a + 4b + 4c + 3d = 25$. What is the maximum possible value of $ab^{1/2}c^{1/3}d^{1/4}$ ?

Find the last three digits of \[2008^{2007^{\cdot^{\cdot^{\cdot ^{2^1}}}}}.\]

Given a positive integer $n$, find the proportion of the subsets of $\{1,2, \ldots, 2n\}$ such that their smallest element is odd.

In square $ABCD$ with $AB = 10$, point $P, Q$ are chosen on side $CD$ and $AD$ respectively such that $BQ \perp AP,$ and $R$ lies on $CD$ such that $RQ \parallel PA.$ $BC$ and $AP$ intersect at $X,$ and $XQ$ intersects the circumcircle of $PQD$ at $Y$. Given that $\angle PYR = 105^{\circ},$ $AQ$ can be expressed in simplest radical form as $b\sqrt{c}-a$ where $a, b, c$ are positive integers. Find $a+b+c.$

a) Given a triangle $A_1A_2A_3$ and the points $B_1$ and $D_2$ on the side $[A_1A_2]$, $B_2$ and $D_3$ on the side $[A_2A3]$, $B_3$ and $D_1$ on the side $[A_3A_1]$. If you construct parallelograms $A_1B_1C_1D_1$, $A_2B_2C_2D_2$ and $A_3B_3C_3D_3$, the lines $(A_1C_1)$, $(A_2C_2)$ and $(A_3C_3)$, will cross in one point $O$. Prove that if $$|A_1B_1| = |A_2D_2| \,\,\, and \,\,\, |A_2B_2| = |A_3D_3|$$ then $$|A_3B_3| = |A_1D_1|$$ b) Given a convex polygon $A_1A_2 ... A_n$ and the points $B_1$ and $D_2$ on the side $[A_1A_2]$, $B_2$ and $D_3$ on the side $[A_2A_3]$, ... $B_n$ and $D_1$ on the side $[A_nA_1]$. If you construct parallelograms $A_1B_1C_1D_1$, $A_2B_2C_2D_2$, $... $, $A_nB_nC_nD_n$, the lines $(A_1C_1)$, $(A_2C_2)$, $...$, $(A_nC_n)$, will cross in one point $O$. Prove that $$|A_1B_1| \cdot |A_2B_2|\cdot ... \cdot |A_nB_n| = |A_1D_1|\cdot |A_2D_2|\cdot ...\cdot |A_nD_n|$$

Given two sequences of positive integers: the arithmetic sequence with difference $r > 0$ and the geometric sequence with ratio $q > 1$; $r$ and $q$ are coprime. Prove that if these sequences have one term in common, then they have them infinitely many.

The following solitaire game is played on an $m\times n$ rectangular board, $m,n\ge 2$, divided into unit squares. First, a rook is placed on some square. At each move, the rook can be moved an arbitrary number of squares horizontally or vertically, with the extra condition that each move has to be made in the $90^{\circ}$ clockwise direction compared to the previous one (e.g. after a move to the left, the next one has to be done upwards, the next one to the right etc). For which values of $m$ and $n$ is it possible that the rook visits every square of the board exactly once and returns to the first square? (The rook is considered to visit only those squares it stops on, and not the ones it steps over.)

There are $ n$ football teams in a round-robin competition where every 2 teams meet once. The winner of each match receives 3 points while the loser receives 0 points. In the case of a draw, both teams receive 1 point each. Let $ k$ be as follows: $ 2 \leq k \leq n \minus{} 1$. At least how many points must a certain team get in the competition so as to ensure that there are at most $ k \minus{} 1$ teams whose scores are not less than that particular team's score?

Three distinct positive integers are chosen at random from $\{1,2,3...,12\}$. The probability that no two elements of the set have an absolute difference less than or equal to $2$ can be written as $\frac{a}{b}$ where $a$ and $b$ are relatively prime positive integers. Find $a +b$.

For any positive integer $n$, $S_{n}$ be the set of all permutations of $\{1,2,3,\dots,n\}$. For each permutation $\pi \in S_n$, let $f(\pi)$ be the number of ordered pairs $(j,k)$ for which $\pi(j)>\pi(k)$ and $1\leq j<k \leq n$. Further define $g(\pi)$ to be the number of positive integers $k \leq n$ such that $\pi(k)\equiv k \pm 1 \pmod{n}$. Compute \[ \sum_{\pi \in S_{999}} (-1)^{f(\pi)+g(\pi)}. \]

The figure below shows a polygon $ABCDEFGH$, consisting of rectangles and right triangles. When cut out and folded on the dotted lines, the polygon forms a triangular prism. Suppose that $AH = EF = 8$ and $GH = 14$. What is the volume of the prism? [asy] // djmathman diagram unitsize(1cm); defaultpen(linewidth(0.7)+fontsize(11)); real r = 2, s = 2.5, theta = 14; pair G = (0,0), F = (r,0), C = (r,s), B = (0,s), M = (C+F)/2, I = M + s/2 * dir(-theta); pair N = (B+G)/2, J = N + s/2 * dir(180+theta); pair E = F + r * dir(- 45 - theta/2), D = I+E-F; pair H = J + r * dir(135 + theta/2), A = B+H-J; draw(A--B--C--I--D--E--F--G--J--H--cycle^^rightanglemark(F,I,C)^^rightanglemark(G,J,B)); draw(J--B--G^^C--F--I,linetype ("4 4")); dot("$A$",A,N); dot("$B$",B,1.2*N); dot("$C$",C,N); dot("$D$",D,dir(0)); dot("$E$",E,S); dot("$F$",F,1.5*S); dot("$G$",G,S); dot("$H$",H,W); dot("$I$",I,NE); dot("$J$",J,1.5*S); [/asy] $\textbf{(A)} ~112\qquad\textbf{(B)} ~128\qquad\textbf{(C)} ~192\qquad\textbf{(D)} ~240\qquad\textbf{(E)} ~288\qquad$

Quadrilateral $ABCD$ with perpendicular diagonals is inscribed in a circle with centre $O$. The tangents to this circle at $A$ and $C$ together with line $BD$ form the triangle $\Delta$. Prove that the circumcircles of $BOD$ and $\Delta$ are tangent. [hide=Additional information for Junior League]Show that this point lies belongs to $\omega$, the circumcircle of $OAC$[/hide] [i]Proposed by A. Kuznetsov[/i]

Cards numbered 1 to 9 are arranged at random in a row. In a move, one may choose any block of consecutive cards whose numbers are in ascending or descending order, and switch the block around. For example, 9 1 $\underline{6\ 5\ 3}$ $2\ 7\ 4\ 8$ may be changed to $9 1$ $\underline{3\ 5\ 6}$ $2\ 7\ 4\ 8$. Prove that in at most 12 moves, one can arrange the 9 cards so that their numbers are in ascending or descending order.

One hundred balls labelled $1$ to $100$ are to be put into two identical boxes so that each box contains at least one ball and the greatest common divisor of the product of the labels of all the balls in one box and the product of the labels of all the balls in the other box is $1$. Determine the number of ways that this can be done.

Find all composite odd positive integers, all divisors of which can be divided into pairs so that the sum of the numbers in each pair is a power of two, and each divisor belongs to exactly one such pair. [i]Proposed by Anton Trygub[/i]

The Math Team designed a logo shaped like a multiplication symbol, shown below on a grid of 1-inch squares. What is the area of the logo in square inches? [asy] usepackage("mathptmx"); defaultpen(linewidth(0.5)); size(5cm); defaultpen(fontsize(14pt)); label("$\textbf{Math}$", (2.1,3.7)--(3.9,3.7)); label("$\textbf{Team}$", (2.1,3)--(3.9,3)); filldraw((1,2)--(2,1)--(3,2)--(4,1)--(5,2)--(4,3)--(5,4)--(4,5)--(3,4)--(2,5)--(1,4)--(2,3)--(1,2)--cycle, mediumgray*0.5 + lightgray*0.5); draw((0,0)--(6,0), gray); draw((0,1)--(6,1), gray); draw((0,2)--(6,2), gray); draw((0,3)--(6,3), gray); draw((0,4)--(6,4), gray); draw((0,5)--(6,5), gray); draw((0,6)--(6,6), gray); draw((0,0)--(0,6), gray); draw((1,0)--(1,6), gray); draw((2,0)--(2,6), gray); draw((3,0)--(3,6), gray); draw((4,0)--(4,6), gray); draw((5,0)--(5,6), gray); draw((6,0)--(6,6), gray); [/asy] $\textbf{(A) } 10 \qquad \textbf{(B) } 12 \qquad \textbf{(C) } 13 \qquad \textbf{(D) } 14 \qquad \textbf{(E) } 15$

Let $OX, OY, OZ$ be mutually orthogonal lines in space. Let $C$ be a fixed point on $OZ$ and $U,V$ variable points on $OX, OY,$ respectively. Find the locus of a point $P$ such that $PU, PV, PC$ are mutually orthogonal.

The infinite sequence $a_0,a _1, a_2, \dots$ of (not necessarily distinct) integers has the following properties: $0\le a_i \le i$ for all integers $i\ge 0$, and \[\binom{k}{a_0} + \binom{k}{a_1} + \dots + \binom{k}{a_k} = 2^k\] for all integers $k\ge 0$. Prove that all integers $N\ge 0$ occur in the sequence (that is, for all $N\ge 0$, there exists $i\ge 0$ with $a_i=N$).

In two circles intersecting at points $A$ and $B$, parallel chords $A_1B_1$ and $A_2B_2$ are drawn. The lines $AA_1$ and $BB_2$ intersect at the point $X, AA_2$ and $BB_1$ intersect at the point $Y$. Prove that $XY // A_1B_1$.

Let $f_1,f_2,\cdots ,f_{10}$ be bijections on $\mathbb{Z}$ such that for each integer $n$, there is some composition $f_{\ell_1}\circ f_{\ell_2}\circ \cdots \circ f_{\ell_m}$ (allowing repetitions) which maps $0$ to $n$. Consider the set of $1024$ functions \[ \mathcal{F}=\{f_1^{\epsilon_1}\circ f_2^{\epsilon_2}\circ \cdots \circ f_{10}^{\epsilon_{10}}\} \] where $\epsilon _i=0$ or $1$ for $1\le i\le 10.\; (f_i^{0}$ is the identity function and $f_i^1=f_i)$. Show that if $A$ is a finite set of integers then at most $512$ of the functions in $\mathcal{F}$ map $A$ into itself.

Given a sequence of $19$ positive (not necessarily distinct) integers not greater than $93$, and a set of $93$ positive (not necessarily distinct) integers not greater than $19$. Show that we can find non-empty subsequences of the two sequences with equal sum.