(e) Show that every n ≥ 8 can be written as 3a+5b for some a, b € N.

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

Part e please

2. Prove the following, using induction:
(a) If an+1 = an/(an +1) prove that an = ao/(nao+1) for all n ≥ 0.
(b) Define fo = 0, f₁ = 1 and fn = fn-1 + fn-2 for n ≥ 2. Show that
3 fak for all k ≥ 0.
(c) Show that for 2" > 4n for n > 5.
(d) Show that 3 | 5
- 2" for all n.
(e) Show that every
n ≥ 8 can be written as 3a+5b for some a, b € N.
Transcribed Image Text:2. Prove the following, using induction: (a) If an+1 = an/(an +1) prove that an = ao/(nao+1) for all n ≥ 0. (b) Define fo = 0, f₁ = 1 and fn = fn-1 + fn-2 for n ≥ 2. Show that 3 fak for all k ≥ 0. (c) Show that for 2" > 4n for n > 5. (d) Show that 3 | 5 - 2" for all n. (e) Show that every n ≥ 8 can be written as 3a+5b for some a, b € N.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
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,