Among some number of mathematicians, every seventh is a philosopher, and among some number of philosophers every ninth is a mathematician. Who are there more of: philosophers or mathematicians?
In the garden of Sandra and Lewis 2006 rose bushes were growing. Lewis watered half of all the bushes, and Sandra watered half of all the bushes. At the same time, it turned out that exactly three bushes, the most beautiful, were watered by both Sandra and Lewis. How many rose bushes have not been watered?
A number set \(M\) contains \(2003\) distinct positive numbers, such that for any three distinct elements \(a, b, c\) in \(M\), the number \(a^2 + bc\) is rational. Prove that we can choose a natural number \(n\) such that for any \(a\) in \(M\) the number \(a\sqrt{n}\) is rational.
11 scouts are working on 5 different badges. Prove that there will be two scouts \(A\) and \(B\), such that every badge that \(A\) is working towards is also being worked towards by \(B\).
Arrange in a row the numbers from 1 to 100 so that any two neighbouring ones differ by at least 50.
a) A square of area 6 contains three polygons, each of area 3. Prove that among them there are two polygons that have an overlap of area no less than 1.
b) A square of area 5 contains nine polygons of area 1. Prove that among them there are two polygons that have an overlap of area no less than \(\frac{1}{9}\).
Anna is waiting for the bus. Which event is most likely?
\(A =\{\)Anna waits for the bus for at least a minute\(\}\),
\(B = \{\)Anna waits for the bus for at least two minutes\(\}\),
\(C = \{\)Anna waits for the bus for at least five minutes\(\}\).
Peter and 9 other people play such a game: everyone rolls a dice. The player receives a prize if he or she rolled a number that no one else was able to roll.
a) What is the probability that Peter will receive a prize?
b) What is the probability that at least someone will receive a prize?
In a corridor of length 100 m, 20 sections of red carpet are laid out. The combined length of the sections is 1000 m. What is the largest number there can be of distinct stretches of the corridor that are not covered by carpet, given that the sections of carpet are all the same width as the corridor?
Is it possible to cut out such a hole in a sheet of paper through which a person could climb through?