How many ways can you cut a necklace consisting of 30 different beads into 8 pieces (you can cut only between beads)?
30 people vote on five proposals. In how many ways can the votes be distributed if everyone votes only for one proposal and only the number of votes cast for each proposal is taken into account?
a) The sports club has 30 members, of which four people are required to participate in the 1,000 metre race. How many ways can this be done?
b) How many ways can I build a team of four people to participate in the relay race 100 m + 200 m + 300 m + 400 m?
How many integers are there from 0 to 999999, in the decimal notation of which there are no two identical numbers next to each other?
Find the number of rectangles made up of the cells of a board with \(m\) horizontals and \(n\) verticals that contain a cell with the coordinates \((p, q)\).
Prove that there exists a graph with 2n vertices whose degrees are \(1, 1, 2, 2, \dots , n, n\).
a) they have 10 vertices, the degree of each of which is equal to 9?
b) they have 8 vertices, the degree of each of which is equal to 3?
c) are they connected, without cycles and contain 6 edges?
Prove that a graph, in which every two vertices are connected by exactly one simple path, is a tree.
Prove that, in a tree, every two vertices are connected by exactly one simple path.
Prove that there is a vertex in the tree from which exactly one edge emerges (such a vertex is called a hanging top).