Found problems: 560
Show there do not exist four points in the Euclidean plane such that the pairwise distances between the points are all odd integers.
Given a regular $ 2n$-gon, show that each of its sides and diagonals can be assigned in such a way that the sum of the obtained vectors equals zero.
$n$ vectors are on the plane. We can move each vector forward and backeard on the line that the vector is on it. If there are 2 vectors that their endpoints concide we can omit them and replace them with their sum (If their sum is nonzero). Suppose with these operations with 2 different method we reach to a vector. Prove that these vectors are on a common line
There are $n > 1$ points on the plane. Two take turns connecting more an unconnected pair of points by a vector of one of two possible directions. If after the next move of a player the sum of all drawn vectors is zero, then the second one wins; if it's another move is impossible, and there was no zero sum, then the first one wins. Who wins when played correctly?
Let $a_{ij}$ $i=1,2,3$; $j=1,2,3$ be real numbers such that $a_{ij}$ is positive for $i=j$ and negative for $i\neq j$.
Prove the existence of positive real numbers $c_{1}$, $c_{2}$, $c_{3}$ such that the numbers \[a_{11}c_{1}+a_{12}c_{2}+a_{13}c_{3},\qquad a_{21}c_{1}+a_{22}c_{2}+a_{23}c_{3},\qquad a_{31}c_{1}+a_{32}c_{2}+a_{33}c_{3}\] are either all negative, all positive, or all zero.
[i]Proposed by Kiran Kedlaya, USA[/i]
Show that among any nine complex numbers whose affixes in the complex plane lie on the unit circle, there are at least two of them such that the modulus of their sum is greater than $ \sqrt 2. $
[i]Ion Tecu[/i]
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$).
Let $n$ be a positive integer, set $S_n = \{ (a_1,a_2,\cdots,a_{2^n}) \mid a_i=0 \ \text{or} \ 1, 1 \leq i \leq 2^n\}$. For any two elements $a=(a_1,a_2,\cdots,a_{2^n})$ and $b=(b_1,b_2,\cdots,b_{2^n})$ of $S_n$, define
\[ d(a,b)= \sum_{i=1}^{2^n} |a_i - b_i| \]
We call $A \subseteq S_n$ a $\textsl{Good Subset}$ if $d(a,b) \geq 2^{n-1}$ holds for any two distinct elements $a$ and $b$ of $A$. How many elements can the $\textsl{Good Subset}$ of $S_n$ at most have?
Let $ABCDEF$ be a convex hexagon, and let $P= AB \cap CD$, $Q = CD \cap EF$, $R = EF \cap AB$, $S = BC \cap DE$, $T = DE \cap FA$, $U = FA \cap BC$. Prove that
$\frac{PQ}{CD} = \frac{QR}{EF} = \frac{RP}{AB}$ if and only if $\frac{ST}{DE} = \frac{TU}{FA} = \frac{US}{BC}$
Given a point $O$ inside triangle $ABC$ . Prove that $$S_A * \overrightarrow{OA} + S_B * \overrightarrow{OB} + S_C * \overrightarrow{OC} = \overrightarrow{0}$$
where $S_A, S_B, S_C$ denote areas of triangles $BOC, COA, AOB$ respectively.
Let $ n$ be an even number, and $ S$ be the set of all arrays of length $ n$ whose elements are from the set $ \left\{0,1\right\}$. Prove that $ S$ can be partitioned into disjoint three-element subsets such that for each three arrays $ \left(a_i\right)_{i \equal{} 1}^n$, $ \left(b_i\right)_{i \equal{} 1}^n$, $ \left(c_i\right)_{i \equal{} 1}^n$ which belong to the same subset and for each $ i\in\left\{1,2,...,n\right\}$, the number $ a_i \plus{} b_i \plus{} c_i$ is divisible by $ 2$.
Show that for every odd integer $N>5$ there exist vectors $\bf u,v,w$ in (three-dimensional) space which are pairwise perpendicular, not parallel with any of the coordinate axes, have integer coordinates, and satisfy $N\bf =|u|=|v|=|w|.$
[i]Based on problem 2 of the 2018 Kürschák contest[/i]
We consider three vectors drawn from the same initial point $O,$ of lengths $a,b$ and $c$, respectively. Let $E$ be the parallelepiped with vertex $O$ of which the given vectors are the edges and $H$ the parallelepiped with vertex $O$ of which the given vectors are the altitudes. Show that the product of the volumes of $E$ and $H$ equals $(abc)^{2}$ and generalize this result to $n$ dimensions.
Let $ABCD$ be a convex quadrilateral such that $AC \perp BD$.
(a) Prove that $AB^2 + CD^2 = BC^2 + DA^2$.
(b) Let $PQRS$ be a convex quadrilateral such that $PQ = AB$, $QR = BC$, $RS = CD$ and $SP = DA$. Prove that $PR \perp QS$.
Prove that the transformation product of the symmetry of center $(0, 0)$ with the symmetry of the axis, with the line of equation $x = y + 1$, can be expressed as a product of an axis symmetry the line $e$ by a translation of vector $\overrightarrow{v}$, with $e$ parallel to $\overrightarrow{v}$, .
Determine a line $e$ and a vector $\overrightarrow{v}$, that meet the indicated conditions. have to be unique $e$ and $\overrightarrow{v}$,?
Let $ABCD$ be a convex quadrilateral and points $E$ and $F$ on sides $AB,CD$ such that
\[\tfrac{AB}{AE}=\tfrac{CD}{DF}=n\]
If $S$ is the area of $AEFD$ show that ${S\leq\frac{AB\cdot CD+n(n-1)AD^2+n^2DA\cdot BC}{2n^2}}$
Find the minimum possible length of the sum of $1999$ unit vectors in the coordinate plane whose both coordinates are nonnegative.
What is the biggest shadow that a cube of side length $1$ can have, with the sun at its peak?
Note: "The biggest shadow of a figure with the sun at its peak" is understood to be the biggest possible area of the orthogonal projection of the figure on a plane.
Let $\mathcal A = A_0A_1A_2A_3 \cdots A_{2013}A_{2014}$ be a [i]regular 2014-simplex[/i], meaning the $2015$ vertices of $\mathcal A$ lie in $2014$-dimensional Euclidean space and there exists a constant $c > 0$ such that $A_iA_j = c$ for any $0 \le i < j \le 2014$. Let $O = (0,0,0,\dots,0)$, $A_0 = (1,0,0,\dots,0)$, and suppose $A_iO$ has length $1$ for $i=0,1,\dots,2014$. Set $P=(20,14,20,14,\dots,20,14)$. Find the remainder when \[PA_0^2 + PA_1^2 + \dots + PA_{2014}^2 \] is divided by $10^6$.
[i]Proposed by Robin Park[/i]
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.$
In convex hexagon $ABCDEF$, $AB \parallel DE$, $BC \parallel EF$, $CD \parallel FA$, and \[ AB+DE = BC+EF = CD+FA. \] The midpoints of sides $AB$, $BC$, $DE$, $EF$ are $A_1$, $B_1$, $D_1$, $E_1$, and segments $A_1D_1$ and $B_1E_1$ meet at $O$. Prove that $\angle D_1OE_1 = \frac12 \angle DEF$.
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.
In a quadrilateral $ABCD$ let $E$ be the intersection of the two diagonals, I the center of the parallelogram whose vertices are the midpoints of the four sides of the quadrilateral, and K the center of the parallelogram whose sides pass through the points. divide the four sides of the quadrilateral into three equal parts (see illustration ).
[img]https://cdn.artofproblemsolving.com/attachments/1/c/8f2617103edd8361b8deebbee13c6180fa848b.png[/img]
a) Prove that $\overrightarrow{EK} =\frac43 \overrightarrow{EI}$.
b) Prove that $$\lambda_A \overrightarrow{KA} +\lambda_B \overrightarrow{KB} + \lambda_C \overrightarrow{KC} + \lambda_D \overrightarrow{KD} = \overrightarrow{0}$$ , where
$$\lambda_A=1+\frac{S(ADB)}{S(ABCD)},\lambda_B=1+\frac{S(BCA)}{S(ABCD)},\lambda_C=1+\frac{S(CDB)}{S(ABCD)},\lambda_D=1+\frac{S(DAC)}{S(ABCD)}$$
, where $S$ is the area symbol.
A cube with side length $ 1$ is sliced by a plane that passes through two diagonally opposite vertices $ A$ and $ C$ and the midpoints $ B$ and $ D$ of two opposite edges not containing $ A$ and $ C$, ac shown. What is the area of quadrilateral $ ABCD$?
[asy]import three;
size(200);
defaultpen(fontsize(8)+linewidth(0.7));
currentprojection=obliqueX;
dotfactor=4;
draw((0.5,0,0)--(0,0,0)--(0,0,1)--(0,0,0)--(0,1,0),linetype("4 4"));
draw((0.5,0,1)--(0,0,1)--(0,1,1)--(0.5,1,1)--(0.5,0,1)--(0.5,0,0)--(0.5,1,0)--(0.5,1,1));
draw((0.5,1,0)--(0,1,0)--(0,1,1));
dot((0.5,0,0));
label("$A$",(0.5,0,0),WSW);
dot((0,1,1));
label("$C$",(0,1,1),NE);
dot((0.5,1,0.5));
label("$D$",(0.5,1,0.5),ESE);
dot((0,0,0.5));
label("$B$",(0,0,0.5),NW);[/asy]$ \textbf{(A)}\ \frac {\sqrt6}{2} \qquad \textbf{(B)}\ \frac {5}{4} \qquad \textbf{(C)}\ \sqrt2 \qquad \textbf{(D)}\ \frac {3}{2} \qquad \textbf{(E)}\ \sqrt3$
Let $ v_1, v_2, \ldots, v_{1989}$ be a set of coplanar vectors with $ |v_r| \leq 1$ for $ 1 \leq r \leq 1989.$ Show that it is possible to find $ \epsilon_r$, $1 \leq r \leq 1989,$ each equal to $ \pm 1,$ such that \[ \left | \sum^{1989}_{r\equal{}1} \epsilon_r v_r \right | \leq \sqrt{3}.\]