Open In App

We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy

Aptitude | GATE CS 1998 | Question 60

Solve the following recurrence relation:

xn = 2xn-1 -1, n>1
x1 = 2

Answer:
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :
Aptitude
Recommended Articles
1. Aptitude | GATE CS 1998 | Question 26
2. Aptitude | GATE CS 1998 | Question 27
3. Aptitude | GATE CS 1998 | Question 56
4. Aptitude | GATE CS 1998 | Question 57
5. Aptitude | GATE CS 1998 | Question 2
6. Aptitude | GATE CS 1998 | Question 3
7. Aptitude | GATE CS 1998 | Question 4
8. Aptitude | GATE CS 1998 | Question 5
9. Aptitude | GATE CS 1998 | Question 6
10. Aptitude | GATE CS 1998 | Question 7
11. Aptitude | GATE CS 1998 | Question 8
12. Aptitude | GATE CS 1998 | Question 9
13. Aptitude | GATE CS 1998 | Question 10
14. Aptitude | GATE CS 1998 | Question 11
15. Aptitude | GATE CS 1998 | Question 12
16. Aptitude | GATE CS 1998 | Question 13
17. Aptitude | GATE CS 1998 | Question 14
18. Aptitude | GATE CS 1998 | Question 15
19. Aptitude | GATE CS 1998 | Question 16
20. Aptitude | GATE CS 1998 | Question 17
21. Aptitude | GATE CS 1998 | Question 18
22. Aptitude | GATE CS 1998 | Question 19
23. Aptitude | GATE CS 1998 | Question 20
24. Aptitude | GATE CS 1998 | Question 21
25. Aptitude | GATE CS 1998 | Question 22