Let bi, b2, 63, ... be the sequence defined by the following recurrence relation. bk = 5 · bk-1 + 1 where bi = 1 and k ≥ 2. Use the method of iteration to "guess" an explicit formula for the nth term of the recursively defined sequence.
Use mathematical induction to prove that the explicit formula you found in question above is correct