In the town of Malenky, there are 15 phones. Is it possible to connect them with wires such that there are four phones, each connected to three others, eight phones, each connected to six others, and three phones, each connected to five oth…
There are 2023 employees in the office, each of them knowing exactly 1686 of the others. For any pair of employees, they either both know each other or both don't know each other. Prove that we can find 7 employees each of them knowing all…
Suppose there are several points in space, where any 4 points are not coplanar, and some pairs of points are connected by line segments, forming a graph. If at least nnn colors are needed to color these points so that each point is colored…
At a meeting, there were 225 people. The attendees exchanged handshakes. Prove that at least one of the participants at the meeting shook hands with an even number of acquaintances.
Show that a convex polyhedron with an odd number of faces has at least one face with an even number of edges.
There are three sets of dominoes of different colors. How can you arrange all these three sets in a chain (according to the rules of dominoes) so that each pair of neighboring dominoes has different colors?
A castle has a number of halls and nnn doors. Every door leads into another hall or outside. Every hall has at least two doors. A knight enters the castle. In any hall, he can choose any door for exit except the one he just used to ente…
In a space, there are 200 points. Each pair of these points is connected by a line segment, and the segments do not intersect each other. Each segment is colored in one of KKK colors. Peter wants to color each point in one of these col…
Scientists gathered at a congress, some of whom are friends. It turned out that any two of them with the same number of friends at the congress do not have any mutual friends. Prove that there is a scientist who has exactly one friend among…
An (n,k)(n, k)(n,k)-tournament is a contest with nnn players held in kkk rounds such that: 1. Each player plays in each round, and every two players meet at most once. 2. If player AAA meets player BBB in round iii, player CCC meets p…
There are 200 computers in a computer center, some of which are connected by cables in pairs, with a total of 345 cables used. We call a "cluster" a set of computers such that any computer in this set can send a signal to all others through…