One corner square was cut from a chessboard. What is the smallest number of equal triangles that can be cut into this shape?
101 points are marked on a plane; not all of the points lie on the same straight line. A red pencil is used to draw a straight line passing through each possible pair of points. Prove that there will always be a marked point on the plane through which at least 11 red lines pass.
a) Can 4 points be placed on a plane so that each of them is connected by segments with three points (without intersections)?
b) Can 6 points be placed on a plane and connected by non-intersecting segments so that exactly 4 segments emerge from each point?
There are 30 ministers in a parliament. Each two of them are either friends or enemies, and each is friends with exactly six others. Every three ministers form a committee. Find the total number of committees in which all three members are friends or all three are enemies.
A six-digit phone number is given. How many seven-digit numbers are there from which one can obtain this six-digit number by deleting one digit?
The city plan is a rectangle of \(5 \times 10\) cells. On the streets, a one-way traffic system is introduced: it is allowed to go only to the right and upwards. How many different routes lead from the bottom left corner to the upper right?
Is it possible to arrange 1000 line segments in a plane so that both ends of each line segment rest strictly inside another line segment?
Some open sectors – that is sectors of circles with infinite radii – completely cover a plane. Prove that the sum of the angles of these sectors is no less than \(360^\circ\).
It is known that in a convex \(n\)-gon (\(n > 3\)) no three diagonals pass through one point. Find the number of points (other than the vertex) where pairs of diagonals intersect.
On a line, there are 50 segments. Prove that either it is possible to find some 8 segments all of which have a shared intersection, or there can be found 8 segments, no two of which intersect.