The frog jumps over the vertices of the hexagon \(ABCDEF\), each time moving to one of the neighbouring vertices.
a) How many ways can it get from \(A\) to \(C\) in \(n\) jumps?
b) The same question, but on condition that it cannot jump to \(D\)?
c) Let the frog’s path begin at the vertex \(A\), and at the vertex \(D\) there is a mine. Every second it makes another jump. What is the probability that it will still be alive in \(n\) seconds?
d)* What is the average life expectancy of such frogs?
Prove that the 13th day of the month is more likely to occur on a Friday than on other days of the week. It is assumed that we live in the Gregorian style calendar.
Find the coefficient of \(x\) for the polynomial \((x - a) (x - b) (x - c) \dots (x - z)\).
The following words/sounds are given: look, yar, yell, lean, lease. Determine what will happen if the sounds that make up these words are pronounced in reverse order.
Find the largest number of colours in which you can paint the edges of a cube (each edge with one colour) so that for each pair of colours there are two adjacent edges coloured in these colours. Edges are considered to be adjacent if they have a common vertex.
Prove that for \(n > 0\) the polynomial \[P (x) = n^2x^{n + 2} - (2n^2 + 2n - 1) x^{n + 1} + (n + 1)^2x^n - x - 1\] is divisible by \((x - 1)^3\).
Prove that for \(n> 0\) the polynomial \(x^{2n + 1} - (2n + 1)x^{n + 1} + (2n + 1)x^n - 1\) is divisible by \((x - 1)^3\).
A class contains 33 pupils, who have a combined age of 430 years. Prove that if we picked the 20 oldest pupils they would have a combined age of no less than 260 years. The age of any given pupil is a whole number.
In a one-on-one tournament 10 chess players participate. What is the least number of rounds after which the single winner could have already been determined? (In each round, the participants are broken up into pairs. Win – 1 point, draw – 0.5 points, defeat – 0).
Specify any solution of the puzzle: \(2014 + YES =BEAR\).