4 votes 4 votes Algorithms drdo-2008 time-complexity algorithms asymptotic-notation + – GateAspirant999 asked Feb 3, 2017 • retagged Jul 8, 2022 by Lakshman Bhaiya GateAspirant999 1.4k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Rahul Jain25 commented Feb 5, 2017 reply Follow Share Take n=33 and do summation of series you will get answer. 0 votes 0 votes hs_yadav commented Dec 24, 2017 reply Follow Share it is simple you can bound it by using ...formula of AGP for n terms... https://brilliant.org/wiki/arithmetic-geometric-progression/ 1 votes 1 votes stanchion commented Dec 24, 2017 reply Follow Share Ya, Thanks @ hs_yadav 0 votes 0 votes Please log in or register to add a comment.
3 votes 3 votes The answer is Option B. These sequences are known as arithemetico - geometric progression summation series. 1) 2) P.S: Sorry for clarity and handwriting. :) Kamal Pratap answered Apr 7, 2017 Kamal Pratap comment Share Follow See 1 comment See all 1 1 comment reply aehkn commented May 1, 2017 reply Follow Share if series is 2 + 22 +.... first term a should be 2 i think but you have taken it 1 in both cases if i am wrong correct me 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes I found this. Maybe this will help. Please correct me if I'm wrong. sumit chakraborty answered Nov 30, 2017 sumit chakraborty comment Share Follow See 1 comment See all 1 1 comment reply aaru14 commented Nov 30, 2017 reply Follow Share i did in same way but am not able to solve it? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Here's the answers to ur questions; Forrest Gump answered May 19, 2018 Forrest Gump comment Share Follow See all 0 reply Please log in or register to add a comment.