how would I go about proving: the sum of the first n odd numbers is equal to n^2 for every n which is greater than or equal to 1. Thanks
Follow Math Help Forum on Facebook and Google+
Originally Posted by daaavo how would I go about proving: the sum of the first n odd numbers is equal to n^2 for every n which is greater than or equal to 1. Thanks First comes the n = 1 case. (check!) Now let the theorem be true for some n = k. We need to show that it is also true for n = k + 1. By our assumption: So For your theorem to be true this must be equal to . Can you finish this? -Dan
View Tag Cloud