## Calculus: Early Transcendentals 8th Edition

Published by Cengage Learning

# Chapter 1 - Problems - Page 76: 18

Proved below.

#### Work Step by Step

1 + $(2n-1)$ is $2n$. So is $3 + (2n - 3)$. And so on. This occurs with each of the $n/2$ pairings of numbers. Thus after rearranging, the sum $1 + 3 + 5 + \cdots + (2n - 1)$ is $2n\cdot (n/2) = n^2$. This can be proved more formally by induction.

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.