Found problems: 180
Can three persons, having one double motorcycle, overcome the distance of $70$ km in $3$ hours? Pedestrian speed is $5$ km / h and motorcycle speed is $50$ km / h.
Prove that in all triangles $ABC$ with $\angle A = 2\angle B$ the distance from $C$ to $A$ and to the perpendicular bisector of $AB$ are in the same ratio.
Consider $K$ a polygon in plane, such that the distance between any two vertices is not greater than $1$. Let $X$ and $Y$ be two points inside $K$. Show that there exist a point $Z$, lying on the border of K, such that $XZ + Y Z \le 1$
Give a square of side $1$. Show that for each finite set of points of the sides of the square you can find a vertex of the square with the following property: the arithmetic mean of the squares of the distances from this vertex to the points of the set is greater than or equal to $3/4$.
$(BUL 5)$ Let $Z$ be a set of points in the plane. Suppose that there exists a pair of points that cannot be joined by a polygonal line not passing through any point of $Z.$ Let us call such a pair of points unjoinable. Prove that for each real $r > 0$ there exists an unjoinable pair of points separated by distance $r.$
Let $ABC$ be a triangle. For some $d>0$ let $P$ stand for a point inside the triangle such that $|AB| - |P B| \ge d$, and $|AC | - |P C | \ge d$. Is the following inequality true $|AM | - |P M | \ge d$, for any position of $M \in BC $?
An $8 \times 8$ board is divided into unit squares. Ten of these squares have their centers marked. Prove that either there exist two marked points on the distance at most $\sqrt2$, or there is a point on the distance $1/2$ from the edge of the board.
Given line $AB$ and point $M$. Find all lines in space passing through $M$ at distance $d$.
Let $A, B, C$, and $D$ be four different points in the plane. Three of the line segments $AB, AC, AD, BC, BD$,
and $CD$ have length $a$. The other three have length $b$, where $b > a$. Determine all possible values of the quotient $\frac{b}{a}$.
.
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
Lyuba, Tanya, Lena and Ira ran across a flat field. At some point it turned out that among the pairwise distances between them there are distances of $1, 2, 3, 4$ and $5$ meters, and there are no other distances. Give an example of how this could be.
Show that the circumradius $R$ of a triangle $ABC$ equals the arithmetic mean of the oriented distances from its incenter $I$ and three excenters $I_a,I_b, I_c$ to any tangent $\tau$ to its circumcircle. In other words, if $\delta(P)$ denotes the distance from a point $P$ to $\tau$, then with appropriate choices of signs, we have
$$\delta(I) \pm \delta_(I_a) \pm \delta_(I_b) \pm \delta_(I_c) = 4R$$
Luis González
Find all points on the plane such that the sum of the distances of each of the four lines defined by the unit square of that plane is $4$.
Consider any five points in the interior of square $S$ of side length $1$. Prove that at least one of the distances between these points is less than $\sqrt{2} \slash 2.$ Can this constant be replaced by a smaller number?
Consider a pyramid whose base is an equilateral triangle $BCD$ and whose other faces are triangles isosceles, right at the common vertex $A$. An ant leaves the vertex $B$ arrives at a point $P$ of the $CD$ edge, from there goes to a point $Q$ of the edge $AC$ and returns to point $B$. If the path you made is minimal, how much is the angle $PQA$ ?
Given a rectangular parallelepiped $ABCDA'B'C'D'$ with the bases $ABCD, A'B'C'D'$, the edges $AA',BB', CC',DD'$ and $AB = a,AD = b,AA' = c$. Show that there exists a triangle with the sides equal to the distances from $A,A',D$ to the diagonal $BD'$ of the parallelepiped. Denote those distances by $m_1,m_2,m_3$. Find the relationship between $a, b, c,m_1,m_2,m_3$.
In an aquarium there are nine small fish. The aquarium is cube shaped with a side length of two meters and is completely filled with water. Show that it is always possible to find two small fish with a distance of less than $\sqrt3$ meters.
Let $D$ be a point inside a triangle $ABC$ such that $|AC| -|AD| \geq 1$ and $|BC|- |BD| \geq 1.$ Prove that for any point $E$ on the segment $AB$, we have $|EC| -|ED| \geq 1.$
Given two lines on a plane, find the locus of all points with the difference between the distance to one line and the distance to the other equal to the length of a given segment.
The Euclidian three-dimensional space has been partitioned into three nonempty sets $A_1,A_2,A_3$. Show that one of these sets contains, for each $d > 0$, a pair of points at mutual distance $d$.
The planes $p$ and $p'$ are parallel. A polygon $P$ on $p$ has $m$ sides and a polygon $P'$ on $p'$ has $n$ sides. Find the largest and smallest distances between a vertex of $P$ and a vertex of $P'$.
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.
A plane in space is equidistant from a set of points if its distances from the points in the set are equal. What is the largest possible number of equidistant planes from five points, no four of which are coplanar?
Two unit squares with parallel sides overlap by a rectangle of area $1/8$. Find the extreme values of the distance between the centers of the squares.
Let $n$ be a positive integer. Define a chameleon to be any sequence of $3n$ letters, with exactly $n$ occurrences of each of the letters $a, b,$ and $c$. Define a swap to be the transposition of two adjacent letters in a chameleon. Prove that for any chameleon $X$ , there exists a chameleon $Y$ such that $X$ cannot be changed to $Y$ using fewer than $3n^2/2$ swaps.