What is the maximum number of pairwise non-parallel segments with endpoints at the vertices of a regular \(n\)-gon?
The circles \(\sigma_1\) and \(\sigma_2\) intersect at points \(A\) and \(B\). At the point \(A\) to \(\sigma_1\) and \(\sigma_2\), respectively, the tangents \(l_1\) and \(l_2\) are drawn. The points \(T_1\) and \(T_2\) are chosen respectively on the circles \(\sigma_1\) and \(\sigma_2\) so that the angular measures of the arcs \(T_1A\) and \(AT_2\) are equal (the arc value of the circle is considered in the clockwise direction). The tangent \(t_1\) at the point \(T_1\) to the circle \(\sigma_1\) intersects \(l_2\) at the point \(M_1\). Similarly, the tangent \(t_2\) at the point \(T_2\) to the circle \(\sigma_2\) intersects \(l_1\) at the point \(M_2\). Prove that the midpoints of the segments \(M_1M_2\) are on the same line, independent of the positions of the points \(T_1, T_2\).
A convex figure and point \(A\) inside it are given. Prove that there is a chord (that is, a segment joining two boundary points of a convex figure) passing through point \(A\) and dividing it in half at point \(A\).
Author: A.V. Shapovalov
We call a triangle rational if all of its angles are measured by a rational number of degrees. We call a point inside the triangle rational if, when we join it by segments with vertices, we get three rational triangles. Prove that within any acute-angled rational triangle there are at least three distinct rational points.
Two lines on the plane intersect at an angle \(\alpha\). On one of them there is a flea. Every second it jumps from one line to the other (the point of intersection is considered to belong to both straight lines). It is known that the length of each of her jumps is 1 and that she never returns to the place where she was a second ago. After some time, the flea returned to its original point. Prove that for the angle \(\alpha\) the value \(\alpha/\pi\) is a rational number.
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.
Matt built a simple wooden hut to protect himself from the rain. From the side the hut looks like a right triangle with the right angle at the top. The longer part of the roof has 20 ft and the shorter one has 15 ft. What is the height of the hut in feet?
Think of other shapes Robinson’s goat can graze without a wolf, or with a wolf tied nearby. What if Robinson managed to tame several wolves and used them as guard dogs? Can two tied wolves keep an untied goat in a triangle? Can you think of other shapes you can create with Robinson’s goat and wolves?
A rectangle is made up from six squares. Find side length of the largest square if side length of the smallest square is 1.
This shape below is made up from squares.
Find side length of the bottom square if side length of the smallest square is equal to 1.