Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - 3.2 - Attributes of Algorithms - Practice Problems - Page 97: 1

Answer

The numbers from $1\ to\ n$, where $n$ is $even$, can be grouped into $n/2$ pairs of the form $1 + n = n + 1$ $2 + (n - 1) = n + 1$ $… $ $n /2 + (n/2 + 1) = n + 1 $ giving a sum of $(n/2)(n + 1)$. This formula gives the correct sum for all cases shown, whether $n$ is $even$ or $odd$.

Work Step by Step

The numbers from $1\ to\ n$, where $n$ is $even$, can be grouped into $n/2$ pairs of the form $1 + n = n + 1$ $2 + (n - 1) = n + 1$ $… $ $n /2 + (n/2 + 1) = n + 1 $ giving a sum of $(n/2)(n + 1)$. This formula gives the correct sum for all cases shown, whether $n$ is $even$ or $odd$.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

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.