Universidad Nacional del Altiplano

CARRERA PROFESIONAL INGENIERÍA DE SISTEMAS

Análisis y Diseño de Algoritmos

Tarea 0: Repaso
Profesor: Oliver Amadeo Vilca Huayta

The due date for this assignment is Friday January 7.

If a algorithm is composed of several parts, then its complexity is the sum of the complexities
of its parts. In many cases, this is not as simple as it sounds. The algorithm may consist of
a loop executed many times, each time with a di¤erent complexity. We need techniques for
summing expressions in order to analyse such cases.

1. Prove that xn y n is divisible by x y for all natural numbers x, y (x6=y), and n.

2. Find the following sum and prove your claim.

(a) 1 2 + 2 3 + 3 4 + ::: + n(n + 1)

1
(b) 2
+ 14 + 18 + ::: + 1
2n
(c) 1 21 + 2 22 + 3 23 + ::: + n 2n

3. Prove that:
h i
n(n+1)
12 22 + 32 42 + :::( 1)n 1
2

4. Prove by induction that :

X
blog2 (j + 1)c = (n + 1) blog2 nc 2blog2 nc+1 + 2
1 j<n

Notation:
bxc Floor function. Largest integer less than or equal to x.