This preview shows page 1. Sign up to view the full content.
Unformatted text preview: ) g j ( x ) . 1.16 Prove, for every n ∈ N , that ( 1 + x ) n ≥ 1 + nx whenever x ∈ R and 1 + x > 0. Solution. We prove the inequality by induction on n ≥ 1. The base step n = 1 says 1 + x ≥ 1 + x , which is obviously true. For the inductive step,...
View
Full
Document
This note was uploaded on 12/21/2011 for the course MAS 4301 taught by Professor Keithcornell during the Fall '11 term at UNF.
 Fall '11
 KeithCornell

Click to edit the document details