Question

For each of the following, find both a closed form representation that just depends on n,...

For each of the following, find both a closed form representation that just depends on n, like 1(a) and a recursive representation (ie. a way to define each term based on previous term/terms and knowing how it begins, like 1(b)

a. 2, 6, 10, 14....

b. 9, 3, 1, 1/3, 1/9, 1/27...

c. 1, -1, 1, -1, 1, -1.....

0 0
Add a comment Improve this question Transcribed image text
Answer #1

a)

b)

c)

Add a comment
Know the answer?
Add Answer to:
For each of the following, find both a closed form representation that just depends on n,...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT