Consider the numerical pyramid below, formed by simply putting down the series of odd numbers into a pyramid.

           1
         3   5
       7   9   11
    13  15  17   19
      . . .

Find a formula for the sum of the numbers in the nth row, and prove it.

(In reply to re my solution by anand)

Anand,

I don't feel like you denigrated anything (me or my solution). :-)

Simply put: You mentioned a "generic formula". But you didn't show WHY the generic formula works. I also mentioned an equivalent formula. But after Charlie's prodding, I then demonstrated why the formula works. You didn't.

I suppose that if you showed why your "generic formula" works (rather than simply relying on it), you would find that you used your "proverbial hammer".

--- SK

Posted by SilverKnight on 2003-10-17 09:31:58