Found problems: 59
For non-coplanar points are given in space.
A plane $\pi$ is called [i]equalizing [/i] if all four points have the same distance from $\pi$.
Find the number of equilizing planes.
$99$ straight lines divide a plane into $n$ parts. Find all possible values of $n$ less than $199$.
In $3$ dimensional space we are given a parallelogram $ABCD$ and plane $M$. The distances from vertices $A, B$ and $C$ to plane $M$ are $a, b$ and $c$ respectively. Find the distance $d$ from vertex $D$ to the plane $M$ .
Each of two regular polyhedrons $P$ and $Q$ was divided by the plane into two parts. One part of $P$ was attached to one part of $Q$ along the dividing plane and formed a regular polyhedron not equal to $P$ and $Q$. How many faces can it have?
In space are given $n$ segments $A_iB_i$ and a point $O$ not lying on any segment, such that the sum of the angles $A_iOB_i$ is less than $180^o$ . Prove that there exists a plane passing through $O$ and not intersecting any of the segments.
Is it possible that two cross-sections of a tetrahedron by two different cutting planes are two squares, one with a side of length no greater than $1$ and another with a side of length at least $100$?
Mikhail Evdokimov
Is it possible to paint the plane in $4$ colors so that inside any circle are the dots of all four colors?
A triangle $ABC$ and spheres are given in space $S_1$ and $S_2$, each of which passes through points $A, B$ and $C$. For points $M$ spheres $S_1$ not lying in the plane of triangle $ABC$ are drawn lines $MA, MB$ and $MC$, intersecting the sphere $S_2$ for the second time at points $A_1,B_1$ and $C_1$, respectively. Prove that the planes passing through points $A_1, B_1$ and $C_1$, touch a fixed sphere or pass through a fixed point.
Suppose that each set $X$ of points in the plane has an associated set $\overline{X}$ of points called its cover. Suppose further that (1) $\overline{X\cup Y} \supset \overline{\overline{X}} \cup \overline{Y} \cup Y$ for all sets $X,Y$ . Show that i) $\overline{X} \supset X$, ii) $\overline{\overline{X}}=\overline{X}$ and iii) $X\supset Y \Rightarrow \overline{X} \supset \overline{Y}.$ Prove also that these three statements imply (1).
In the plane $n$ segments with lengths $a_1, a_2, \dots , a_n$ are drawn. Every ray beginning at the point $O$ meets at least one of the segments. Let $h_i$ be the distance from $O$ to the $i$-th segment (not the line!) Prove the inequality
\[\frac{a_1}{h_1}+\frac{a_2}{h_2} + \ldots + \frac{a_i}{h_i} \geqslant 2 \pi.\]
Prove that the area of a unit cube's projection on any plane equals the length of its projection on the perpendicular to this plane.
What is the minimum number of planes determined by $6$ points in space which are not all coplanar, and among which no three are collinear?
The points $A_1,B_1,C_1,D_1$ and $A_2,B_2,C_2,D_2$ are orthogonal projections of the $ABCD$ tetrahedron vertices on two planes. Prove that it is possible to move one of the planes to provide the parallelness of lines $(A_1A_2), (B_1B_2), (C_1C_2)$ and $(D_1D_2)$ .
The pyramid $VABCD$ has base the rectangle ABCD, and the side edges are congruent. Prove that the plane $(VCD)$ forms congruent angles with the planes $(VAC)$ and $(BAC)$ if and only if $\angle VAC = \angle BAC $.
Anne has thought of a finite set $A \subseteq \mathbb{R}^2 $ . Bob does not know how many elements $A$ has, but his goal is to completely determine $A$.
To achieve this, Bob can chooseany point $b \in \mathbb{R}^2 $ and ask Anne how far it is from$ A$ . Anne replies with the distance, defined as $min \{d(a, b) | a \in A\}$. (Here $d(a, b)$ denotes the distance between points $a, b \in \mathbb{R}$ .)
Bob can ask as many questions of this type as he wants, until he can determine A with certainty.
a) Can Bob achieve his goal with finitely many questions?
b) What if Anne tells Bob in advance that all points of A have both coordinates in the interval$\ [0, 1]\ $?
Note: $\mathbb{R}^2$ is the set of points in the plane.
A grasshopper hops from an integer point to another integer point in the plane, where every even jump has a length $\sqrt{98}$ and every odd one - $\sqrt{149}$. What’s the least number of jumps the grasshopper has to make in order to return to its starting point after odd number of jumps?
What is the greatest number of parts that $5$ spheres can divide the space into?
A plane passing through the center of a cube intersects the cube in a cyclic hexagon. Show that this hexagon is regular.
Given a cube $ABCDA_1B_1C_1D_1$ with edge $5$. On the edge $BB_1$ of the cube , point $K$ such thath $BK=4$.
a) Construct a cube section with the plane $a$ passing through the points $K$ and $C_1$ parallel to the diagonal $BD_1$.
b) Find the angle between the plane $a$ and the plane $BB_1C_1$.
Is it possible to choose a sphere, a triangular pyramid and a plane so that every plane, parallel to the chosen one, intersects the sphere and the pyramid in sections of equal area?
(Problem from Latvia)
There are $2017$ lines in the plane such that no three of them go through the same point. Turbo the snail sits on a point on exactly one of the lines and starts sliding along the lines in the following fashion: she moves on a given line until she reaches an intersection of two lines. At the intersection, she follows her journey on the other line turning left or right, alternating her choice at each intersection point she reaches. She can only change direction at an intersection point. Can there exist a line segment through which she passes in both directions during her journey?
A spatial quadrilateral is circumscribed around a sphere. Prove that all the tangent points lie in one plane.
A plane is divided into $N$ regions by three families of parallel lines. No three lines pass through the same point. What is the smallest number of lines needed so that $N > 1999$?
A cube is divided into $27$ equal smaller cubes. A plane intersects the cube. Find the maximum possible number of smaller cubes the plane can intersect.
A tetrahedron $ABCD$ is given. The incircles of triangles $ ABC$ and $ABD$ with centers $O_1, O_2$, touch $AB$ at points $T_1, T_2$. The plane $\pi_{AB}$ passing through the midpoint of $T_1T_2$ is perpendicular to $O_1O_2$. The planes $\pi_{AC},\pi_{BC}, \pi_{AD}, \pi_{BD}, \pi_{CD}$ are defined similarly. Prove that these six planes have a common point.