At a round table, 10 boys and 15 girls were seated. It turned out that there are exactly 5 pairs of boys sitting next to each other.
How many pairs of girls are sitting next to each other?
Let \(M\) be a finite set of numbers. It is known that among any three of its elements there are two, the sum of which belongs to \(M\).
What is the largest number of elements in \(M\)?
Ten circles are marked on the circle. How many non-closed non-self-intersecting nine-point broken lines exist with vertices at these points?
How many nine-digit numbers exist, the sum of the digits of which is even?
Prove the validity of the following formula of Newton’s binom \[(x+y)^n = \binom{n}{0}x^n + \binom{n}{1}x^{n-1}y + \dots + \binom{n}{n}y^n.\]
Calculate the following sums:
a) \(\binom{5}{0} + 2\binom{5}{1} + 2^2\binom{5}{2} + \dots +2^5\binom{5}{5}\);
b) \(\binom{n}{0} - \binom{n}{1} + \dots + (-1)^n\binom{n}{n}\);
c) \(\binom{n}{0} + \binom{n}{1} + \dots + \binom{n}{n}\).
In the expansion of \((x + y)^n\), using the Newton binomial formula, the second term was 240, the third – 720, and the fourth – 1080. Find \(x\), \(y\) and \(n\).
Here is a fragment of the table, which is called the Leibniz triangle. Its properties are “analogous in the sense of the opposite” to the properties of Pascal’s triangle. The numbers on the boundary of the triangle are the inverses of consecutive natural numbers. Each number is equal to the sum of two numbers below it. Find the formula that connects the numbers from Pascal’s and Leibniz triangles.
Draw all of the stairs made from four bricks in descending order, starting with the steepest \((4, 0, 0, 0)\) and ending with the shallowest \((1, 1, 1, 1)\).
A frog jumps over the vertices of the triangle \(ABC\), moving each time to one of the neighbouring vertices.
How many ways can it get from \(A\) to \(A\) in \(n\) jumps?