Peter plays a computer game “A bunch of stones.” First in his pile of stones he has 16 stones. Players take turns taking from the pile either 1, 2, 3 or 4 stones. The one who takes the last stone wins. Peter plays this for the first time and therefore each time he takes a random number of stones, whilst not violating the rules of the game. The computer plays according to the following algorithm: on each turn, it takes the number of stones that leaves it to be in the most favorable position. The game always begins with Peter. How likely is it that Peter will win?
There are fewer than 30 people in a class. The probability that at random a selected girl is an excellent student is \(3/13\), and the probability that at random a chosen boy is an excellent pupil is \(4/11\). How many excellent students are there in the class?
In a box of 2009 socks there are blue and red socks. Can there be some number of blue socks that the probability of pulling out two socks of the same colour at random is equal to 0.5?
On a Christmas tree, 100 light bulbs hang in a row. Then the light bulbs begin to switch according to the following algorithm: all are lit up, then after a second, every second light goes out, after another second, every third light bulb changes: if it was on, it goes out and vice versa. After another second, every fourth bulb switches, a second later – every fifth and so on. After 100 seconds the sequence ends. Find the probability that a light bulb straight after a randomly selected light bulb is on (bulbs do not burn out and do not break).
In the set \(-5\), \(-4\), \(-3\), \(-2\), \(-1\), \(0\), \(1\), \(2\), \(3\), \(4\), \(5\), replace one number with two other integers so that the set variance and its mean remain unchanged.
Valerie wrote the number 1 on the board, and then several more numbers. As soon as Valerie writes the next number, Mike calculates the median of the already available set of numbers and writes it in his notebook. At some point, in Mike’s notebook, the numbers: 1; 2; 3; 2.5; 3; 2.5; 2; 2; 2; 2.5 are written.
a) What is the fourth number written on the board?
b) What is the eighth number written on the board?
An abstract artist took a wooden \(5\times 5\times 5\) cube and divided each face into unit squares. He painted each square in one of three colours – black, white, and red – so that there were no horizontally or vertically adjacent squares of the same colour. What is the smallest possible number of squares the artist could have painted black following this rule? Unit squares which share a side are considered adjacent both when the squares lie on the same face and when they lie on adjacent faces.
Prove that for any odd natural number, \(a\), there exists a natural number, \(b\), such that \(2^b - 1\) is divisible by \(a\).
Out of the given numbers 1, 2, 3, ..., 1000, find the largest number \(m\) that has this property: no matter which \(m\) of these numbers you delete, among the remaining \(1000 - m\) numbers there are two, of which one is divisible by the other.
What has a greater value: \(300!\) or \(100^{300}\)?