Prove that the arithmetic mean $a$ of $x_1,\ldots ,x_n$ satisfies \[ (x_1-a)^2+\ldots +(x_n-a)^2\le \frac{1}{2}(|x_1-a|+\ldots +|x_n-a|)^2\]

Find all positive integers $m$ and $n$ for which \[1!+2!+3!+\cdots+n!=m^{2}\]

Show that the sum of the first $n$ terms in the binomial expansion of $(2-1)^{-n}$ is $\frac{1}{2},$ where $n$ is a positive integer.

Let $n_{1}, \cdots, n_{k}$ and $a$ be positive integers which satify the following conditions:[list][*] for any $i \neq j$, $(n_{i}, n_{j})=1$, [*] for any $i$, $a^{n_{i}} \equiv 1 \pmod{n_i}$, [*] for any $i$, $n_{i}$ does not divide $a-1$. [/list] Show that there exist at least $2^{k+1}-2$ integers $x>1$ with $a^{x} \equiv 1 \pmod{x}$.

The base of a pyramid is a regular triangle having side of size $1$. Two of three angles at the vertex of the pyramid are right. Find the maximum value of the volume of the pyramid.

I define a "good day" as a day when both the day and the month evenly divide the concatenation of the two. For example, today (March $15$) is a good day since $3$ and $15$ both divide $315.$ However, March $9$ is not a good day since $9$ does not divide $39.$ How many good days are in March, April, and May combined?

Let $N=\overline{abc}$ be a three-digit number. It is known that we can construct an isoceles triangle with $a,b$ and $c$ as the length of sides. Determine how many possible three-digit number $N$ there are. ($N=\overline{abc}$ means that $a,b$ and $c$ are digits of $N$, and not $N=a\times b\times c$.)

Determine all positive integers $M$ such that the sequence $a_0, a_1, a_2, \cdots$ defined by \[ a_0 = M + \frac{1}{2} \qquad \textrm{and} \qquad a_{k+1} = a_k\lfloor a_k \rfloor \quad \textrm{for} \, k = 0, 1, 2, \cdots \] contains at least one integer term.

A terrain ( $ABCD$ ) has a rectangular trapezoidal shape. The angle in $A$ measures $90^o$. $AB$ measures $30$ m, $AD$ measures $20$ m and $DC$ measures 45 m. This land must be divided into two areas of the same area, drawing a parallel to the $AD$ side . At what distance from $D$ do we have to draw the parallel? [img]https://1.bp.blogspot.com/-DnyNY3x4XKE/XNYvRUrLVTI/AAAAAAAAKLE/gohd7_S9OeIi-CVUVw-iM63uXE5u-WmGwCK4BGAYYCw/s400/image002.gif[/img]

A triangle is partitioned into three triangles and a quadrilateral by drawing two lines from vertices to their opposite sides. The areas of the three triangles are 3, 7, and 7, as shown. What is the area of the shaded quadrilateral? [asy] unitsize(1.5cm); defaultpen(.8); pair A = (0,0), B = (3,0), C = (1.4, 2), D = B + 0.4*(C-B), Ep = A + 0.3*(C-A); pair F = intersectionpoint( A--D, B--Ep ); draw( A -- B -- C -- cycle ); draw( A -- D ); draw( B -- Ep ); filldraw( D -- F -- Ep -- C -- cycle, mediumgray, black ); label("$7$",(1.25,0.2)); label("$7$",(2.2,0.45)); label("$3$",(0.45,0.35));[/asy] $ \textbf{(A) }15\qquad\textbf{(B) }17\qquad\textbf{(C) }\frac{35}{2}\qquad\textbf{(D) }18\qquad\textbf{(E) }\frac{55}{3} $

How many five-card hands from a standard deck of $52$ cards are full houses? A full house consists of $3$ cards of one rank and $2$ cards of another rank.

Let $x, y$ be positive real numbers. Find the minimum of $$x^2 + xy +\frac{y^2}{2}+\frac{2^6}{x + y}+\frac{3^4}{x^3}$$

As shown in the figure below, the in-circle of $ABC$ is tangent to sides $AB$ and $AC$ at $D$ and $E$ respectively, and $O$ is the circumcenter of $BCI$. Prove that $\angle ODB = \angle OEC$. [asy]import graph; size(5.55cm); pathpen=linewidth(0.7); pointpen=black; pen fp=fontsize(10); pointfontpen=fp; real xmin=-5.76,xmax=4.8,ymin=-3.69,ymax=3.71; pen zzttqq=rgb(0.6,0.2,0), wwwwqq=rgb(0.4,0.4,0), qqwuqq=rgb(0,0.39,0); pair A=(-2,2.5), B=(-3,-1.5), C=(2,-1.5), I=(-1.27,-0.15), D=(-2.58,0.18), O=(-0.5,-2.92); D(A--B--C--cycle,zzttqq); D(arc(D,0.25,-104.04,-56.12)--(-2.58,0.18)--cycle,qqwuqq); D(arc((-0.31,0.81),0.25,-92.92,-45)--(-0.31,0.81)--cycle,qqwuqq); D(A--B,zzttqq); D(B--C,zzttqq); D(C--A,zzttqq); D(CR(I,1.35),linewidth(1.2)+dotted+wwwwqq); D(CR(O,2.87),linetype("2 2")+blue); D(D--O); D((-0.31,0.81)--O); D(A); D(B); D(C); D(I); D(D); D((-0.31,0.81)); D(O); MP( "A", A, dir(110)); MP("B", B, dir(140)); D("C", C, dir(20)); D("D", D, dir(150)); D("E", (-0.31, 0.81), dir(60)); D("O", O, dir(290)); D("I", I, dir(100)); clip((xmin,ymin)--(xmin,ymax)--(xmax,ymax)--(xmax,ymin)--cycle); [/asy]

Prove that there is not a positive integer $n$ such that numbers $(n+1)2^n, (n+3)2^{n+2}$ are both perfect squares.

Let $ABC$ be a scalene triangle, and let $I$ be its incenter. A point $D$ is chosen on line $BC$, such that the circumcircle of triangle $BID$ intersects $AB$ at $E\neq B$, and the circumcircle of triangle $CID$ intersects $AC$ at $F\neq C$. Circumcircle of triangle $EDF$ intersects $AB$ and $AC$ at $M$ and $N$, respectively. Lines $FD$ and $IC$ intersect at $Q$, and lines $ED$ and $BI$ intersect at $P$. Prove that $EN\parallel MF\parallel PQ$.

For a real number $ a$, let $ \lfloor a \rfloor$ denominate the greatest integer less than or equal to $ a$. Let $ \mathcal{R}$ denote the region in the coordinate plane consisting of points $ (x,y)$ such that \[\lfloor x \rfloor ^2 \plus{} \lfloor y \rfloor ^2 \equal{} 25.\] The region $ \mathcal{R}$ is completely contained in a disk of radius $ r$ (a disk is the union of a circle and its interior). The minimum value of $ r$ can be written as $ \tfrac {\sqrt {m}}{n}$, where $ m$ and $ n$ are integers and $ m$ is not divisible by the square of any prime. Find $ m \plus{} n$.

Let $A = \{1,2,3, . . . ,11\}$. How many subsets $B$ of $A$ are there, such that for each $n\in \{1,2, . . . ,8\}$, if $n$ and $n+2$ are in $B$ then at least one of the numbers $ n+1$ and $n+3$ is also in $B$?

Let $ABC$ be a triangle with orthocenter $H,$ and let $M$ be the midpoint of $\overline{BC}.$ Suppose that $P$ and $Q$ are distinct points on the circle with diameter $\overline{AH},$ different from $A,$ such that $M$ lies on line $PQ.$ Prove that the orthocenter of $\triangle APQ$ lies on the circumcircle of $\triangle ABC.$ [i]Proposed by Michael Ren[/i]

Two people play a game as follows: At the beginning both of them have one point and in every move, one of them can double it's points, or when the other have more point than him, subtract to him his points. Can the two competitors have 2009 and 2002 points respectively? What about 2009 and 2003? Generally which couples of points can they have?

A team of four students goes to LMT, and each student brings a lunch. However, on the bus, the students’ lunches get mixed up, and during lunch time, each student chooses a random lunch to eat (no two students may eat the same lunch). What is the probability that each student chooses his or her own lunch correctly?

Find the smallest possible number of edges in a convex polyhedron that has an odd number of edges in total has an even number of edges on each face.

On hypotenuse $ AB$ of a right triangle $ ABC$ a second right triangle $ ABD$ is constructed with hypotenuse $ AB$. If $ \overline{BC} \equal{} 1, \overline{AC} \equal{} b$, and $ \overline{AD} \equal{} 2$, then $ \overline{BD}$ equals: $ \textbf{(A)}\ \sqrt {b^2 \plus{} 1} \qquad\textbf{(B)}\ \sqrt {b^2 \minus{} 3} \qquad\textbf{(C)}\ \sqrt {b^2 \plus{} 1} \plus{} 2$ $ \textbf{(D)}\ b^2 \plus{} 5 \qquad\textbf{(E)}\ \sqrt {b^2 \plus{} 3}$

A cyclist travels at a constant speed of $\text{22.0 km/hr}$ except for a $20$ minute stop. The cyclist’s average speed was $\text{17.5 km/hr}$. How far did the cyclist travel? (A) $\text{28.5 km}$ (B) $\text{30.3 km}$ (C) $\text{31.2 km}$ (D) $\text{36.5 km}$ (E) $\text{38.9 km}$

Let $A$ and $B$ be two distinct points in the plane. Let $M$ be the midpoint of the segment $AB$, and let $\omega$ be a circle that goes through $A$ and $M$. Let $T$ be a point on $\omega$ such that the line $BT$ is tangent to $\omega$. Let $X$ be a point (other than $B$) on the line $AB$ such that $TB = TX$, and let $Y$ be the foot of the perpendicular from $A$ onto the line $BT$. Prove that the lines $AT$ and $XY$ are parallel. [i]Navneel Singhal, India[/i]

We call a set of positive integers [i]suitable [/i] if none of its elements is coprime to the sum of all elements of that set. Given a real number $\varepsilon \in (0,1)$, prove that, for all large enough positive integers $N$, there exists a suitable set of size at least $\varepsilon N$, each element of which is at most $N$.