Found problems: 180
Given a square sheet of paper with side $1$. Measure on this sheet a distance of $ 5/6$. (The sheet can be folded, including, along any segment with ends at the edges of the paper and unbend back, after unfolding, a trace of the fold line remains on the paper).
Given $n$ points in the plane, show that the largest distance determined by these points cannot occur more than $n$ times.
In a triangle $ \vartriangle ABC $, let $ h_a, h_b $ and $ h_c $ the atlitudes. Let $ D $ be the point where the inner bisector of $ \angle BAC $ cuts to the side $ BC $ and $ d_a $ is the distance from the $ D $ point next to $ AB $. The distances $ d_b $ and $ d_c $ are similarly defined. Show that:
$$ \dfrac {3} {2} \le \dfrac {d_a} {h_a} + \dfrac {d_b} {h_b} + \dfrac {d_c} {h_c} $$
For what kind of triangles does the equality hold?
$ABC$ is an isosceles triangle with $AB = AC$. Let $P$ be any point of a circle tangent to the sides $AB$ in $B$ and to AC in C. Denote $a$, $b$ and $c$ to the distances from $P$ to the sides $BC, AC$ and $AB$ respectively. Prove that: $a^2=bc$
Let $ ABCD $ be a rectangle of area $ S $, and $ P $ be a point inside it. We denote by $ a, b, c, d $ the distances from $ P $ to the vertices $ A, B, C, D $ respectively. Prove that $ a ^ 2 + b ^ 2 + c ^ 2 + d ^ 2\ge 2S $. When there is equality?
Let $g$ be a straight line and $n$ a given positive integer. Prove that there are always n different points on g to choose as well as a point not lying on g in such a way that the distance between each two of these $n + 1$ points is an integer.
There are $N$ points in the plane such that the [b]total number[/b] of pairwise distances of these $N$ points is at most $n$. Prove that $N \le (n + 1)^2$.
$(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 $n$ be a natural number greater than 2. $l$ is a line on a plane. There are $n$ distinct points $P_1$, $P_2$, …, $P_n$ on $l$. Let the product of distances between $P_i$ and the other $n-1$ points be $d_i$ ($i = 1, 2,$ …, $n$). There exists a point $Q$, which does not lie on $l$, on the plane. Let the distance from $Q$ to $P_i$ be $C_i$ ($i = 1, 2,$ …, $n$). Find $S_n = \sum_{i = 1}^{n} (-1)^{n-i} \frac{c_i^2}{d_i}$.
Two parallel chords $AB$ and $CD$ are drawn in a circle with center $O$.
Circles with diameters $AB$ and $CD$ intersect at point $P$.
Prove that the midpoint of the segment $OP$ is equidistant from lines $AB$ and $CD$.
Vertex $B$ of the $\angle ABC$ lies out the circle, and the $[BA)$ and $[BC)$ beams intersect it. Point $K$ belongs to the intersection of the $[BA)$ beam and the circumference. Chord $KP$ is orthogonal to the angle bisector of $\angle ABC$ . Line $(KP)$ intersects the beam $BC$ in the point $M$. Prove that the segment $[PM]$ is twice as long as the distance from the circle centre to the angle bisector of $\angle ABC$ .
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.
Points $A,B,C$ are on a plane such that $AB=BC=CA=6$. At any step, you may choose any three existing points and draw that triangle's circumcentre. Prove that you can draw a point such that its distance from an previously drawn point is:
$(a)$ greater than 7
$(b)$ greater than 2019
A boy and his father are standing on a seashore. If the boy stands on his tiptoes, his eyes are at a height of $1$ m above sea-level, and if he seats on father’s shoulders, they are at a height of $2$ m. What is the ratio of distances visible for him in two eases?
(Find the answer to $0,1$, assuming that the radius of Earth equals $6000$ km.)
Define the modulo $2553$ distance $d(x, y)$ between two integers $x, y$ to be the smallest nonnegative integer $d$ equivalent to either $x - y$ or $y - x$ modulo $2553$. Show that, given a set S of integers such that $|S| \ge 70$, there must be $m, n \in S$ with $d(m, n) \le 36$.
Inside an equilateral triangle there is a point whose distances from the sides of the triangle are $3, 4$ and $5$. Find the area of the triangle.
Consider the cube $ABCDA'B'C'D'$. The bisectors of the angles $\angle A' C'A$ and $\angle A' AC'$ intersect $AA'$ and $A'C$ in the points $P$, respectively $S$. The point $M$ is the foot of the perpendicular from $A'$ on $CP$ , and $N$ is the foot of the perpendicular from $A'$ to $AS$. Point $O$ is the center of the face $ABB'A'$
a) Prove that the planes $(MNO)$ and $(AC'B)$ are parallel.
b) Calculate the distance between these planes, knowing that $AB = 1$.
The distance between towns $A$ and $B$ is $999$ km.
At every kilometer of the road that connects $A$ and $B$ a sign shows the distances to $A$ and $B$ as follows:
$\fbox{0-999}$ , $\fbox{1-998}$ ,$\fbox{2-997}$ , $ . . . $ , $\fbox{998-1}$ , $\fbox{999-0}$
How many signs are there, with both distances written with the help of only two distinct digits?
Inside the circle with center $O$, points $A$ and $B$ are marked so that $OA = OB$. Draw a point $M$ on the circle from which the sum of the distances to points $A$ and $B$ is the smallest among all possible.
Two circles of radius $1$ intersect at points $X, Y$, the distance between which is also equal to $1$. From point $C$ of one circle, tangents $CA, CB$ are drawn to the other. Line $CB$ will cross the first circle a second time at point $A'$. Find the distance $AA'$.
Show that in a convex region in the plane whose boundary contains at most a finite number of straight line segments and whose area is greater than $\frac{\pi}{4}$ there is at least one pair of points a unit distance apart.
A clueless ant makes the following route: starting at point $ A $ goes $ 1$ cm north, then $ 2$ cm east, then $ 3$ cm south, then $ 4$ cm west, immediately $ 5$ cm north, continues $ 6$ cm east, and so on, finally $ 41$ cm north and ends in point $ B $. Calculate the distance between $ A $ and $ B $ (in a straight line).
Certain king of a certain state wants to build $n$ cities and $n-1$ roads, connecting them to provide a possibility to move from every city to every city. (Each road connects two cities, the roads do not intersect, and don't come through another city.) He wants also, to make the shortests distances between the cities, along the roads, to be $1,2,3,...,n(n-1)/2$ kilometres. Is it possible for
a) $n=6$
b) $n=1986$ ?
The cirumradius and the inradius of triangle $ABC$ are equal to $R$ and $r, O, I$ are the centers of respective circles. External bisector of angle $C$ intersect $AB$ in point $P$. Point $Q$ is the projection of $P$ to line $OI$. Find distance $OQ.$
(A.Zaslavsky, A.Akopjan)
Point $X$ is taken inside a regular $n$-gon of side length $a$. Let $h_1,h_2,...,h_n$ be the distances from $X$ to the lines defined by the sides of the $n$-gon. Prove that $\frac{1}{h_1}+\frac{1}{h_2}+...+\frac{1}{h_n}>\frac{2\pi}{a}$