Ten circles are marked on the circle. How many non-closed non-self-intersecting nine-point broken lines exist with vertices at these points?
From the set of numbers 1 to \(2n\), \(n + 1\) numbers are chosen. Prove that among the chosen numbers there are two, one of which is divisible by another.
a) In Wonderland, there are three cities \(A\), \(B\) and \(C\). 6 roads lead from city \(A\) to city \(B\), and 4 roads lead from city \(B\) to city \(C\). How many ways can you travel from \(A\) to \(C\)?
b) In Wonderland, another city \(D\) was built as well as several new roads – two from \(A\) to \(D\) and two from \(D\) to \(C\). In how many ways can you now get from city \(A\) to city \(C\)?
How many distinct seven-digit numbers exist? It is assumed that the first digit cannot be zero.
A car registration number consists of three letters of the Russian alphabet (that is, 30 letters are used) and three digits: first we have a letter, then three digits followed by two more letters. How many different car registration numbers are there?
How many are there six-digit numbers that are divisible by \(5\)?
A passenger left his things in an automatic storage room, and when he came to get his things, it turned out that he had forgotten the code. He only remembers that in the code there were the numbers 23 and 37. To open the room, you need to correctly type a five-digit number. What is the least number of codes you need to sort through in order to open the room for sure?
How many nine-digit numbers exist, the sum of the digits of which is even?
We call a natural number “fancy”, if it is made up only of odd digits. How many four-digit “fancy” numbers are there?
A sack contains 70 marbles, 20 red, 20 blue, 20 yellow, and the rest black or white. What is the smallest number of marbles that need to be removed from the sack, without looking, in order for there to be no less than 10 marbles of the same colour among the removed marbles.