Problems
Prove that out of \(n\) objects an even number of objects can be chosen in \(2^{n-1}\) ways.
Prove that every number \(a\) in Pascal’s triangle is equal to
a) the sum of the numbers of the previous right diagonal, starting from the leftmost number up until the one to the right above the number \(a\).
b) the sum of the numbers of the previous left diagonal, starting from the leftmost number to the one to left of the number which is above \(a\).
How many necklaces can be made from five identical red beads and two identical blue beads?
How many ways can you build a closed line whose vertices are the vertices of a regular hexagon (the line can be self-intersecting)?
How many different four-digit numbers, divisible by 4, can be made up of the digits 1, 2, 3 and 4,
a) if each number can occur only once?
b) if each number can occur several times?
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?
Prove that there is no graph with five vertices whose degrees are equal to 4, 4, 4, 4, 2.
Prove that there exists a graph with 2n vertices whose degrees are \(1, 1, 2, 2, \dots , n, n\).
In a graph, all the vertices have degree of 3. Prove that there is a cycle in it.