What is the largest positive integer $n$ such that $10 \times 11 \times 12 \times ... \times 50$ is divisible by $10^n$?

Given eight distinguishable rings, let $n$ be the number of possible five-ring arrangements on the four fingers (not the thumb) of one hand. The order of rings on each finger is significant, but it is not required that each finger have a ring. Find the leftmost three nonzero digits of $n.$

The base of a pyramid $ABCDV$ is a rectangle $ABCD$ with the sides $AB=a$ and $BC=b$, and all lateral edges of the pyramid have length $c$. Find the area of the intersection of the pyramid with a plane that contains the diagonal $BD$ and is parallel to $VA$.

Justify the statement that $$3=\sqrt{1+2\sqrt{1+3\sqrt{1+4\sqrt{1+5\sqrt{1+\dots}}}}}.$$

The sequence $ (a_n)$ is defined by $ a_1\equal{}a_2\equal{}a_3\equal{}1$ and $ a_{n\plus{}1}a_{n\minus{}2}\minus{}a_n a_{n\minus{}1}\equal{}2$ for all $ n \ge 3.$ Prove that $ a_n$ is a positive integer for all $ n \ge 1$.

Find the first digit to the left and the first digit to the right of the decimal point in the expansion of $ (\sqrt{2}\plus{}\sqrt{5})^{2000}.$

For postive integers $k,n$, let $$f_k(n)=\sum_{m\mid n,m>0}m^k$$ Find all pairs of positive integer $(a,b)$ such that $f_a(n)\mid f_b(n)$ for every positive integer $n$.

Find the smallest positive number $\lambda$, such that for any $12$ points on the plane $P_1,P_2,\ldots,P_{12}$(can overlap), if the distance between any two of them does not exceed $1$, then $\sum_{1\le i<j\le 12} |P_iP_j|^2\le \lambda$.

Denote $\textrm{SL}_2 (\mathbb{Z})$ and $\textrm{SL}_3 (\mathbb{Z})$ the sets of matrices with $2$ rows and $2$ columns, respectively with $3$ rows and $3$ columns, with integer entries and their determinant equal to $1$. $\textbf{(a)}$ Let $N$ be a positive integer and let $g$ be a matrix with $3$ rows and $3$ columns, with rational entries. Suppose that for each positive divisor $M$ of $N$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $N$ and a matrix $\gamma_M \in \textrm{SL}_3 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{ccc} 1 & 0 & 0\\ 0 & 1 & 0\\ 0 & 0 & M^{} \end{array}\right) . \] Moreover, if $q_1 = 1$, prove that $\det (g) = N$ and $g$ has the following shape: \[ g = \left(\begin{array}{ccc} a_{11} & a_{12} & Na_{13}\\ a_{21} & a_{22} & Na_{23}\\ Na_{31} & Na_{32} & Na_{33} \end{array}\right), \] where $a_{ij}$ are all integers, $i, j \in \{ 1, 2, 3 \} .$ $\textbf{(b)}$ Provide an example of a matrix $g$ with $2$ rows and $2$ columns which satisfies the following properties: $\bullet$ For each positive divisor $M$ of $6$ there exists a rational number $q_M$, a positive divisor $f (M)$ of $6$ and a matrix $\gamma_M \in \textrm{SL}_2 (\mathbb{Z})$ such that \[ g = q_M \left(\begin{array}{cc} 1 & 0\\ 0 & f (M) \end{array}\right) \gamma_M \left(\begin{array}{cc} 1 & 0\\ 0 & M^{} \end{array}\right) \] and $q_1 = 1$. $\bullet$ $g$ does not have its determinant equal to $6$ and is not of the shape \[ g = \left(\begin{array}{cc} a_{22} & 6 a_{23}\\ 6 a_{32} & 6 a_{33} \end{array}\right), \] where $a_{ij}$ are all positive integers, $i, j \in \{ 2, 3 \}$. [i](Radu Toma)[/i]

Let there's a function $ f: \mathbb{R}\rightarrow\mathbb{R}$ Find all functions $ f$ that satisfies: a) $ f(2u)\equal{}f(u\plus{}v)f(v\minus{}u)\plus{}f(u\minus{}v)f(\minus{}u\minus{}v)$ b) $ f(u)\geq0$

There are four circles. The chord$ AB$ is drawn in the first one, and the distance from the midpoint of the smaller of the two formed arcs to $AB$ is equal to $1$. The second, third and fourth circles are located inside the larger segment and touch the chord $AB$. The second and fourth circles touch internally the first and externally the third. The sum of the radii of the last three circles is equal to the radius of the first circle. Find the radius of the third circle if it is known that the line passing through the centers of the first and third circles is not parallel to the line passing through the centers of the other two circles.

In a triangle $ABC$ let $D$ be the intersection of the angle bisector of $\gamma$, angle at $C$, with the side $AB.$ And let $F$ be the area of the triangle $ABC.$ Prove the following inequality: \[2 \cdot \ F \cdot \left( \frac{1}{AD} -\frac{1}{BD} \right) \leq AB.\]

Ang, Ben, and Jasmin each have $5$ blocks, colored red, blue, yellow, white, and green; and there are $5$ empty boxes. Each of the people randomly and independently of the other two people places one of their blocks into each box. The probability that at least one box receives $3$ blocks all of the same color is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m + n ?$ $\textbf{(A)} ~47 \qquad\textbf{(B)} ~94 \qquad\textbf{(C)} ~227 \qquad\textbf{(D)} ~471 \qquad\textbf{(E)} ~542$

Given $19$ points in the plane with integer coordinates, no three collinear, show that we can always find three points whose centroid has integer coordinates.

The figure below shows line $\ell$ with a regular, infinite, recurring pattern of squares and line segments. [asy] size(300); defaultpen(linewidth(0.8)); real r = 0.35; path P = (0,0)--(0,1)--(1,1)--(1,0), Q = (1,1)--(1+r,1+r); path Pp = (0,0)--(0,-1)--(1,-1)--(1,0), Qp = (-1,-1)--(-1-r,-1-r); for(int i=0;i <= 4;i=i+1) { draw(shift((4*i,0)) * P); draw(shift((4*i,0)) * Q); } for(int i=1;i <= 4;i=i+1) { draw(shift((4*i-2,0)) * Pp); draw(shift((4*i-1,0)) * Qp); } draw((-1,0)--(18.5,0),Arrows(TeXHead)); [/asy] How many of the following four kinds of rigid motion transformations of the plane in which this figure is drawn, other than the identity transformation, will transform this figure into itself? [list] [*] some rotation around a point of line $\ell$ [*] some translation in the direction parallel to line $\ell$ [*] the reflection across line $\ell$ [*] some reflection across a line perpendicular to line $\ell$ [/list] $\textbf{(A) } 0 \qquad\textbf{(B) } 1 \qquad\textbf{(C) } 2 \qquad\textbf{(D) } 3 \qquad\textbf{(E) } 4$

Marine biologists are studying a new species of shellfish whose first generation consists of $100$ shellfish, and their colony reproduces as follows: if a given generation consists of $N$ shellfish (where $5\mid N$ always holds), they divide themselves into $N/5$ groups of $5$ shellfish each. Each group collectively produces $15$ offspring, who form the next generation. Some of the shellfish contain a pearl, but a shellfish can only contain a pearl if none of its direct ancestors contained a pearl. The value of a pearl is determined by the generation of the shellfish containing it: in the $n^{\mathrm{th}}$ generation, its value is $1/3^n$. Find the maximum possible total value of the pearls in the colony. [i]Proposed by: Csongor Beke, Cambridge[/i]

On the plane $S$ in a space, given are unit circle $C$ with radius 1 and the line $L$. Find the volume of the solid bounded by the curved surface formed by the point $P$ satifying the following condition $(a),\ (b)$. $(a)$ The point of intersection $Q$ of the line passing through $P$ and perpendicular to $S$ are on the perimeter or the inside of $C$. $(b)$ If $A,\ B$ are the points of intersection of the line passing through $Q$ and pararell to $L$, then $\overline{PQ}=\overline{AQ}\cdot \overline{BQ}$.

Let $a_1,a_2,a_3,a_4,a_5$ be distinct real numbers. Consider all sums of the form $a_i + a_j$ where $i,j \in \{1,2,3,4,5\}$ and $i \neq j$. Let $m$ be the number of distinct numbers among these sums. What is the smallest possible value of $m$?

Let $a,b,c$ natural numbers for which $a^2 + b^2 + c^2 = (a-b) ^2 + (b-c)^ 2 + (c-a) ^2$. Show that $ab, bc, ca$ and $ab + bc + ca$ are perfect squares .

Prove that if a positive integer $n$ divides the five-digit numbers $\overline{a_1a_2a_3a_4a_5}$, $\overline{b_1b_2b_3b_4b_5}$, $\overline{c_1c_2c_3c_4c_5}$, $\overline{d_1d_2d_3d_4d_5}$, $\overline{e_1e_2e_3e_4e_5}$, then it also divides the determinant $$D=\begin{vmatrix}a_1&a_2&a_3&a_4&a_5\\b_1&b_2&b_3&b_4&b_5\\c_1&c_2&c_3&c_4&c_5\\d_1&d_2&d_3&d_4&d_5\\e_1&e_2&e_3&e_4&e_5\end{vmatrix}.$$

Let $A$ be the set of all sequences from 0’s or 1’s with length 4. What’s the minimal number of sequences that can be chosen, so that an arbitrary sequence from $A$ differs at most in 1 position from one of the chosen?

Prove that for each $n \ge 4$ a parallelogram can be dissected in $n$ cyclic quadrilaterals.

A competition room of HOMC has $m \times n$ students where $m, n$ are integers larger than $2$. Their seats are arranged in $m$ rows and $n$ columns. Before starting the test, every student takes a handshake with each of his/her adjacent students (in the same row or in the same column). It is known that there are totally $27$ handshakes. Find the number of students in the room.

Let $m,n,a_1,a_2,\dots,a_n$ be positive integers and $r$ be a real number. Prove that the equation \[\lfloor a_1x\rfloor+\lfloor a_2x\rfloor+\cdots+\lfloor a_nx\rfloor=sx+r\] has exactly $ms$ solutions in $x$, where $s=a_1+a_2+\cdots+a_n+\frac1m$. [i]Linus Tang[/i]

Let $A$ consist of $16$ elements of the set $\{1, 2, 3,..., 106\}$, so that the difference of two arbitrary elements in $A$ are different from $6, 9, 12, 15, 18, 21$. Prove that there are two elements of $A$ for which their difference equals to $3$.