Problems

Age
Difficulty
Found: 821

Prove that there is no graph with five vertices whose degrees are equal to 4, 4, 4, 4, 2.

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.

Each of the edges of a complete graph consisting of 6 vertices is coloured in one of two colours. Prove that there are three vertices, such that all the edges connecting them are the same colour.

Eugenie, arriving from Big-island, said that there are several lakes connected by rivers. Three rivers flow from each lake, and four rivers flow into each lake. Prove that she is wrong.

A class has more than 32, but less than 40 people. Every boy is friends with three girls, and every girl is friends with five boys. How many people are there in the class?

Arrange in a row the numbers from 1 to 100 so that any two neighbouring ones differ by at least 50.

An \(8 \times 8\) square is painted in two colours. You can repaint any \(1 \times 3\) rectangle in its predominant colour. Prove that such operations can make the whole square monochrome.

Some person \(A\) thought of a number from 1 to 15. Some person \(B\) asks some questions to which you can answer ‘yes’ or ‘no’. Can \(B\) guess the number by asking a) 4 questions; b) 3 questions.

The numbers from 1 to 9999 are written out in a row. How can I remove 100 digits from this row so that the remaining number is a) maximal b) minimal?