We know that Euclid's Division lemma states if a and b are two positive integers and a>b, then a=bq+r where q and r are two integers, where the value of r is given by 0<=r<b, This principle is...
an = a+(n-1)d Where an=last term a=first term d=common difference n=number of term Note: last term is denoted by an or l Sn=n/2[2a+(n-1)d Sn=sum of all terms