Does there exist a flat quadrilateral in which the tangents of all interior angles are equal?
Let \(M\) be the point of intersection of the medians of the triangle \(ABC\), and \(O\) an arbitrary point on a plane. Prove that \[OM^2 = 1/3 (OA^2 + OB^2 + OC^2) - 1/9 (AB^2 + BC^2 + AC^2).\]
Three non-coplanar vectors are given. Is it possible to find a fourth vector perpendicular to the three vectors given?
Find the volume of an inclined triangular prism whose base is an equilateral triangle with sides equal to a if the side edge of the prism is equal to the side of the base and is inclined to the plane of the base at an angle of \(60^{\circ}\).
When Gulliver came to Lilliput, he found that everything was exactly 12 times shorter than in his homeland. Can you say how many Lilliputian matchboxes fit into the matchbox of Gulliver?
A page of a calendar is partially covered by the previous torn sheet (see the figure). The vertices A and B of the upper sheet lie on the sides of the bottom sheet. The fourth vertex of the lower leaf is not visible – it is covered by the top sheet. The upper and lower pages, of course, are identical in size to each other. Which part of the lower page is greater, that which is covered or that which is not?
A square piece of paper is cut into 6 pieces, each of which is a convex polygon. 5 of the pieces are lost, leaving only one piece in the form of a regular octagon (see the drawing). Is it possible to reconstruct the original square using just this information?
A cube with a side of 1 m was sawn into cubes with a side of 1 cm and they were in a row (along a straight line). How long was the line?
In some country there are 101 cities, and some of them are connected by roads. However, every two cities are connected by exactly one path.
How many roads are there in this country?
a) The vertices (corners) in a regular polygon with 10 sides are colored black and white in an alternating fashion (i.e. one vertex is black, the next is white, etc). Two people play the following game. Each player in turn draws a line connecting two vertices of the same color. These lines must not have common vertices (i.e. must not begin or end on the same dot as another line) with the lines already drawn. The winner of the game is the player who made the final move. Which player, the first or the second, would win if the right strategy is used?
b) The same problem, but for a regular polygon with 12 sides.