Prove that the product of five consecutive positive integers cannot be the square of an integer.

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.

Two sequences of nonzero reals $a_1, a_2, a_3, \dots$ and $b_2, b_3, \dots$ are such that $b_n=\prod_{i=1}^{n} a_i$ and $a_n=\frac{b_n^2}{3b_n-3}$ for all integers $n > 1$. Given that $a_1=\frac{1}{2}$, find $\lvert b_{60}\rvert$. [i]Proposed by Andrew Zhao[/i]

Consider a matrix of size $n\times n$ whose entries are real numbers of absolute value not exceeding $1$. The sum of all entries of the matrix is $0$. Let $n$ be an even positive integer. Determine the least number $C$ such that every such matrix necessarily has a row or a column with the sum of its entries not exceeding $C$ in absolute value. [i]Proposed by Marcin Kuczma, Poland[/i]

Let $n$ be a positive integer. A $corner$ is a finite set $S$ of ordered $n$-tuples of positive integers such that if $a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n$ are positive integers with $a_k \geq b_k$ for $k = 1, 2, \ldots, n$ and $(a_1, a_2, \ldots, a_n) \in S$, then $(b_1, b_2, \ldots, b_n) \in S$. Prove that among any infinite collection of corners, there exist two corners, one of which is a subset of the other one.

Given are real numbers $a_1, a_2, \ldots, a_n$ ($n>3$), such that $a_k^3=a_{k+1}^2+a_{k+2}^2+a_{k+3}^2$ for all $k=1,2,...,n$. Prove that all numbers are equal.

Let $ x,y\in\mathbb{R}$ , and $ x,y \in $ $ \left(0,\frac{\pi}{2}\right) $, and $ m \in \left(2,+\infty\right) $ such that $ \tan x * \tan y = m $ . Find the minimum value of the expression $ E(x,y) = \cos x + \cos y $.

Consider the sequence $a(n)$ defined by the following conditions:$$a(1) = 1\,\,\,\, a(n + 1) = a(n) + [\sqrt{a(n)}] \,\,\, , \,\,\,\, n = 1,2,3,...$$ How many perfect squares no greater in value than $1000 000$ will be found among the first terms of the sequence? ( (Note: $[x]$ means the integer part of $x$, that is the greatest integer not greater than $x$.) (A Andjans)

For some integer $m$, the polynomial $x^3-2011x+m$ has the three integer roots $a$, $b$, and $c$. Find $|a|+|b|+|c|$.

In tetrahedron $ABCD$, the volume of tetrahedron $ABCD$ is $\frac{1}{6}$, and $\angle ACB=45^{\circ},AD+BC+\frac{AC}{\sqrt2}=3$, then $CD=$________.

On a rectangular board $100 \times 300$, two people take turns coloring the cells that have not yet been colored. The first one colors cells in yellow, and the second one in blue. Coloring is completed when every cell of the board is colored. A [i]connected sequence[/i] of cells is a sequence of cells in which every two consecutive cells share a common side (and all cells in the sequence are different). Consider all possible connected sequences of yellow cells. The result of the first player is the number of cells in the connected sequence of yellow cells of maximum length. The first player's goal is to maximize the result, and the second player's goal is to make the first player's result as small as possible. Prove that if each player tries to achieve his goal, the result of the first player will be no more than $200$. [i]Proposed by Mykhailo Shtandenko and Fedir Yudin[/i]

Let $(k_i)$ be a sequence of unique nonzero integers such that $x^2- 5x + k_i$ has rational solutions. Find the minimum possible value of $$\frac15 \sum_{i=1}^{\infty} \frac{1}{k_i}$$

The diagram below shows the circular face of a clock with radius $20$ cm and a circular disk with radius $10$ cm externally tangent to the clock face at $12$ o'clock. The disk has an arrow painted on it, initially pointing in the upward vertical direction. Let the disk roll clockwise around the clock face. At what point on the clock face will the disk be tangent when the arrow is next pointing in the upward vertical direction? [asy] size(170); defaultpen(linewidth(0.9)+fontsize(13pt)); draw(unitcircle^^circle((0,1.5),0.5)); path arrow = origin--(-0.13,-0.35)--(-0.06,-0.35)--(-0.06,-0.7)--(0.06,-0.7)--(0.06,-0.35)--(0.13,-0.35)--cycle; for(int i=1;i<=12;i=i+1) { draw(0.9*dir(90-30*i)--dir(90-30*i)); label("$"+(string) i+"$",0.78*dir(90-30*i)); } dot(origin); draw(shift((0,1.87))*arrow); draw(arc(origin,1.5,68,30),EndArrow(size=12));[/asy] $ \textbf{(A) }\text{2 o'clock} \qquad\textbf{(B) }\text{3 o'clock} \qquad\textbf{(C) }\text{4 o'clock} \qquad\textbf{(D) }\text{6 o'clock} \qquad\textbf{(E) }\text{8 o'clock} $

There are $2025$ people and $66$ colors, where each person has one ball of each color. For each person, their $66$ balls have positive mass summing to one. Find the smallest constant $C$ such that regardless of the mass distribution, each person can choose one ball such that the sum of the chosen balls of each color does not exceed $C$.

Find the minimum value of $ \int_0^{\frac{\pi}{2}} |x\sin t\minus{}\cos t|\ dt\ (x>0).$