Find the first five terms of the sequence specified by the recursion formula $a_{k + 1} = 3 a_{k}$ , if $a_{1} = 2$ .

Open in App

Solution

Given, $a_{k + 1} = 3 a_{k}$ and $a_{1} = 2$
$a_{2} = 3 a_{1} = 3 \times 2 = 6$
$a_{3} = 3 a_{2} = 3 \times 6 = 18$
$a_{4} = 3 a_{3} = 3 \times 18 = 54$
$a_{5} = 3 a_{4} = 3 \times 54 = 162$

Suggest Corrections

Similar questions

a_{k + 1} = a_{k} + 3

a_{1} = 7

a_{k + 1} = a_{k} + 3

a_{1} = 7

a_{1} = 2, a_{2} = 3 + a_{1}

a_{n} = 2 a_{n - 1} + 5

n > 2

a_{1} = 3, a_{n} = 3 a_{n - 1} + 2

n > 1

a_{1} = 1, a_{n} = a_{n - 1} + 2, n > 1

Join BYJU'S Learning Program