## Adobe Interview Question

Developer Program Engineers**Country:**India

**Interview Type:**In-Person

nxn = n(1+(n-1));

take first n odd numbers

1+ 3+ 5...........+2n-1

now take out 1 from every number in above series except from 1.......

n + 2 +4+6+.........+2n-2

=>n+ 2(1+2+3+4.......n-1)

=>n+2 { n(n-1)/2}

=>n+ n(n-1)

=>n^2

hence proved ........... :)

How will you prove there are n numbers in sequence....1+3+5+...+2n-1 !!!

Hope question isnt silly?

nth term will be 2n-1.

- shani July 03, 2012Sumof(2n-1) for n = 1..n ==> 2(n*(n+1))/2 - n = n^2