Induction Proofs

Induction Proofs - Math 100 Induction and Sums 1 Some Sums...

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

View Full Document Right Arrow Icon
Math 100 Induction and Sums Martin H. Weissman 1. Some Sums Suppose that a 0 ,a 1 ,a 2 ,... is a sequence of real numbers. Then, one may create a new sequence, by summation: for all natural numbers n , define: s n = n X i =0 a i . One could define the sequence s n recursively as following: The first term is defined by s 0 = a 0 . For all n N , if n > 0, then s n = a n + s n - 1 . First, we will experiment with summation. Given the following sequences, determine the sequence of sums: (1) 1 , 2 , 4 , 8 , 16 , 32 ,... (2) 1 , 3 , 5 , 7 , 9 , 11 ,... (3) 0 , 1 , 2 , 3 , 4 , 5 , 6 ,... (4) 1 / 2 , 1 / 6 , 1 / 12 , 1 / 20 ,... (5) 1 , 1 / 2 , 1 / 4 , 1 / 8 , 1 / 16 ,... Can you guess formulas for the sequences of sums? Today, we’ll spend some time proving these formulas. After guesses are made, we’ll prove the guesses, using the following proof as a template. Theorem 1. Let a 0 ,a 1 ,a 2 ,... be the sequence, which satisfies a n = 2 n for all natural numbers n . Let s n = n i =0 a
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 04/17/2008 for the course MATH 100 taught by Professor Weissman during the Fall '08 term at UCSC.

Page1 / 2

Induction Proofs - Math 100 Induction and Sums 1 Some Sums...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online