This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 560

2010 Romania Team Selection Test, 3

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]

2006 All-Russian Olympiad, 3

On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins. Which player has a winning strategy?

2006 Tuymaada Olympiad, 3

From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/i]

MathLinks Contest 7th, 1.3

We are given the finite sets $ X$, $ A_1$, $ A_2$, $ \dots$, $ A_{n \minus{} 1}$ and the functions $ f_i: \ X\rightarrow A_i$. A vector $ (x_1,x_2,\dots,x_n)\in X^n$ is called [i]nice[/i], if $ f_i(x_i) \equal{} f_i(x_{i \plus{} 1})$, for each $ i \equal{} 1,2,\dots,n \minus{} 1$. Prove that the number of nice vectors is at least \[ \frac {|X|^n}{\prod\limits_{i \equal{} 1}^{n \minus{} 1} |A_i|}. \]

2014 China Girls Math Olympiad, 6

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$.

2004 IMC, 4

For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).

2000 Saint Petersburg Mathematical Olympiad, 11.2

Point $O$ is the origin of a space. Points $A_1, A_2,\dots, A_n$ have nonnegative coordinates. Prove the following inequality: $$|\overrightarrow{OA_1}|+|\overrightarrow {OA_2}|+\dots+|\overrightarrow {OA_n}|\leq \sqrt{3}|\overrightarrow {OA_1}+\overrightarrow{OA_2}+\dots+\overrightarrow{OA_n}|$$ [I]Proposed by A. Khrabrov[/i]

2012 China Team Selection Test, 3

In some squares of a $2012\times 2012$ grid there are some beetles, such that no square contain more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid again, also satisfying the condition that there is at most one beetle standing in each square. The vector from the centre of the square from which a beetle $B$ flies to the centre of the square on which it lands is called the [i]translation vector[/i] of beetle $B$. For all possible starting and ending configurations, find the maximum length of the sum of the [i]translation vectors[/i] of all beetles.

2011 Indonesia TST, 2

At a certain mathematical conference, every pair of mathematicians are either friends or strangers. At mealtime, every participant eats in one of two large dining rooms. Each mathematician insists upon eating in a room which contains an even number of his or her friends. Prove that the number of ways that the mathematicians may be split between the two rooms is a power of two (i.e., is of the form $ 2^k$ for some positive integer $ k$).

2002 Iran Team Selection Test, 10

Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.

1986 Miklós Schweitzer, 6

Tags: vector , topology
Let $U$ denote the set $\{ f\in C[0, 1] \colon |f(x)|\leq 1\, \mathrm{for}\,\mathrm{all}\, x\in [0, 1]\}$. Prove that there is no topology on $C[0, 1]$ that, together with the linear structure of $C[0,1]$, makes $C[0,1]$ into a topological vector space in which the set $U$ is compact. (Assume that topological vector spaces are Hausdorff) [V. Totik]

2010 Purple Comet Problems, 27

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$.

2014 AMC 12/AHSME, 25

The parabola $P$ has focus $(0,0)$ and goes through the points $(4,3)$ and $(-4,-3)$. For how many points $(x,y)\in P$ with integer coefficients is it true that $|4x+3y|\leq 1000$? $\textbf{(A) }38\qquad \textbf{(B) }40\qquad \textbf{(C) }42\qquad \textbf{(D) }44\qquad \textbf{(E) }46\qquad$

2007 IMC, 5

For each positive integer $ k$, find the smallest number $ n_{k}$ for which there exist real $ n_{k}\times n_{k}$ matrices $ A_{1}, A_{2}, \ldots, A_{k}$ such that all of the following conditions hold: (1) $ A_{1}^{2}= A_{2}^{2}= \ldots = A_{k}^{2}= 0$, (2) $ A_{i}A_{j}= A_{j}A_{i}$ for all $ 1 \le i, j \le k$, and (3) $ A_{1}A_{2}\ldots A_{k}\ne 0$.

1980 Tournament Of Towns, (006) 3

We are given $30$ non-zero vectors in $3$ dimensional space. Prove that among these there are two such that the angle between them is less than $45^o$.

2007 APMO, 1

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.

2014 Math Prize For Girls Problems, 16

If $\sin x + \sin y = \frac{96}{65}$ and $\cos x + \cos y = \frac{72}{65}$, then what is the value of $\tan x + \tan y$?

2002 Iran Team Selection Test, 10

Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.

2011 Romanian Masters In Mathematics, 2

For every $n\geq 3$, determine all the configurations of $n$ distinct points $X_1,X_2,\ldots,X_n$ in the plane, with the property that for any pair of distinct points $X_i$, $X_j$ there exists a permutation $\sigma$ of the integers $\{1,\ldots,n\}$, such that $\textrm{d}(X_i,X_k) = \textrm{d}(X_j,X_{\sigma(k)})$ for all $1\leq k \leq n$. (We write $\textrm{d}(X,Y)$ to denote the distance between points $X$ and $Y$.) [i](United Kingdom) Luke Betts[/i]

1988 Poland - Second Round, 6

Given is a convex polyhedron with $ k $ faces $ S_1, \ldots, S_k $. Let us denote the vector of length 1 perpendicular to the wall $ S_i $ ($ i = 1, \ldots, k $) directed outside the given polyhedron by $ \overrightarrow{n_i} $, and the surface area of this wall by $ P_i $. Prove that $$ \sum_{i=1}^k P_i \cdot \overrightarrow{n_i} = \overrightarrow{0}.$$

1998 Belarus Team Selection Test, 1

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.$

1984 All Soviet Union Mathematical Olympiad, 373

Given two equilateral triangles $A_1B_1C_1$ and $A_2B_2C_2$ in the plane. (The vertices are mentioned counterclockwise.) We draw vectors $\overrightarrow{OA}, \overrightarrow{OB}, \overrightarrow{OC}$, from the arbitrary point $O$, equal to $\overrightarrow{A_1A_2}, \overrightarrow{B_1B_2}, \overrightarrow{C_1C_2}$ respectively. Prove that the triangle $ABC$ is equilateral.

2011 Bogdan Stan, 4

Tags: algebra , vector , geometry
Show that among any seven coplanar unit vectors there are at least two of them such that the magnitude of their sum is greater than $ \sqrt 3. $ [i]Ion Tecu[/i] and [i]Teodor Radu[/i]

2005 All-Russian Olympiad Regional Round, 8.8

8.8, 9.8, 11.8 a) 99 boxes contain apples and oranges. Prove that we can choose 50 boxes in such a way that they contain at least half of all apples and half of all oranges. b) 100 boxes contain apples and oranges. Prove that we can choose 34 boxes in such a way that they contain at least a third of all apples and a third of all oranges. c) 100 boxes contain apples, oranges and bananas. Prove that we can choose 51 boxes in such a way that they contain at least half of all apples, and half of all oranges and half of all bananas. ([i]I. Bogdanov, G. Chelnokov, E. Kulikov[/i])

1973 Spain Mathematical Olympiad, 8

In a three-dimensional Euclidean space, by $\overrightarrow{u_1}$ , $\overrightarrow{u_2}$ , $\overrightarrow{u_3}$ are denoted the three orthogonal unit vectors on the $x, y$, and $z$ axes, respectively. a) Prove that the point $P(t) = (1-t)\overrightarrow{u_1} +(2-3t)\overrightarrow{u_2} +(2t-1)\overrightarrow{u_3}$ , where $t$ takes all real values, describes a straight line (which we will denote by $L$). b) What describes the point $Q(t) = (1-t^2)\overrightarrow{u_1} +(2-3t^2)\overrightarrow{u_2} +(2t^2 -1)\overrightarrow{u_3}$ if $t$ takes all the real values? c) Find a vector parallel to $L$. d) For what values of $t$ is the point $P(t)$ on the plane $2x+ 3y + 2z +1 = 0$? e) Find the Cartesian equation of the plane parallel to the previous one and containing the point $Q(3)$. f) Find the Cartesian equation of the plane perpendicular to $L$ that contains the point $Q(2)$.