Answer to Question #336492 in Discrete Mathematics for Wende

Discrete Mathematics

Question #336492

Solve the following recurrence relation

a) T(n)=T(n-1) +1,for n>2 and T(1)=1

Expert's answer

T(1)=1

T(2)=1+1=2

T(3)=2+1=3

T(4)=3+1=4

T(n)=n

Learn more about our help with Assignments: Discrete Math

Comments

No comments. Be the first!

Leave a comment

Related Questions

1. If f(x)=(x+1)/x, x ≠ 0 and g(x)= 2x+3, find g°f(x)
2. Find the inverse function of (x+1)/x
3. Express the following statements using quantifiers.(2 items x 5 points) a. All cats have fleas
4. Define a set of which both {1, 3, 4} and {0, 3, 5} are subsets. Find such a set with the smallest po
5. We form the union of a set with 5 elements and a set with 9 elements. Which of the following numbers
6. What is the number of subsets of a set with n elements, containing a given element (when element bec
7. 1. A college freshman must take a science course, a humanities course, and a mathematics course. If