Suppose that $n\ge 8$ persons $P_1,P_2,\dots,P_n$ meet at a party. Assume that $P_k$ knows $k+3$ persons for $k=1,2,\dots,n-6$. Further assume that each of $P_{n-5},P_{n-4},P_{n-3}$ knows $n-2$ persons, and each of $P_{n-2},P_{n-1},P_n$ knows $n-1$ persons. Find all integers $n\ge 8$ for which this is possible. (It is understood that "to know" is a symmetric nonreflexive relation: if $P_i$ knows $P_j$ then $P_j$ knows $P_i$; to say that $P_i$ knows $p$ persons means: knows $p$ persons other than herself/himself.)

Is it possible to locate in a rectangle of $5$ cm by $ 8$ cm, $51$ circles of diameter $ 1$ cm, so that they don't overlap? Could it be possible for more than $40$ circles ?

The triangle with side lengths $3, 5$, and $k$ has area $6$ for two distinct values of $k$: $x$ and $y$. Compute $|x^2 -y^2|$.

Let $p$ be an odd prime, and put $N=\frac{1}{4} (p^3 -p) -1.$ The numbers $1,2, \dots, N$ are painted arbitrarily in two colors, red and blue. For any positive integer $n \leqslant N,$ denote $r(n)$ the fraction of integers $\{ 1,2, \dots, n \}$ that are red. Prove that there exists a positive integer $a \in \{ 1,2, \dots, p-1\}$ such that $r(n) \neq a/p$ for all $n = 1,2, \dots , N.$ [I]Netherlands[/i]

Let $T$ be a triangle with side lengths 3, 4, and 5. If $P$ is a point in or on $T$, what is the greatest possible sum of the distances from $P$ to each of the three sides of $T$?

Let $x,y,z$ represent the side lengths of any triangle, and $s=\dfrac{x+y+z}{2}$ and the area of this triangle be $\sqrt{s}$ square units. Prove that $$s\Big(\frac{1}{x(s-x)^2}+\frac{1}{y(s-y)^2}+\frac{1}{z(s-z)^ 2} \Big)\ge \frac{1}{2} \Big(\frac{1}{s-x}+\frac{1}{s-y}+\frac{1}{s-z}\Big)$$ [i](Zhuge Liang)[/i]

Let $k$ and $s$ be odd positive integers such that \[\sqrt{3k-2}-1 \le s \le \sqrt{4k}.\] Show that there are nonnegative integers $t$, $u$, $v$, and $w$ such that \[k=t^{2}+u^{2}+v^{2}+w^{2}, \;\; \text{and}\;\; s=t+u+v+w.\]

Let $E$ be an arbitrary point different from $A$ and $B$ on the side $AB$ of a square $ABCD$, and let $F$ and $G$ be points on the segment $CE$ so that $BF$ and $DG$ are perpendicular to $CE$. Prove that $DF = AG$.

[asy]size(100); draw((0,0)--(5,0),MidArrow); draw((5,0)--(10,0),MidArrow); draw((5,5sqrt(3))--(2.5,2.5sqrt(3)),MidArrow); draw((2.5,2.5sqrt(3))--(0,0),MidArrow); draw((5,5sqrt(3))--(7.5,2.5sqrt(3)),MidArrow); draw((7.5,2.5sqrt(3))--(10,0),MidArrow); draw((7.5,2.5sqrt(3))--(2.5,2.5sqrt(3)),MidArrow); draw((7.5,2.5sqrt(3))--(5,0),MidArrow); draw((2.5,2.5sqrt(3))--(5,0),MidArrow); label("D",(0,0),SW); label("C",(5,0),S); label("N",(10,0),SE); label("A",(2.5,2.5sqrt(3)),W); label("B",(7.5,2.5sqrt(3)),E); label("M",(5,5sqrt(3)),N);[/asy] Using only the paths and the directions shown, how many different routes are there from $ M$ to $ N$? \[ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6 \]

The vertices of a regular nonagon (9-sided polygon) are to be labeled with the digits $1$ through $9$ in such a way that the sum of the numbers on every three consecutive vertices is a multiple of $3$. Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.