Definition. The sequence of numbers \(a_0, a_1, \dots , a_n, \dots\), which, with the given \(p\) and \(q\), satisfies the relation \(a_{n + 2} = pa_{n + 1} + qa_n\) (\(n = 0,1,2, \dots\)) is called a linear recurrent sequence of the second order.
The equation \[x^2-px-q = 0\] is called a characteristic equation of the sequence \(\{a_n\}\).
Prove that, if the numbers \(a_0\), \(a_1\) are fixed, then all of the other terms of the sequence \(\{a_n\}\) are uniquely determined.
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?
The figure shows the scheme of a go-karting route. The start and finish are at point \(A\), and the driver can go along the route as many times as he wants by going to point \(A\) and then back onto the circle.
It takes Fred one minute to get from \(A\) to \(B\) or from \(B\) to \(A\). It also takes one minute for Fred to go around the ring and he can travel along the ring in an anti-clockwise direction (the arrows in the image indicate the possible direction of movement). Fred does not turn back halfway along the route nor does not stop. He is allowed to be on the track for 10 minutes. Find the number of possible different routes (i.e. sequences of possible routes).
\(A\) and \(B\) shoot in a shooting gallery, but they only have one six-shot revolver with one cartridge. Therefore, they agreed in turn to randomly rotate the drum and shoot. \(A\) goes first. Find the probability that the shot will occur when \(A\) has the revolver.
A coin is thrown 10 times. Find the probability that it never lands on two heads in a row.
On a calculator keypad, there are the numbers from 0 to 9 and signs of two actions (see the figure). First, the display shows the number 0. You can press any keys. The calculator performs the actions in the sequence of clicks. If the action sign is pressed several times, the calculator will only remember the last click.
a) The button with the multiplier sign breaks and does not work. The Scattered Scientist pressed several buttons in a random sequence. Which result of the resulting sequence of actions is more likely: an even number or an odd number?
b) Solve the previous problem if the multiplication symbol button is repaired.
A regular dice is thrown many times. Find the mathematical expectation of the number of rolls made before the moment when the sum of all rolled points reaches 2010 (that is, it became no less than 2010).
A fair dice is thrown many times. It is known that at some point the total amount of points became equal to exactly 2010.
Find the mathematical expectation of the number of throws made to this point.
Hercules meets the three-headed snake, the Lernaean Hydra and the battle begins. Every minute, Hercules cuts one of the snake’s heads off. With probability \(\frac 14\) in the place of the chopped off head grows two new ones, with a probability of \(1/3\), only one new head will grow and with a probability of \(5/12\), not a single head will appear. The serpent is considered defeated if he does not have a single head left. Find the probability that sooner or later Hercules will beat the snake.
A high rectangle of width 2 is open from above, and the L-shaped domino falls inside it in a random way (see the figure).
a) \(k\) \(L\)-shaped dominoes have fallen. Find the mathematical expectation of the height of the resulting polygon.
b) \(7\) \(G\)-shaped dominoes fell inside the rectangle. Find the probability that the resulting figure will have a height of 12.