About

I am too Lazy to update about me.

Role

Alma Mater:

Not updated.

Experience:

Not updated.

No Notifications so far .......!!!

virtualgate's picture
Virtual GATE
shreyans's picture
Shreyans Dhankhar

<div class="tex2jax">Oops...!! No one is following you.</div>

28 Jan 2015 - 9:45pm

can solve tis by solvng bellow recursive equatin

 Nth term=T(N)=  T(N-1)+2(N-1)  , if n>1

                            2                       , if n=1

so,  T(N)=   T(N-1) + 2(N-1)

              = T(N-K)+ 2(N-K)+2(N-K+1)+2(N-K+2)+ .............+2(N-3)+2(N-2)+2(N-1)

            =   2 +2(1+2+3+............+K)   ,  TAKNG N-K =1

       =   2+ 2(K(K+1)/2)=  2+ K(K+1)=2+ (N-1)*N  ,,, AS K=N-1,

        So, T(100) = 2+ (100-1)100= 9902 :)

 

more less