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.

Is there a sequence of natural numbers in which every natural number occurs exactly once, and for any k=1,2,3, the sum of the first k terms of the sequence is divisible by k?

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

N points are given, no three of which lie on one line. Each two of these points are connected by a segment, and each segment is coloured in one of the k colours. Prove that if N>k!e, then among these points one can choose three such that all sides of the triangle formed by them will be colored in one colour.

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.

What will the sequence from the previous problem 61297 be converging towards if we choose x1 as equal to 1 as the initial condition?

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.