Given parallelogram $OABC$ in the coodinate with $O$ the origin and $A,B,C$ be lattice points. Prove that for all lattice point $P$ in the internal or boundary of $\triangle ABC$, there exists lattice points $Q,R$(can be the same) in the internal or boundary of $\triangle OAC$ with $\overrightarrow{OP}=\overrightarrow{OQ}+\overrightarrow{OR}$.

Let $ABCD$ and $A'B'C'D'$ be two arbitrary squares in the plane that are oriented in the same direction. Prove that the quadrilateral formed by the midpoints of $AA',BB',CC',DD'$ is a square.

In acute triangle $ABC$, $AB > AC$. $D$ and $E$ are the midpoints of $AB$, $AC$ respectively. The circumcircle of $ADE$ intersects the circumcircle of $BCE$ again at $P$. The circumcircle of $ADE$ intersects the circumcircle $BCD$ again at $Q$. Prove that $AP = AQ$.

Let $ ABCD $ be a sqare and $ E $ be a point situated on the segment $ BD, $ but not on the mid. Denote by $ H $ and $ K $ the orthocenters of $ ABE, $ respectively, $ ADE. $ Show that $ \overrightarrow{BH}=\overrightarrow{KD} . $

Given $1980$ vectors in the plane, and there are some non-collinear among them. The sum of every $1979$ vectors is collinear to the vector not included in that sum. Prove that the sum of all vectors equals to the zero vector.

Let $n$ be a positive integer number. If $S$ is a finite set of vectors in the plane, let $N(S)$ denote the number of two-element subsets $\{\mathbf{v}, \mathbf{v'}\}$ of $S$ such that \[4\,(\mathbf{v} \cdot \mathbf{v'}) + (|\mathbf{v}|^2 - 1)(|\mathbf{v'}|^2 - 1) < 0. \] Determine the maximum of $N(S)$ when $S$ runs through all $n$-element sets of vectors in the plane. [i]***[/i]

A particle moves on a circle with center $O$, starting from rest at a point $P$ and coming to rest again at a point $Q$, without coming to rest at any intermediate point. Prove that the acceleration vector of the particle does not vanish at any point between $P$ and $ Q$ and that, at some point $R$ between $P$ and $Q$, the acceleration vector points in along the radius $RO.$

A calculating ruler is a ruler for doing algebric calculations. This ruler has three arms, two of them are sationary and one can move freely right and left. Each of arms is gradient. Gradation of each arm depends on the algebric operation ruler does. For eaxample the ruler below is designed for multiplying two numbers. Gradations are logarithmic. [img]http://aycu05.webshots.com/image/5604/2000468517162383885_rs.jpg[/img] For working with ruler, (e.g for calculating $x.y$) we must move the middle arm that the arrow at the beginning of its gradation locate above the $x$ in the lower arm. We find $y$ in the middle arm, and we will read the number on the upper arm. The number written on the ruler is the answer. 1) Design a ruler for calculating $x^{y}$. Grade first arm ($x$) and ($y$) from 1 to 10. 2) Find all rulers that do the multiplication in the interval $[1,10]$. 3) Prove that there is not a ruler for calculating $x^{2}+xy+y^{2}$, that its first and second arm are grade from 0 to 10.

Let a convex polygon $H$ be given. Show that for every real number $a \in (0, 1)$ there exist 6 distinct points on the sides of $H$, denoted by $A_1, A_2, \ldots, A_6$ clockwise, satisfying the conditions: [b]I.[/b] $(A_1A_2) = (A_5A_4) = a \cdot (A_6A_3)$. [b]II.[/b] Lines $A_1A_2, A_5A_4$ are equidistant from $A_6A_3$. (By $(AB)$ we denote vector $AB$)

The points $S(i, j)$ with integer Cartesian coordinates $0 < i \leq n, 0 < j \leq m, m \leq n$, form a lattice. Find the number of: [b](a)[/b] rectangles with vertices on the lattice and sides parallel to the coordinate axes; [b](b)[/b] squares with vertices on the lattice and sides parallel to the coordinate axes; [b](c)[/b] squares in total, with vertices on the lattice.

Find the least $n\in N$ such that among any $n$ rays in space sharing a common origin there exist two which form an acute angle.

If $\overrightarrow{u_1},\overrightarrow{u_2}, ...,\overrightarrow{u_n}$ be vectors in the plane such that the sum of their lengths is at least $1$, then between them we find vectors whose sum is a vector of length at least $\sqrt2/8$. Prove it.

Given two sequences $x_n$ and $y_n$ defined by $x_0 = y_0 = 7$, \[x_n = 4x_{n-1}+3y_{n-1}, \text{ and}\]\[y_n = 3y_{n-1}+2x_{n-1},\] find $\lim_{n \to \infty} \frac{x_n}{y_n}$.

Prove that if a vector space is the union of some of it's proper subspaces, then number of these subspaces can not be less than the number of elements of the field of that vector space.

For each finite set $ U$ of nonzero vectors in the plane we define $ l(U)$ to be the length of the vector that is the sum of all vectors in $ U.$ Given a finite set $ V$ of nonzero vectors in the plane, a subset $ B$ of $ V$ is said to be maximal if $ l(B)$ is greater than or equal to $ l(A)$ for each nonempty subset $ A$ of $ V.$ (a) Construct sets of 4 and 5 vectors that have 8 and 10 maximal subsets respectively. (b) Show that, for any set $ V$ consisting of $ n \geq 1$ vectors the number of maximal subsets is less than or equal to $ 2n.$

Let $m,n$ be positive integers with $m \ge n$. Let $S$ be the set of pairs $(a,b)$ of relatively prime positive integers such that $a,b \le m$ and $a+b > m$. For each pair $(a,b)\in S$, consider the nonnegative integer solution $(u,v)$ to the equation $au - bv = n$ chosen with $v \ge 0$ minimal, and let $I(a,b)$ denote the (open) interval $(v/a, u/b)$. Prove that $I(a,b) \subseteq (0,1)$ for every $(a,b)\in S$, and that any fixed irrational number $\alpha\in(0,1)$ lies in $I(a,b)$ for exactly $n$ distinct pairs $(a,b)\in S$. [i]Victor Wang, inspired by 2013 ISL N7[/i]

Let $\alpha_{1}, \alpha_{2}, \cdots , \alpha_{n}$ be numbers in the interval $[0, 2\pi]$ such that the number $\displaystyle\sum_{i=1}^n (1 + \cos \alpha_{i})$ is an odd integer. Prove that \[\displaystyle\sum_{i=1}^n \sin \alpha_i \ge 1\]

A line that passes through the origin intersects both the line $x=1$ and the line $y=1+\frac{\sqrt{3}}{3}x$. The three lines create an equilateral triangle. What is the perimeter of the triangle? $ \textbf{(A) }2\sqrt{6}\qquad\textbf{(B) }2+2\sqrt{3}\qquad\textbf{(C) }6\qquad\textbf{(D) }3+2\sqrt{3}\qquad\textbf{(E) }6+\frac{\sqrt{3}}{3} $

Let $S$ be a set of $9$ distinct integers all of whose prime factors are at most $3.$ Prove that $S$ contains $3$ distinct integers such that their product is a perfect cube.

In a magic square $n \times n$ composed from the numbers $1,2,\cdots,n^2$, the centers of any two squares are joined by a vector going from the smaller number to the bigger one. Prove that the sum of all these vectors is zero. (A magic square is a square matrix such that the sums of entries in all its rows and columns are equal.)

In a convex pentagon $ABCDE$, the points $M$, $N$, $P$, $Q$, $R$ are the midpoints of the sides $AB$, $BC$, $CD$, $DE$, $EA$, respectively. If the segments $AP$, $BQ$, $CR$ and $DM$ pass through a single point, prove that $EN$ contains that point as well. [i]Yugoslavia[/i]

Suppose that $\displaystyle{{v_1},{v_2},...,{v_d}}$ are unit vectors in $\displaystyle{{{\Bbb R}^d}}$. Prove that there exists a unitary vector $\displaystyle{u}$ such that $\displaystyle{\left| {u \cdot {v_i}} \right| \leq \frac{1}{{\sqrt d }}}$ for $\displaystyle{i = 1,2,...,d}$. [b]Note.[/b] Here $\displaystyle{ \cdot }$ denotes the usual scalar product on $\displaystyle{{{\Bbb R}^d}}$. [i]Proposed by Tomasz Tkocz, University of Warwick.[/i]

Let $ p \ge 3$ be a prime number. The sequence $ \{a_{n}\}_{n \ge 0}$ is defined by $ a_{n}=n$ for all $ 0 \le n \le p-1$, and $ a_{n}=a_{n-1}+a_{n-p}$ for all $ n \ge p$. Compute $ a_{p^{3}}\; \pmod{p}$.

Let $a$ and $b$ be real numbers satisfying $2(\sin a + \cos a) \sin b = 3 - \cos b$. Find $3 \tan^2a+4\tan^2 b$.

Let $ K$ be a convex cone in the $ n$-dimensional real vector space $ \mathbb{R}^n$, and consider the sets $ A\equal{}K \cup (\minus{}K)$ and $ B\equal{}(\mathbb{R}^n \setminus A) \cup \{ 0 \}$ ($ 0$ is the origin). Show that one can find two subspaces in $ \mathbb{R}^n$ such that together they span $ \mathbb{R}^n$, and one of them lies in $ A$ and the other lies in $ B$. [i]J. Szucs[/i]