Problems

Age
Difficulty
Found: 31

Prove that for any natural number a1>1 there exists an increasing sequence of natural numbers a1,a2,a3,, for which a12+a22++ak2 is divisible by a1+a2++ak for all k1.

Which term in the expansion (1+3)100 will be the largest by the Newton binomial formula?

The Babylonian algorithm for deducing 2. The sequence of numbers {xn} is given by the following conditions: x1=1, xn+1=12(xn+2/xn) (n1).

Prove that limnxn=2.

The iterative formula of Heron. Prove that the sequence of numbers {xn} given by the conditions x1=1, xn+1=12(xn+k/xn), converges. Find the limit of this sequence.

Method of iterations. In order to approximately solve an equation, it is allowed to write f(x)=x, by using the iteration method. First, some number x0 is chosen, and then the sequence {xn} is constructed according to the rule xn+1=f(xn) (n0). Prove that if this sequence has the limit x=limnxn, and the function f(x) is continuous, then this limit is the root of the original equation: f(x)=x.

The algorithm of the approximate calculation of a3. The sequence {an} is defined by the following conditions: a0=a>0, an+1=1/3(2an+a/an2) (n0).

Prove that limnan=a3.

The sequence of numbers {an} is given by a1=1, an+1=3an/4+1/an (n1). Prove that:

a) the sequence {an} converges;

b) |a10002|<(3/4)1000.