Let $S=\{a_1,a_2,\ldots,a_n\}$ of nenul vectors in a plane. Show that $S{}$ can be partitioned in nenul subsets $B_1, B_2,\ldots, B_m$ with the properties: 1) each vector from $S{}$ is part of only on subset; 2) if $a_i\in B_j$ then the angle between vectors $a_i$ and $c_j$, which is the sum of all vectors from $B_j$ is not greater than $\frac{\pi}{2}$; 3) if $i\neq j$ then the angle between vectors $c_i$ and $c_j$, which is the sum of all vectors from $B_i$ and $B_j$, respectively, is greater than $\frac{\pi}{2}$. What are the possible values of $m$?

A $15$-inch-long stick has four marks on it, dividing it into five segments of length $1,2,3, 4$, and $5$ inches (although not neccessarily in that order) to make a “ruler.” Here is an example. [img]https://cdn.artofproblemsolving.com/attachments/0/e/065d42b36083453f3586970125bedbc804b8a1.png[/img] Using this ruler, you could measure $8$ inches (between the marks $B$ and $D$) and $11$ inches (between the end of the ruler at $A$ and the mark at $E$), but there’s no way you could measure $12$ inches. Prove that it is impossible to place the four marks on the stick such that the five segments have length $1,2,3, 4$, and $5$ inches, and such that every integer distance from $1$ inch through $15$ inches could be measured.

In how many ways can the letters in BEEKEEPER be rearranged so that two or more Es do not appear together? $\textbf{(A)} ~1\qquad\textbf{(B)} ~4\qquad\textbf{(C)} ~12\qquad\textbf{(D)} ~24\qquad\textbf{(E)} ~120\qquad$

Let $N_0$ be the set of all non-negative integers. Let $f : N_0 \times N_0 \to N_0$ be a function such that for all non-negative integers $a,b$: $$f(a,b) = f(b,a),$$ $$f(a,0) = 0,$$ $$f(a+b,b) = f(a,b) +b.$$ Compute $$\sum_{i=0}^{30}\sum_{j=0}^{2^i-1}f(2^i, j)$$

Let $A_1A_2A_3...A_{72}$ be a regurar $72$-gon with center $O$. Calculate an extenral angle of that polygon and the angles $\angle A_{45} OA_{46}$, $\angle A_{44} A_{45}A_{46}$. How many diagonals does this polygon have?

Let $ABF$ be a right-angled triangle with $\angle AFB = 90$, a square $ABCD$ is externally to the triangle. If $FA = 6$, $FB = 8$ and $E$ is the circumcenter of the square $ABCD$, determine the value of $EF$

Let $ABC$ be an isosceles triangle ($AB=AC$). The altitude $AH$ and the perpendiculare bisector $(e)$ of side $AB$ intersect at point $M$ . The perpendicular on line $(e)$ passing through $M$ intersects $BC$ at point $D$. If the circumscribed circle of the triangle $BMD$ intersects line $(e)$ at point $S$ , the prove that: a) $BS // AM$ . b) quadrilateral $AMBS$ is rhombus.

All of Marcy's marbles are blue, red, green, or yellow. One third of her marbles are blue, one fourth of them are red, and six of them are green. What is the smallest number of yellow marbles that Marcy could have? $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Let $S=\{1,2,...,100\}$ . Find number of functions $f: S\to S$ satisfying the following conditions a)$f(1)=1$ b)$f$ is bijective c)$f(n)=f(g(n))f(h(n))\forall n\in S$, where $g(n),h(n)$ are positive integer numbers such that $g(n)\leq h(n),n=g(n)h(n)$ that minimize $h(n)-g(n)$.

A rectangular array has $m$ rows and $n$ columns, where $m < n$. Some cells of the array contain stars, in such a way that there is at least one star in each column. Prove that there is at least one such star such that the row containing it has more stars than the column containing it. (A. Razborov, Moscow)

Let $AH$ be an altitude of an acute-angled triangle $ABC$. Points $K$ and $L$ are the projections of $H$ onto sides $AB$ and $AC$. The circumcircle of $ABC$ meets line $KL$ at points $P$ and $Q$, and meets line $AH$ at points $A$ and $T$. Prove that $H$ is the incenter of triangle $PQT$. (M.Plotnikov)

Let $a_1,a_2,a_3,\dots$ be a sequence of real numbers satisfying the inequality \[ |a_{k+m}-a_k-a_m| \leq 1 \quad \text{for all} \ k,m \in \mathbb{Z}_{>0}. \] Show that the following inequality holds for all positive integers $k,m$ \[ \left| \frac{a_k}{k}-\frac{a_m}{m} \right| < \frac{1}{k}+\frac{1}{m}. \]

Let $ABCD$ be a parallelogram in which angle at $B$ is obtuse and $AD>AB$. Points $K$ and $L$ on $AC$ such that $\angle ADL=\angle KBA$(the points $A, K, C, L$ are all different, with $K$ between $A$ and $L$). The line $BK$ intersects the circumcircle $\omega$ of $ABC$ at points $B$ and $E$, and the line $EL$ intersects $\omega$ at points $E$ and $F$. Prove that $BF||AC$.

In this diagram $AB$ and $AC$ are the equal sides of an isosceles triangle $ABC$, in which is inscribed equilateral triangle $DEF$. Designate angle $BFD$ by $a$, angle $ADE$ by $b$, and angle $FEC$ by $c$. Then: [asy] size(150); defaultpen(linewidth(0.8)+fontsize(10)); pair A=(5,12),B=origin,C=(10,0),D=(5/3,4),E=(10-5*.45,12*.45),F=(6,0); draw(A--B--C--cycle^^D--E--F--cycle); draw(anglemark(E,D,A,1,45)^^anglemark(F,E,C,1,45)^^anglemark(D,F,B,1,45)); label("$b$",(D.x+.2,D.y+.25),dir(30)); label("$c$",(E.x,E.y-.4),S); label("$a$",(F.x-.4,F.y+.1),dir(150)); label("$A$",A,N); label("$B$",B,S); label("$C$",C,S); label("$D$",D,dir(150)); label("$E$",E,dir(60)); label("$F$",F,S);[/asy] $ \textbf{(A)}\ b=\frac{a+c}{2}\qquad\textbf{(B)}\ b=\frac{a-c}{2}\qquad$ $\textbf{(C)}\ a=\frac{b-c}{2} \qquad\textbf{(D)}\ a=\frac{b+c}{2}\qquad$ $\textbf{(E)}\ \text{none of these} $

Let $a$, $b$, $c$ be positive integers and $p$ be a prime number. Assume that \[ a^n(b+c)+b^n(a+c)+c^n(a+b)\equiv 8\pmod{p} \] for each nonnegative integer $n$. Let $m$ be the remainder when $a^p+b^p+c^p$ is divided by $p$, and $k$ the remainder when $m^p$ is divided by $p^4$. Find the maximum possible value of $k$. [i]Proposed by Justin Stevens and Evan Chen[/i]

Alice, Bob, Cindy, David, and Emily sit in a circle. Alice refuses to sit to the right of Bob, and Emily sits next to Cindy. If David sits next to two girls, determine who could sit immediately to the right of Alice.

Show that no one $n$-th root of a rational (for $n$ a positive integer) can be a root of the polynomial $x^5 - x^4 - 4x^3 + 4x^2 + 2$.

Find all the real numbers $k$ that have the following property: For any non-zero real numbers $a$ and $b$, it is true that at least one of the following numbers: $$a, b,\frac{5}{a^2}+\frac{6}{b^3}$$is less than or equal to $k$.

Find all real $\alpha,\beta$ such that the following limit exists and is finite: \[\lim_{x,y\rightarrow 0^{+}}\frac{x^{2\alpha}y^{2\beta}}{x^{2\alpha}+y^{3\beta}}\]

Let $\vartriangle ABC$ be a triangle, and let $C_0, B_0$ be the feet of perpendiculars from $C$ and $B$ onto $AB$ and $AC$ respectively. Let $\Gamma$ be the circumcircle of $\vartriangle ABC$. Let E be a point on the $\Gamma$ such that $AE \perp BC$. Let $M$ be the midpoint of $BC$ and let $G$ be the second intersection of EM and $\Gamma$. Let $T$ be a point on $\Gamma$ such that $T G$ is parallel to $BC$. Prove that $T, A, B_0, C_0$ are concyclic.

Can the equation $f(g(h(x))) = 0$, where $f$, $g$, $h$ are quadratic polynomials, have the solutions $1, 2, 3, 4, 5, 6, 7, 8$? [i]S. Tokarev[/i]

How many polynomials $P$ of integer coefficients and degree at most $4$ satisfy $0 \le P(x) < 72$ for all $x\in \{0, 1, 2, 3, 4\}$? Harvard-MIT Mathematics Tournament 2011

Show that \[ abc \geq (a+b-c)(b+c-a)(c+a-b) \] for positive reals $a$, $b$, $c$.

Let $ABC$ be a triangle. The points $K, L,$ and $M$ lie on the segments $BC, CA,$ and $AB,$ respectively, such that the lines $AK, BL,$ and $CM$ intersect in a common point. Prove that it is possible to choose two of the triangles $ALM, BMK,$ and $CKL$ whose inradii sum up to at least the inradius of the triangle $ABC$. [i]Proposed by Estonia[/i]

Let $ABC$ be a triangle with $H$ its orthocenter. The circle with diameter $[AC]$ cuts the circumcircle of triangle $ABH$ at $K$. Prove that the point of intersection of the lines $CK$ and $BH$ is the midpoint of the segment $[BH]$