1. The problem statement, all variables and given/known data
We are given the sequence r defined by: r1 = 1, and rn = 1 + rfloor(√n)
, n≥2
We need to show by induction that rn is O (log2 (log2 n)).
3. The attempt at a...
Complete Induction Proof
Complete Induction Proof
We are given the sequence r defined by: r1 = 1, and rn = 1 + rfloor(√n)
, n≥2
We need to show by induction that rn is O (log2 (log2 n)).
3. The attempt at a...
Complete Induction Proof
Complete Induction Proof
0 commentaires:
Enregistrer un commentaire