Does there exist a set $S$ of $100$ points in a plane such that the center of mass of any $10$ points in $S$ is also a point in $S$?

Let $a,b \in [0,1], c \in [-1,1]$ be reals chosen independently and uniformly at random. What is the probability that $p(x) = ax^2+bx+c$ has a root in $[0,1]$?

Circles $\mathcal{P}$ and $\mathcal{Q}$ have radii $1$ and $4$, respectively, and are externally tangent at point $A$. Point $B$ is on $\mathcal{P}$ and point $C$ is on $\mathcal{Q}$ so that line $BC$ is a common external tangent of the two circles. A line $\ell$ through $A$ intersects $\mathcal{P}$ again at $D$ and intersects $\mathcal{Q}$ again at $E$. Points $B$ and $C$ lie on the same side of $\ell$, and the areas of $\triangle DBA$ and $\triangle ACE$ are equal. This common area is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$. [asy] import cse5; pathpen=black; pointpen=black; size(6cm); pair E = IP(L((-.2476,1.9689),(0.8,1.6),-3,5.5),CR((4,4),4)), D = (-.2476,1.9689); filldraw(D--(0.8,1.6)--(0,0)--cycle,gray(0.7)); filldraw(E--(0.8,1.6)--(4,0)--cycle,gray(0.7)); D(CR((0,1),1)); D(CR((4,4),4,150,390)); D(L(MP("D",D(D),N),MP("A",D((0.8,1.6)),NE),1,5.5)); D((-1.2,0)--MP("B",D((0,0)),S)--MP("C",D((4,0)),S)--(8,0)); D(MP("E",E,N)); [/asy]

In convex pentagon $ABCDE$ points $A_1$, $B_1$, $C_1$, $D_1$, $E_1$ are intersections of pairs of diagonals $(BD, CE)$, $(CE, DA)$, $(DA, EB)$, $(EB, AC)$ and $(AC, BD)$ respectively. Prove that if four of quadrilaterals $AB_{1}A_{1}B$, $BC_{1}B_{1}C$, $CD_{1}C_{1}D$, $DE_{1}D_{1}E$ and $EA_{1}E_{1}A$ are cyclic then the fifth one is also cyclic.

Andy the Ant lives on a coordinate plane and is currently at $(-20, 20)$ facing east (that is, in the positive $x$-direction). Andy moves $1$ unit and then turns $90^{\circ}$ degrees left. From there, Andy moves $2$ units (north) and then turns $90^{\circ}$ degrees left. He then moves $3$ units (west) and again turns $90^{\circ}$ degrees left. Andy continues his progress, increasing his distance each time by $1$ unit and always turning left. What is the location of the point at which Andy makes the $2020$th left turn? $\textbf{(A)}\ (-1030, -994)\qquad\textbf{(B)}\ (-1030, -990)\qquad\textbf{(C)}\ (-1026, -994)\qquad\textbf{(D)}\ (-1026, -990)\qquad\textbf{(E)}\ (-1022, -994)$

In the isosceles triangle $ ABC$ the angle $ BAC$ is a right angle. Point $ D$ lies on the side $ BC$ and satisfies $ BD \equal{} 2 \cdot CD$. Point $ E$ is the foot of the perpendicular of the point $ B$ on the line $ AD$. Find the angle $ CED$.

I couldn't solve this problem and the only solution I was able to find was very unnatural (it was an official solution, I think) and I couldn't be satisfied with it, so I ask you if you can find some different solutions. The problem is really great one! If $M$ is the centroid of a triangle $ABC$, prove that the following inequality holds: \[\sin\angle CAM+\sin\angle CBM\leq\frac{2}{\sqrt3}.\] The equality occurs in a very strange case, I don't remember it.

Let $ T$ be the set of all positive integer divisors of $ 2004^{100}$. What is the largest possible number of elements of a subset $ S$ of $ T$ such that no element in $ S$ divides any other element in $ S$?

Consider a $100\times 100$ square unit lattice $\textbf{L}$ (hence $\textbf{L}$ has $10000$ points). Suppose $\mathcal{F}$ is a set of polygons such that all vertices of polygons in $\mathcal{F}$ lie in $\textbf{L}$ and every point in $\textbf{L}$ is the vertex of exactly one polygon in $\mathcal{F}.$ Find the maximum possible sum of the areas of the polygons in $\mathcal{F}.$ [i]Michael Ren and Ankan Bhattacharya, USA[/i]

Let $ABC$ be an equilateral triangle. From the vertex $A$ we draw a ray towards the interior of the triangle such that the ray reaches one of the sides of the triangle. When the ray reaches a side, it then bounces off following the law of reflection, that is, if it arrives with a directed angle $\alpha$, it leaves with a directed angle $180^{\circ}-\alpha$. After $n$ bounces, the ray returns to $A$ without ever landing on any of the other two vertices. Find all possible values of $n$.

Given six real numbers $a$, $b$, $c$, $x$, $y$, $z$ such that $0 < b-c < a < b+c$ and $ax + by + cz = 0$. What is the sign of the sum $ayz + bzx + cxy$ ?

For a set $A$ of integers, define $f(A)=\{x^2+xy+y^2: x,y\in A\}$. Is there a constant $c$ such that for all positive integers $n$, there exists a set $A$ of size $n$ such that $|f(A)|\le cn$? [i]David Yang.[/i]

Suppose there are $997$ points given in a plane. If every two points are joined by a line segment with its midpoint coloured in red, show that there are at least $1991$ red points in the plane. Can you find a special case with exactly $1991$ red points?

Suppose that $ a_1$, $ a_2$, $ \ldots$, $ a_n$ are integers such that $ n\mid a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n$. Prove that there exist two permutations $ \left(b_1,b_2,\ldots,b_n\right)$ and $ \left(c_1,c_2,\ldots,c_n\right)$ of $ \left(1,2,\ldots,n\right)$ such that for each integer $ i$ with $ 1\leq i\leq n$, we have \[ n\mid a_i \minus{} b_i \minus{} c_i \] [i]Proposed by Ricky Liu & Zuming Feng, USA[/i]