0 votes 0 votes Which recurrence relation satisfy the sequence: 2, 3, 4, . . ., for n ≥ 1. A ) T(N) = 2 T(N-1) - T(N-2) B)T(N) = T(N-1) + T(N-2) C)T(N) = N+1 D) None of these Mathematical Logic recurrence-relation + – Jaspreet Kaur Bains asked Dec 19, 2017 Jaspreet Kaur Bains 2.2k views answer comment Share Follow See all 11 Comments See all 11 11 Comments reply Show 8 previous comments Jaspreet Kaur Bains commented Dec 25, 2017 reply Follow Share rajoramanoj we have to find recurrence relation ( which calls itself) not solution of this recurrence relation. that 's why c i wrong. 0 votes 0 votes joshi_nitish commented Dec 25, 2017 reply Follow Share @akb1115 A) is correct. take base condition as T(0)=1 and T(-1)=0 T(1) = 2T(0) - T(-1) = 2 T(2) = 2T(1) - T(0) = 3.......and so on. 1 votes 1 votes ProtonicRED commented Oct 9, 2020 reply Follow Share There should be a base condition like T(1)= …. Or T(0)=….. , 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Since it is given that n>=1, we cannot assume T(0) or T(-1) just take base conditions as T(1)=2 and T(2)=3 then option A is correct. Rohit Suryanarayan answered Aug 8, 2019 Rohit Suryanarayan comment Share Follow See all 0 reply Please log in or register to add a comment.