Problems

Age
Difficulty
Found: 3010

Liouville’s discrete theorem. Let f(x,y) be a bounded harmonic function (see the definition in problem number 11.28), that is, there exists a positive constant M such that (x,y)Z2 |f(x,y)|M. Prove that the function f(x,y) is equal to a constant.

Definition. The sequence of numbers a0,a1,,an,, which, with the given p and q, satisfies the relation an+2=pan+1+qan (n=0,1,2,) is called a linear recurrent sequence of the second order.

The equation x2pxq=0 is called a characteristic equation of the sequence {an}.

Prove that, if the numbers a0, a1 are fixed, then all of the other terms of the sequence {an} 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?

Let (1+2+3)n=pn+qn2+rn3+sn6 for n0. Find:

a) limnpnqn; b) limnpnrn; c) limnpnsn;

Find the generating functions of the sequences of Chebyshev polynomials of the first and second kind: FT(x,z)=n=0Tn(x)zn;FU(x,z)=n=0Un(X)zn.

Definitions of Chebyshev polynomials can be found in the handbook.

We denote by Pk,l(n) the number of partitions of the number n into at most k terms, each of which does not exceed l. Prove the equalities:

a) Pk,l(n)Pk,l1(n)=Pk1,l(nl);

b) Pk,l(n)Pk1,l(n)=Pk,l1(nk);

c) Pk,l(n)=Pl,k(n);

d) Pk,l(n)=Pk,l(kln).

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.