Mathematical Induction: Verifying Properties of Sequences through Inductive Reasoning, Study notes of Discrete Structures and Graph Theory

This chapter explores mathematical induction, a powerful technique used to verify properties of sequences. Learn how to find the explicit formula for various sequences, understand summation and product notation, and discover properties such as merging and splitting, distribution, and telescoping series.

Typology: Study notes

Pre 2010

Uploaded on 02/13/2009

koofers-user-aiw
koofers-user-aiw 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Chapter 4
Mathematical Induction
Used to verify a property of a sequence
2,4,6,8,… for i >= 1 ai= 2i
infinite sequence with infinite distinct values
for i >= 1 bi= (-1)i
infinite sequence with finite distinct values
for 1<=i<=6 ci= i+5
finite sequence (with finite distinct values)
Finding the Explicit Formula
Figure the formula of this sequence
Different sequences with same initial values
,...
25
1
,
16
1
,
9
1
,
4
1
,
1
2)1(
12
0
3++=
+=
>=
kkb
ka
k
k
k
pf3
pf4

Partial preview of the text

Download Mathematical Induction: Verifying Properties of Sequences through Inductive Reasoning and more Study notes Discrete Structures and Graph Theory in PDF only on Docsity!

Chapter 4

Mathematical Induction

  • Used to verify a property of a sequence
  • 2,4,6,8,… for i >= 1 ai = 2i
    • infinite sequence with infinite distinct values
  • for i >= 1 bi = (-1)i
    • infinite sequence with finite distinct values
  • for 1<=i<=6 ci = i+
    • finite sequence (with finite distinct values)

Finding the Explicit Formula

  • Figure the formula of this sequence
  • Different sequences with same initial values ,... 25 1 , 16 1 , 9 1 , 4 1 1 , − −

b k k

a k

k

k

k

Summation & Product Notation

  • Sum of Items Specified
  • Product of Items Specified

^2 =^2 +^2 +^2 +^2 +^2 +^2

k =
k

2 2 ( 1 )* 2 ( 2 )* 2 ( 3 )* 2 ( 4 )* 2 ( 5 ) 5 1 Π = = k k

Variable ending point

  • n as the index of the final term
  • for n = 2
  • for n = 3

= +

n

k n k k

1

Properties

  • Merging and Splitting
  • Distribution    = = =
  • = + n k m k k n k m k n k m a k b ( a b )
  • ( k * k ) n k m k n k m k n k m Π a^ Π b Π a^ b = = = =

=

n
k m
k
n
k m

c * a k ( c * a )    = = =+ = + n k i k i k m k n k m a k a a 1 k n k i k i k m k n k m Π a^ Π a Π^ a = = =+ = 1

Factorial

  • n! = n(n-1)(n-2)2*
  • Definition

n! = n*(n-1)!