MAD 2104 Midterm: MAD 2104 FIU ds Test 2aspr 00

21 views4 pages
15 Feb 2019
School
Course
Professor

Document Summary

General directions: what is requested. sentences and use notation correctly. proofs as complete as possible. or incomprehensible is worthless. Suppose matrices a, b, and c are as given below. Ct : (10 pts. ) computation that answers each of the following questions. Page 2 of 4: (15 pts. ) by f(0) = 1 and f(n+1) = (a) suppose f is a function defined recursively f(n) + 5 for n = 0,1,2,3, Then f(1) = f(2) = f(3) = f(4) = (b) give a recursive definition of the sequence {an}, where n = 1,2,3, if an = 2n + 1. quantification used in the induction step. ] Induction step: (c) give a recursive definition of the set s of positive integers that are multiples of 3. Let {an} be defined by the formula n = 1,2,3, Define the sequence {bn} recursively by b1 = 7 and bn+1 = bn + 5 for n = 1,2,3, an = bn for n = 1,2,3,

Get access

Grade+
$40 USD/m
Billed monthly
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
10 Verified Answers

Related Documents

Related Questions