There are $10$ students taking part in a mathematics competition. After the competition, they discover that each solves exactly $3$ problems and any two solve at least one common problem. What is the minimum possible number of students solving a problem solved by the most students?
In triangle $ABC$, $AC=2BC$, $\angle C=90^\circ$, and $D$ is the foot of the altitude from $C$ onto $AB$. A circle with diameter $AD$ intersects the segment $AC$ at $E$. Find $AE:EC$.
In triangle $ABC$, the bisectors of $\angle A$ and $\angle B$ meet at the incentre $I$. The extension of $AI$ meets the circumcircle of $ABC$ at $D$. Let $P$ be the foot of the perpendicular from $B$ onto $AD$, and $Q$ a point on the extension of $AD$ such that $ID=DQ$. Determine $\dfrac{BQ\cdot IB}{BP\cdot ID}$.
In a convex quadrilateral $ABCD$, $\angle BAC=\angle CAD$ and $\angle ABC=\angle ACD$. The extensions of $AD$ and $BC$ meet at $E$, and the extensions of $AB$ and $DC$ meet at $F$. Determine $\dfrac{AB\cdot DE}{BC\cdot CE}$.
For a positive integer $n$, let $N_n=\{1,2,3,\ldots,n\}$. Assume $n\ge10$. Determine the maximum $n$ such that $\displaystyle\min_{\substack{a,b\in A\\a\ne b}}|a-b|\le10$ for every $A\subseteq N_n$ with $|A|\ge10$.
Three girls $A,B,C$ and nine boys are to be lined up in a row. Let $n$ be the number of ways to do this if $B$ must lie between $A$ and $C$, and $A,B$ must be separated by exactly four boys. Determine $\lfloor n/7!\rfloor$.
Let $a_k$ be the coefficient of $x^k$ in $(1+2x)^{100}$, for $0\le k\le100$. Find the number of integers $r$ with $0\le r\le99$ such that $a_r\lt a_{r+1}$.