Precalculus (10th Edition)

Published by Pearson
ISBN 10: 0-32197-907-9
ISBN 13: 978-0-32197-907-0

Chapter 12 - Sequences; Induction; the Binomial Theorem - 12.1 Sequences - 12.1 Assess Your Understanding - Page 809: 97



Work Step by Step

We are given: $u_1=1$ Compute $u_n$ by substituting $1, 2, 3, 4, 5, 6$ for $n$ in the formula: $u_{n+1}=u_n+(n+1)$ $u_2=u_1+(1+1)=1+2=3$ $u_3=u_2+(2+1)=3+3=6$ $u_4=u_3+(3+1)=6+4=10$ $u_5=u_4+(4+1)=10+5=15$ $u_6=u_5+(5+1)=15+6=21$ $u_7=u_6+(6+1)=21+7=28$
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.