Computing terms yields 1, 2, 4, 8, 16, 32, 64, 128. Since Pn – Pn-1 = Pn-1, the simpler recursive rule is Pn = 2Pn-1 for n >= 3. The explicit formula is Pn = 2ⁿ⁻¹ for n >= 2 ...
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Computing terms yields 1, 2, 4, 8, 16, 32, 64, 128. Since Pn – Pn-1 = Pn-1, the simpler recursive rule is Pn = 2Pn-1 for n >= 3. The explicit formula is Pn = 2ⁿ⁻¹ for n >= 2 ...