Consider the following recursive function: 8 ƒ(n) = { 2. f(n − 1) Prove that the closed form is f(n) = 2² +5n+7. if n = 0 2 ∙ f(n − 1) — 5n+3 ifn≥1

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
Consider the following recursive function:
if n = 0
f(n) = {2. f(n-1)-5n+3 ifn≥1
Prove that the closed form is f(n) = 2" +5n+7.
Transcribed Image Text:Consider the following recursive function: if n = 0 f(n) = {2. f(n-1)-5n+3 ifn≥1 Prove that the closed form is f(n) = 2" +5n+7.
Expert Solution
Step 1: Introduction of the given problem

f open parentheses n close parentheses equals open curly brackets table row 8 cell i f space n equals 0 end cell row cell 2 f open parentheses n minus 1 close parentheses minus 5 n plus 3 end cell cell i f space n greater or equal than 1 end cell end table close

steps

Step by step

Solved in 3 steps with 8 images

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,