Ask
your own question, for FREE!
Mathematics
10 Online
Solve the recurrence relation \(a_n = 2^na_{n-1}\) with \(a_0 = 1\)
Still Need Help?
Join the QuestionCove community and study together with friends!
I try \(a_n = 2^n a_{n-1} = 2^n(2^{n-1}a_{n-2}) = 2^{2n-1}a_{n-2} \) Is that a step in the right direction?
If we continue your equalities, we will get: \[a _{n}=2^{n}a _{n-1}=2^{n}2^{n-1}a _{n-2}=...2^{n}2^{n-1}2^{n-2}...2^{1}a _{0}\]
so \[a _{n}=2^{(1+n)\frac{ n }{ 2 }}\]
the formula above makes sense, because: if n=0, then a_0=1 if n=1, then a_1=2 if n=3, then a_3=2^6=64 and so on... @calyne
amazing thank you
Still Need Help?
Join the QuestionCove community and study together with friends!
thank you!
Can't find your answer?
Make a FREE account and ask your own questions, OR help others and earn volunteer hours!
Join our real-time social learning platform and learn together with your friends!
Join our real-time social learning platform and learn together with your friends!
Latest Questions
Maci:
what are the best stock apps for people who want to start investing?
Twaylor:
genuienly how do i get better self control i keep watcing youtube and theres this
IzzyCookie:
|dw:1792074056138:dw| Uhm, I don't know where to ask this, but I'm in college welding at my community college, and I need help learning vertical welding for
thehearken:
not sure if this is considered spam, im sorry if it is, but does anyone have tips
3 days ago
3 Replies
2 Medals
6 days ago
3 Replies
0 Medals
1 day ago
9 Replies
1 Medal
1 week ago
2 Replies
1 Medal