One useful way of defining sequences is ...

One useful way of defining sequences is by a recursion
relation. Many recurrence relations can be transformed
to some know sequences, say GP or sometimes nth
term can be found by algebraic jugglery
If
'a_(1)' = 1, `a_(n) - a_(n-1) = 1` for every positive integer greater
than 1, then `a_(1) + a_(2) + a_(3) + ...a_(100)` rquals

Similar Questions

Explore conceptually related problems

If a_(1), a_(2) …… a_(n) = n a_(n - 1) , for all positive integer n gt= 2 , then a_(5) is equal to

find first 5 terms of the sequences, defined by a_(1) =-1 , a_(n) = ( a_(n-1))/n " for n ge 2

In a sequence, the n^(th) term a_(n) is defined by the rule (a_(n-1) - 3)^(2), a_(1) = 1 what is the value of a_(4) ?

Find the indicated terms in each of the following sequences whose n^(th) terms are a_(n) = (a_(n-1))/(n^(2)) , (n ge 2) , a_(1) =3 , a_(2) , a_(3)

If 1,a_(1),a_(2),...,a_(n-1) are the nth roots of unity then prove that (1-a_(1))(1-a_(2))(1-a_(3))=(1-a_(n-1))=n

If a_(1)=1, a_(2)=1, and a_(n)=a_(n-1)+a_(n-2) for n ge 3, find the first 7 terms of the sequence.