Problems

Age
Difficulty
Found: 2608

Suppose that \(n \geq 3\). Are there n points that do not lie on one line, whose pairwise distances are irrational, and the areas of all of the triangles with vertices in them are rational?

Do there exist three points \(A\), \(B\) and \(C\) on the plane such that for any point \(X\) the length of at least one of the segments \(XA\), \(XB\) and \(XC\) is irrational?

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?

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?