Answer
F(0) = 0, F(n) = F(n − 1) + n for n ≥ 1
Work Step by Step
--By Giving A Recursive Definition of f(n)
-Let F be the function such that F(n) is the sum of the first n positive integers.
-F(0) = 0
-F(n) = F(n − 1) + n
-for n ≥ 1
Discrete Mathematics and Its Applications, Seventh Edition
by Rosen, Kenneth
Published by
McGraw-Hill Education
ISBN 10:
0073383090
ISBN 13:
978-0-07338-309-5
Chapter 5 - Section 5.3 - Recursive Definitions and Structural Induction - Exercises - Page 358: 9
Update this answer!
You can help us out by revising, improving and updating this answer.
Update this answerAfter 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.
