

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Instructions and problems for a university-level mathematics homework assignment focused on power series expansions and recurrences. Students are expected to review calculus ii material related to power series, differentiation, integration, and finite and infinite geometric series. The homework includes problems requiring the use of the characteristic equation method to solve recurrences, as well as problems dealing with the fibonacci sequence. The due date is march 31, and the instructor plans to have an open house after spring break.
Typology: Assignments
1 / 2
This page cannot be seen from the preview
Don't miss anything!


The generating function method of Section 6.4, which I will cover right after the break, depends on some knowledge about power series. This is Calculus II material, and you should review it in preparation for Section 6.4. In particular, review the following:
Note that convergence tests, which are covered ad nauseum in calculus classes, are not rele- vant here. Also, not particularly important is the explicit computation of a the coefficients power series expansion for a given function f (x) by the formula an = f (n)(0)/n!. The important thing is that you know, and be able to recognize, some basic power series expansions like those listed above, and that you can manipulate these series, e.g., via differentiation, integration, or multiplication of power series. This material is covered in Chapter 10 (mainly Sections 10.8 and 10.9) of Edwards/Penney, or in pretty much any calculus book.
āTurn page for HW 8 Problemsā
All problems are from Section 6.2. Most problems require solving a recurrence via the characteristic equation method of this section.
(a) Use the characteristic equation method to derive a formula for an, then show that this formula agrees with the asserted one, taking into account the explicit formula for the Fibonacci sequence. (b) For the second proof, proceed as indicated in the problem, by use induction to show that the asserted formula holds for all n. This is an good (and rather easy) refresher on induction poofs, and you should pay attention to your write- up, which should be in a logically correct order, and include any necessary hypotheses.