GATE CSE
First time here? Checkout the FAQ!
x
0 votes
72 views

F(n) = 2F(n-1)+1 using back substitution.

Kindly explain like I'm a naive person solving this. Thanks!

 

 

asked in Algorithms by (225 points)  
closed by | 72 views

1 Answer

0 votes
answered by Veteran (35.9k points)  

Related questions

+2 votes
2 answers
1
+1 vote
2 answers
2
+1 vote
1 answer
3
asked in Algorithms by sh!va Veteran (20.4k points)   | 60 views
Top Users Feb 2017
  1. Arjun

    4898 Points

  2. Bikram

    4102 Points

  3. Habibkhan

    3748 Points

  4. Aboveallplayer

    2986 Points

  5. sriv_shubham

    2288 Points

  6. Smriti012

    2222 Points

  7. Arnabi

    1946 Points

  8. Debashish Deka

    1920 Points

  9. mcjoshi

    1614 Points

  10. sh!va

    1462 Points

Monthly Topper: Rs. 500 gift card

20,793 questions
25,951 answers
59,557 comments
21,976 users