Time remaining:
Consider the sequence a1 = 3; a2 = 5; a3 = 9; a4 = 17; a5 = 33; : : : (a) Determ

label Mathematics
account_circle Unassigned
schedule 0 Hours
account_balance_wallet $5

Consider the sequence a1 = 3; a2 = 5; a3 = 9; a4 = 17; a5 = 33; : : :

(a) Determine a (fi rst-order) recurrence relation for this sequence, and use it to fi nd a6.

(b) Find a closed formula for an for all n  1, and use induction on your recurrence from (a) to prove that

it's correct. (Hint: think about powers of 2.)

Apr 18th, 2015

The recurrence relation is to multiply the previous number by 2, then subtract 1.

So a6=65

The closed formula then is 2n-1

Plugging the numbers in the sequence into that equation will prove the equation correct

Apr 18th, 2015

Did you know? You can earn $20 for every friend you invite to Studypool!
Click here to
Refer a Friend
...
Apr 18th, 2015
...
Apr 18th, 2015
Sep 25th, 2017
check_circle
Mark as Final Answer
check_circle
Unmark as Final Answer
check_circle
Final Answer

Secure Information

Content will be erased after question is completed.

check_circle
Final Answer