Question

1. Find the first six terms of the recursively defined sequence Sn=3S(n−1)+2 for n>1, and S1=1...

1. Find the first six terms of the recursively defined sequence

Sn=3S(n−1)+2 for n>1, and S1=1

first six terms =

Math   Calculus   
0 0
Add a commentTranscribed image text
Next >

Homework Answers

Answer #1

Sn = 3S(n-1) + 2 ; S1 = 1

n = 2

==> S2 = 3S(2-1) + 2

==> S2 = 3S1 + 2 = 3(1) + 2

==> S2 = 5

n = 3

==> S3 = 3S(3-1) + 2

==> S3 = 3S2 + 2 = 3(5) + 2

==> S3 = 17

n = 4

==> S4 = 3S(4-1) + 2

==> S4 = 3S3 + 2 = 3(17) + 2

==> S4 = 51 + 2

==> S4 = 53

n = 5

==> S5 = 3S(5-1) + 2

==> S5 = 3S4 + 2

==> S5 = 3(53) + 2

==> S5 = 159 + 2

==> S5 = 161

n = 6

==> S6 = 3S(6-1) + 2

==> S6 = 3S5 + 2

==> S6 = 3(161) + 2

==> S6 = 483 +2

==> S6 = 485

Therefore first six terms are 1, 5, 17, 53, 161, 485

Please rate if helpful. Comment if you have any doubt.

0 0
Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Suppose that a sequence an (n = 0,1,2,...) is defined recursively by a0 = 1, a1...
Suppose that a sequence an (n = 0,1,2,...) is defined recursively by a0 = 1, a1 = 7, an = 4an−1 − 4an−2 (n ≥ 2). Prove by induction that an = (5n + 2)2n−1 for all n ≥ 0.
Let (a_n)∞n=1 be a sequence defined recursively by a1 = 1, a_n+1 = sqrt(3a_n) for n...
Let (a_n)∞n=1 be a sequence defined recursively by a1 = 1, a_n+1 = sqrt(3a_n) for n ≥ 1. we know that the sequence converges. Find its limit. Hint: You may make use of the property that lim n→∞ b_n = lim n→∞ b_n if a sequence (b_n)∞n=1 converges to a positive real number.  
. A sequence { bn } is defined recursively bn= -bn-1/2, where b1 = 3. (a)...
. A sequence { bn } is defined recursively bn= -bn-1/2, where b1 = 3. (a) Find an explicit formula for the general term of the bn = f(n). (b) Is the sequence convergent or divergent? (c) Consider the series ∑ approaches infinity and n=1 bn.  Is this series convergent or divergent? (d) If it is convergent, find its sum
Consider a sequence defined recursively as X0= 1,X1= 3, and Xn=Xn-1+ 3Xn-2 for n ≥ 2....
Consider a sequence defined recursively as X0= 1,X1= 3, and Xn=Xn-1+ 3Xn-2 for n ≥ 2. Prove that Xn=O(2.4^n) and Xn = Ω(2.3^n). Hint:First, prove by induction that 1/2*(2.3^n) ≤ Xn ≤ 2.8^n for all n ≥ 0 Find claim, base case and inductive step. Please show step and explain all work and details
Consider the sequence defined recursively by an+1 = (an + 1)/2 if an is an odd...
Consider the sequence defined recursively by an+1 = (an + 1)/2 if an is an odd number an+1 = an/2 if an is an even number (a) Let a0 be equal to the last digit in your student number, and compute a1, a2, a3, a4. (b) Suppose an = 1, and find an+4. (c) If a0 = 4, does limn→∞ an exist?
Let s1 := 1 and Sn+1 := 1 + 1/sN n element N Show that (Sn)...
Let s1 := 1 and Sn+1 := 1 + 1/sN n element N Show that (Sn) has limit L and that l can be explicitly computed. What is the limit?
. Consider the sequence defined recursively as a0 = 5, a1 = 16 and ak =...
. Consider the sequence defined recursively as a0 = 5, a1 = 16 and ak = 7ak−1 − 10ak−2 for all integers k ≥ 2. Prove that an = 3 · 2 n + 2 · 5 n for each integer n ≥ 0
Define a sequence (xn)n≥1 recursively by x1 = 1, x2 = 2, and xn = ((xn−1)+(xn−2))/...
Define a sequence (xn)n≥1 recursively by x1 = 1, x2 = 2, and xn = ((xn−1)+(xn−2))/ 2 for n > 2. Prove that limn→∞ xn = x exists and find its value.
4 terms of a sequence of partial sums are given by:   {Sn} = {27, 45, 57,...
4 terms of a sequence of partial sums are given by:   {Sn} = {27, 45, 57, 65, ...} 1. What are the first 4 terms of the corresponding series?  a0 = a1 = a2 = a3 = Find the general form of the series using summation notation and starting at k = 0. 2. Does the sequence of partial sums {Sn} converge (and to what) or diverge?
I am trying to prove that (sn) is a Cauchy sequence where |sn+1-sn| < 2-n. So...
I am trying to prove that (sn) is a Cauchy sequence where |sn+1-sn| < 2-n. So far, I have figured out that |sm-sn| <= 1/2m+1 + 1/2m+2 + ... + 1/2n. I want to try to not use the geometric series condition. My professor hinted that the right hand side is less than 2/2n but I'm not sure how to find that or how to go from here!
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT