Ask your own question, for FREE!
Discrete Math 7 Online
OpenStudy (anonymous):

The integer sequence a1, a2, a3, . . . , defined explicitly by the formula an  5n for n ∈ Z+, can also be defined recursively by 1) a1  5; and 2) an+1  an + 5, for n ≥ 1. For the integer sequence b1, b2, b3, . . . , where bn  n(n + 2) for all n ∈ Z+, we can also provide the recursive definition: 1) b1  3; and 2) bn+1  bn + 2n + 3, for n ≥ 1. Give a recursive definition for each of the following integer sequences c1, c2, c3, . . . , where for all n ∈ Z+ we have a) cn  7n

OpenStudy (anonymous):

follow example 1 exactly, replace 5 by 7

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!
Latest Questions
Arriyanalol: i need help
15 hours ago 7 Replies 1 Medal
Arriyanalol: CONGRATS to me
18 hours ago 8 Replies 2 Medals
Legomaster346: What colleges are good that are near Arab Alabama?
1 week ago 5 Replies 0 Medals
Arriyanalol: i need help
1 week ago 6 Replies 2 Medals
Arizona: does anyone know the percentage rate of 30,000 and 40,000
1 week ago 0 Replies 0 Medals
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!