Found problems: 560
Let $A,B\in\mathcal{M}_{2}(\mathbb{R})$ (real $2\times 2$ matrices), that satisfy $A^{2}+B^{2}=AB$. Prove that $(AB-BA)^{2}=O_{2}$.
A river flows between two houses $ A$ and $ B$, the houses standing some distances away from the banks. Where should a bridge be built on the river so that a person going from $ A$ to $ B$, using the bridge to cross the river may do so by the shortest path? Assume that the banks of the river are straight and parallel, and the bridge must be perpendicular to the banks.
Let $ k$ be an integer, $ k \geq 2$, and let $ p_{1},\ p_{2},\ \ldots,\ p_{k}$ be positive reals with $ p_{1} \plus{} p_{2} \plus{} \ldots \plus{} p_{k} \equal{} 1$. Suppose we have a collection $ \left(A_{1,1},\ A_{1,2},\ \ldots,\ A_{1,k}\right)$, $ \left(A_{2,1},\ A_{2,2},\ \ldots,\ A_{2,k}\right)$, $ \ldots$, $ \left(A_{m,1},\ A_{1,2},\ \ldots,\ A_{m,k}\right)$ of $ k$-tuples of finite sets satisfying the following two properties:
(i) for every $ i$ and every $ j \neq j^{\prime}$, $ A_{i,j}\cap A_{i,j^{\prime}} \equal{} \emptyset$, and
(ii) for every $ i\neq i^{\prime}$ there exist $ j\neq j^{\prime}$ for which $ A_{i,j} \cap A_{i^{\prime},j^{\prime}}\neq\emptyset$. Prove that
\[ \sum_{b \equal{} 1}^{m}{\prod_{a \equal{} 1}^{k}{p_{a}^{|A_{b,a}|}}} \leq 1.
\]
There are $n$ distinct points in the plane. Given a circle in the plane containing at least one of the points in its interior. At each step one moves the center of the circle to the barycenter of all the points in the interior of the circle. Prove that this moving process terminates in the finite number of steps.
what does barycenter of n distinct points mean?
Two triangles $ ABC$and $ A'B'C'$ are positioned in the space such that the length of every side of $ \triangle ABC$ is not less than $ a$, and the length of every side of $ \triangle A'B'C'$ is not less than $ a'$. Prove that one can select a vertex of $ \triangle ABC$ and a vertex of $ \triangle A'B'C'$ so that the distance between the two selected vertices is not less than $ \sqrt {\frac {a^2 \plus{} a'^2}{3}}$.
A right that passes through the incircle $ I$ of the triangle $ \Delta ABC$ intersects the side $ AB$ and $ CA$ in $ P$, respective $ Q$. We denote $ BC\equal{}a\ , \ AC\equal{}b\ ,\ AB\equal{}c$ and $ \frac{PB}{PA}\equal{}p\ ,\ \frac{QC}{QA}\equal{}q$.
i) Prove that:
\[ a(1\plus{}p)\cdot \overrightarrow{IP}\equal{}(a\minus{}pb)\overrightarrow{IB}\minus{}pc\overrightarrow{IC}\]
ii) Show that $ a\equal{}bp\plus{}cq$.
iii) If $ a^2\equal{}4bcpq$, then the rights $ AI\ ,\ BQ$ and $ CP$ are concurrents.
A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$
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}.$$
Zeroes and ones are arranged in all the squares of $n\times n$ table.
All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form
[asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy]
(consisting of a square and its neighbours from left and from below)
is even.
Prove that no two rows of the table are identical.
[i]Proposed by O. Vanyushina[/i]
In a regular tetrahedron the centers of the four faces are the vertices of a smaller tetrahedron. The ratio of the volume of the smaller tetrahedron to that of the larger is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n.$
A circle $K$ centered at $(0,0)$ is given. Prove that for every vector $(a_1,a_2)$ there is a positive integer $n$ such that the circle $K$ translated by the vector $n(a_1,a_2)$ contains a lattice point (i.e., a point both of whose coordinates are integers).
An $n\times n$ matrix $A$ with integer entries is called [i]representative[/i] if, for any integer vector $\mathbf{v}$, there is a finite sequence $0=\mathbf{v}_0,\mathbf{v}_1,\dots,\mathbf{v}_{\ell}=\mathbf{v}$ of integer vectors such that for each $0\leq i <\ell$, either $\mathbf{v}_{i+1}=A\mathbf{v}_{i}$ or $\mathbf{v}_{i+1}-\mathbf{v}_i$ is an element of the standard basis (i.e. one of its entries is $1$, the rest are all equal to $0$). Show that $A$ is not representative if and only if $A^T$ has a real eigenvector with all non-negative entries and non-negative eigenvalue.
We say that a set $\displaystyle A$ of non-zero vectors from the plane has the property $\displaystyle \left( \mathcal S \right)$ iff it has at least three elements and for all $\displaystyle \overrightarrow u \in A$ there are $\displaystyle \overrightarrow v, \overrightarrow w \in A$ such that $\displaystyle \overrightarrow v \neq \overrightarrow w$ and $\displaystyle \overrightarrow u = \overrightarrow v + \overrightarrow w$.
(a) Prove that for all $\displaystyle n \geq 6$ there is a set of $\displaystyle n$ non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$.
(b) Prove that every finite set of non-zero vectors, which has the property $\displaystyle \left( \mathcal S \right)$, has at least $\displaystyle 6$ elements.
[i]Mihai Baluna[/i]
Consider the set of all triangles $ OPQ$ where $ O$ is the origin and $ P$ and $ Q$ are distinct points in the plane with nonnegative integer coordinates $ (x,y)$ such that $ 41x\plus{}y \equal{} 2009$. Find the number of such distinct triangles whose area is a positive integer.
A transposition of a vector is created by switching exactly two entries of the vector. For example, $(1,5,3,4,2,6,7)$ is a transposition of $(1,2,3,4,5,6,7).$ Find the vector $X$ if $S=(0,0,1,1,0,1,1)$, $T=(0,0,1,1,1,1,0),$ $U=(1,0,1,0,1,1,0),$ and $V=(1,1,0,1,0,1,0)$ are all transpositions of $X$. Describe your method for finding $X.$
Let $n,k$ be positive integers such that $n\ge k$. $n$ lamps are placed on a circle, which are all off. In any step we can change the state of $k$ consecutive lamps. In the following three cases, how many states of lamps are there in all $2^n$ possible states that can be obtained from the initial state by a certain series of operations?
i)$k$ is a prime number greater than $2$;
ii) $k$ is odd;
iii) $k$ is even.
Let $\displaystyle{A}$ and $\displaystyle{B}$ be real symmetric matrixes with all eigenvalues strictly greater than $\displaystyle{1}$. Let $\displaystyle{\lambda }$ be a real eigenvalue of matrix $\displaystyle{{\rm A}{\rm B}}$. Prove that $\displaystyle{\left| \lambda \right| > 1}$.
[i]Proposed by Pavel Kozhevnikov, MIPT, Moscow.[/i]
In the group of ten persons, each person is asked to write the sum of the ages of all the other nine persons. Of all ten sums form the nine-element set $\{ 82, 83,84,85,87,89,90,91,92 \}$, find the individual ages of the persons, assuming them to be whole numbers.
Several points are denoted on a white piece of paper. The distance between each two of the points is greater than $24$. A drop of ink was sprinkled over the paper covering an area smaller than $\pi$. Prove that there exists a vector $\overrightarrow v$ with $\overrightarrow v<1$, such that after translating all of the points by $v$ none of them is covered in ink.
Let $x_1,x_2,\cdots, x_n$ be real valued differentiable functions of a variable $t$ which satisfy
\begin{align*}
& \frac{\mathrm{d}x_1}{\mathrm{d}t}=a_{11}x_1+a_{12}x_2+\cdots+a_{1n}x_n\\
& \frac{\mathrm{d}x_2}{\mathrm{d}t}=a_{21}x_1+a_{22}x_2+\cdots+a_{2n}x_n\\
& \;\qquad \vdots \\
& \frac{\mathrm{d}x_n}{\mathrm{d}t}=a_{n1}x_1+a_{n2}x_2+\cdots+a_{nn}x_n\\
\end{align*}
For some constants $a_{ij}>0$. Suppose that $\lim_{t \to \infty}x_i(t)=0$ for all $1\le i \le n$. Are the functions $x_i$ necessarily linearly dependent?
Suppose that for a function $f: \mathbb{R}\to \mathbb{R}$ and real numbers $a<b$ one has $f(x)=0$ for all $x\in (a,b).$ Prove that $f(x)=0$ for all $x\in \mathbb{R}$ if
\[\sum^{p-1}_{k=0}f\left(y+\frac{k}{p}\right)=0\]
for every prime number $p$ and every real number $y.$
Let $n \geq 2$ be a natural number. We consider a $(2n - 1) \times (2n - 1)$ table.Ana and Bob play the following game: starting with Ana, the two of them alternately color the vertices of the unit squares, Ana with red and Bob with blue, in $2n^2$ rounds. Then, starting with Ana, each one forms a vector with origin at a red point and ending at a blue point, resulting in $2n^2$ vectors with distinct origins and endpoints. If the sum of these vectors is zero, Ana wins. Otherwise, Bob wins. Show that Bob has a winning strategy.
Let $A$ be the set of all binary sequences of length $n$ and denote $o =(0, 0, \ldots , 0) \in A$. Define the addition on $A$ as $(a_1, \ldots , a_n)+(b_1, \ldots , b_n) =(c_1, \ldots , c_n)$, where $c_i = 0$ when $a_i = b_i$ and $c_i = 1$ otherwise. Suppose that $f\colon A \to A$ is a function such that $f(0) = 0$, and for each $a, b \in A$, the sequences $f(a)$ and $f(b)$ differ in exactly as many places as $a$ and $b$ do. Prove that if $a$ , $b$, $c \in A$ satisfy $a+ b + c = 0$, then $f(a)+ f(b) + f(c) = 0$.
A four-element set $\{a, b, c, d\}$ of positive integers is called [i]good[/i] if there are two of them such that their product is a mutiple of the greatest common divisor of the remaining two. For example, the set $\{2, 4, 6, 8\}$ is good since the greatest common divisor of $2$ and $6$ is $2$, and it divides $4\times 8=32$.
Find the greatest possible value of $n$, such that any four-element set with elements less than or equal to $n$ is good.
[i]Proposed by Victor and Isaías de la Fuente[/i]
Let’s consider three pairwise non-parallel straight constant lines in the plane. Three points are moving along these lines with different nonzero velocities, one on each line (we consider the movement to have taken place for infinite time and continue infinitely in the future). Is it possible to determine these straight lines, the velocities of each moving point and their positions at some “zero” moment in such a way that the points never were, are or will be collinear?