A sequence of positive integers with $n$ terms satisfies $\sum_{i=1}^{n} a_i=2007$. Find the least positive integer $n$ such that there exist some consecutive terms in the sequence with their sum equal to $30$.

A square plate has side length $L$ and negligible thickness. It is laid down horizontally on a table and is then rotating about the axis $\overline{MN}$ where $M$ and $N$ are the midpoints of two adjacent sides of the square. The moment of inertia of the plate about this axis is $kmL^2$, where $m$ is the mass of the plate and $k$ is a real constant. Find $k$. [color=red]Diagram will be added to this post very soon. If you want to look at it temporarily, see the PDF.[/color] [i]Problem proposed by Ahaan Rungta[/i]

Given a straight line $\ell$ and the point $O$ out of the line. Prove that it is possible to move an arbitrary point $A$ in the same plane to the $O$ point, using only rotations around $O$ and symmetry with respect to the $\ell$.

Walking down Jane Street, Ralph passed four houses in a row, each painted a different color. He passed the orange house before the red house, and he passed the blue house before the yellow house. The blue house was not next to the yellow house. How many orderings of the colored houses are possible? ${ \textbf{(A)}\ 2\qquad\textbf{(B)}\ 3\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}}\ 5\qquad\textbf{(E)}\ 6$

The game of circulate is played with a deck of $kn$ cards each with a number in $1,2,\ldots,n$ such that there are $k$ cards with each number. First, $n$ piles numbered $1,2,\ldots,n$ of $k$ cards each are dealt out face down. The player then flips over a card from pile $1$, places that card face up at the bottom of the pile, then next flips over a card from the pile whose number matches the number on the card just flipped. The player repeats this until he reaches a pile in which every card has already been flipped and wins if at that point every card has been flipped. Hamster has grown tired of losing every time, so he decides to cheat. He looks at the piles beforehand and rearranges the $k$ cards in each pile as he pleases. When can Hamster perform this procedure such that he will win the game? [i]Brian Hamrick.[/i]

The keystone arch is an ancient architectural feature. It is composed of congruent isosceles trapezoids fitted together along the non-parallel sides, as shown. The bottom sides of the two end trapezoids are horizontal. In an arch made with $ 9$ trapezoids, let $ x$ be the angle measure in degrees of the larger interior angle of the trapezoid. What is $ x$? [asy]unitsize(4mm); defaultpen(linewidth(.8pt)); int i; real r=5, R=6; path t=r*dir(0)--r*dir(20)--R*dir(20)--R*dir(0); for(i=0; i<9; ++i) { draw(rotate(20*i)*t); } draw((-r,0)--(R+1,0)); draw((-R,0)--(-R-1,0));[/asy]$ \textbf{(A)}\ 100 \qquad \textbf{(B)}\ 102 \qquad \textbf{(C)}\ 104 \qquad \textbf{(D)}\ 106 \qquad \textbf{(E)}\ 108$

The isosceles right triangle $ABC$ has right angle at $C$ and area $12.5$. The rays trisecting $\angle{ACB}$ intersect $AB$ at $D$ and $E$. What is the area of $\triangle{CDE}$? $\textbf{(A) }\frac{5\sqrt{2}}{3}\qquad\textbf{(B) }\frac{50\sqrt{3}-75}{4}\qquad\textbf{(C) }\frac{15\sqrt{3}}{8}\qquad\textbf{(D) }\frac{50-25\sqrt{3}}{2}\qquad\textbf{(E) }\frac{25}{6}$

Find the mathematical expectation of the area of the projection of a cube with edge of length $1$ onto a plane with an isotropically distributed random direction of projection.

The quadrilateral ABCD is inscribed in a circle which has diameter BD. Points A’ and B’ are symmetric to A and B with respect to the line BD and AC respectively. If the lines A’C, BD intersect at P and AC, B’D intersect at Q, prove that PQ is perpendicular to AC.

The quadrilateral $ ABCD$ inscribed in a circle wich has diameter $ BD$. Let $ A',B'$ are symmetric to $ A,B$ with respect to the line $ BD$ and $ AC$ respectively. If $ A'C \cap BD \equal{} P$ and $ AC\cap B'D \equal{} Q$ then prove that $ PQ \perp AC$

How many rearrangements of $abcd$ are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either $ab$ or $ba$. $ \textbf{(A) }0\qquad\textbf{(B) }1\qquad\textbf{(C) }2\qquad\textbf{(D) }3\qquad\textbf{(E) }4 $

An isosceles triangle with $AB=AC$ has an inscribed circle $O$, which touches its sides $BC,CA,AB$ at $K,L,M$ respectively. The lines $OL$ and $KM$ intersect at $N$; the lines $BN$ and $CA$ intersect at $Q$. Let $P$ be the foot of the perpendicular from $A$ on $BQ$. Suppose that $BP=AP+2\cdot PQ$. Then, what values can the ratio $\frac{AB}{BC}$ assume?

Find the greatest natural number $N$ such that, for any arrangement of the numbers $1, 2, \ldots, 400$ in a chessboard $20 \times 20$, there exist two numbers in the same row or column, which differ by at least $N.$

In a group of $m$ girls and $n$ boys, any two persons either know each other or do not know each other. For any two boys and any two girls, there are at least one boy and one girl among them,who do not know each other. Prove that the number of unordered pairs of (boy, girl) who know each other does not exceed $m+\frac{n(n-1)}{2}$.

What is the minimum number of small squares that must be colored black so that a line of symmetry lies on the diagonal $ \overline{BD}$ of square $ ABCD$? [asy]defaultpen(linewidth(1)); for ( int x = 0; x &lt; 5; ++x ) { draw((0,x)--(4,x)); draw((x,0)--(x,4)); } fill((1,0)--(2,0)--(2,1)--(1,1)--cycle); fill((0,3)--(1,3)--(1,4)--(0,4)--cycle); fill((2,3)--(4,3)--(4,4)--(2,4)--cycle); fill((3,1)--(4,1)--(4,2)--(3,2)--cycle); label("$A$", (0, 4), NW); label("$B$", (4, 4), NE); label("$C$", (4, 0), SE); label("$D$", (0, 0), SW);[/asy] $ \textbf{(A)}\ 1\qquad\textbf{(B)}\ 2\qquad\textbf{(C)}\ 3\qquad\textbf{(D)}\ 4\qquad\textbf{(E)}\ 5 $

Find all pair of positive integers $(x, y)$ satisfying the equation \[x^2 + y^2 - 5 \cdot x \cdot y + 5 = 0.\]

2-There is given a trapezoid $ ABCD$.We have the following properties:$ AD\parallel{}BC,DA \equal{} DB \equal{} DC,\angle BCD \equal{} 72^\circ$. A point $ K$ is taken on $ BD$ such that $ AD \equal{} AK,K \neq D$.Let $ M$ be the midpoint of $ CD$.$ AM$ intersects $ BD$ at $ N$.PROVE $ BK \equal{} ND$.

(M.Volchkevich, 9--11) Given two circles and point $ P$ not lying on them. Draw a line through $ P$ which cuts chords of equal length from these circles.

Inside the triangle $ ABC $ a point $ M $ is given. The line $ BM $ meets the side $ AC $ at $ N $. The point $ K $ is symmetrical to $ M $ with respect to $ AC $. The line $ BK $ meets $ AC $ at $ P $. If $ \angle AMP = \angle CMN $, prove that $ \angle ABP=\angle CBN $.

Find all integers $a,b,c,x,y,z$ such that \[a+b+c=xyz, \; x+y+z=abc, \; a \ge b \ge c \ge 1, \; x \ge y \ge z \ge 1.\]

Let $ \Gamma(I,r)$ and $ \Gamma(O,R)$ denote the incircle and circumcircle, respectively, of a triangle $ ABC$. Consider all the triangels $ A_iB_iC_i$ which are simultaneously inscribed in $ \Gamma(O,R)$ and circumscribed to $ \Gamma(I,r)$. Prove that the centroids of these triangles are concyclic.

Determine all real solutions of the system \begin{align*} x+y+z &=3, \\ \frac1x+\frac1y+\frac1z &= \frac{5}{12}, \\ x^3+y^3+z^3 &=45. \end{align*}

Consider a $2n \times 2n$ board. From the $i$th line we remove the central $2(i-1)$ unit squares. What is the maximal number of rectangles $2 \times 1$ and $1 \times 2$ that can be placed on the obtained figure without overlapping or getting outside the board?

For $m\ge 3,$ a list of $\binom m3$ real numbers $a_{ijk}$ $(1\le i<j<k\le m)$ is said to be [i]area definite[/i] for $\mathbb{R}^n$ if the inequality \[\sum_{1\le i<j<k\le m}a_{ijk}\cdot\text{Area}(\triangle A_iA_jA_k)\ge0\] holds for every choice of $m$ points $A_1,\dots,A_m$ in $\mathbb{R}^n.$ For example, the list of four numbers $a_{123}=a_{124}=a_{134}=1, a_{234}=-1$ is area definite for $\mathbb{R}^2.$ Prove that if a list of $\binom m3$ numbers is area definite for $\mathbb{R}^2,$ then it is area definite for $\mathbb{R}^3.$

Hexagon $ABCDEF$ is divided into four rhombuses, $\mathcal{P, Q, R, S,}$ and $\mathcal{T,}$ as shown. Rhombuses $\mathcal{P, Q, R,}$ and $\mathcal{S}$ are congruent, and each has area $\sqrt{2006}$. Let $K$ be the area of rhombus $\mathcal{T}$. Given that $K$ is a positive integer, find the number of possible values for $K$. [asy] size(150);defaultpen(linewidth(0.7)+fontsize(10)); draw(rotate(45)*polygon(4)); pair F=(1+sqrt(2))*dir(180), C=(1+sqrt(2))*dir(0), A=F+sqrt(2)*dir(45), E=F+sqrt(2)*dir(-45), B=C+sqrt(2)*dir(180-45), D=C+sqrt(2)*dir(45-180); draw(F--(-1,0)^^C--(1,0)^^A--B--C--D--E--F--cycle); pair point=origin; label("$A$", A, dir(point--A)); label("$B$", B, dir(point--B)); label("$C$", C, dir(point--C)); label("$D$", D, dir(point--D)); label("$E$", E, dir(point--E)); label("$F$", F, dir(point--F)); label("$\mathcal{P}$", intersectionpoint( A--(-1,0), F--(0,1) )); label("$\mathcal{S}$", intersectionpoint( E--(-1,0), F--(0,-1) )); label("$\mathcal{R}$", intersectionpoint( D--(1,0), C--(0,-1) )); label("$\mathcal{Q}$", intersectionpoint( B--(1,0), C--(0,1) )); label("$\mathcal{T}$", point); dot(A^^B^^C^^D^^E^^F);[/asy]