This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 1 cak
i 1 c
i k 1 ak
c
1 1 ca1. Step 1: x
i 1 3 3 3 x 2.7591 x 3 3 Step 2: Suppose cak
k 1 k 1 ak. Then cak
k 1 i 1 k 1 cak
k 1 cak ak c c c ak i k 1 i 1 k 1 ak
1 i Step 2: or 0.2409, 0.2391. 3 cak . 1 3 3.2391 1 ak The value of 2.7591 0.2391. x which assures x 3.2391 is the smaller value, The mathematical induction principle how guarantees the original formula for every positive integer n. (d) Step 1: The formula c
k 1 n 3. Step 1: x n c holds for n 1, 3 3 x x 3 3 3 because
k 1 c c 1 Step 2: From the graph, 1 c
i k 1 2.61 0.39, 0.39. c. or...
View
Full
Document
This note was uploaded on 10/05/2011 for the course MAC 1147 taught by Professor German during the Spring '08 term at University of Florida.
 Spring '08
 GERMAN

Click to edit the document details