{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# hw5 - EE 369 Homework 5 = REMINDER Collaboration must be...

This preview shows pages 1–2. Sign up to view the full content.

EE 369 Homework 5 ============================================================================== REMINDER: Collaboration must be acknowledged and must end before writing begins (on each problem separately). See the initial course information handout. ============================================================================== In preparing your solution, please use the abbreviations described in previous homeworks or request a new abbreviation by email. READING: Please read Sections 2.4, 2.5 and 3.1 in the Gersting textbook and the handout on recurrence relations. OUTCOMES: All problems apply to your course outcome 3 score. THE ASSIGNMENT: Solve the following. 4 points per problem. (in card problems where cards hold numerical values, an Ace is ONE) From Section 2.4: problems 10, 12, 17, 46 From Section 2.5: problems 2, 3, 8 From Section 3.1: problems 83, 86 The following problems test what we covered in class that is not in the book: E1. The Lucas numbers are given by L(n) = L(n-1) + L(n-2) with L(0)=2, L(1)=1. (a) Show that L(n) = F(n-1) + F(n+1) for n > 1 and F() the Fibonacci num's (b) Give an explicit formula for L(n) E2. Find the solution to S(n) = 2S(n-1) + S(n-2) - 2S(n-3) for n>2, with

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 2

hw5 - EE 369 Homework 5 = REMINDER Collaboration must be...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online