Discrete Structure Chapter 3 Mathematical Induction-68

Chapter 3
Mathematical Induction
Outline
Sequences
Division Algorithm
Euclidean Algorithm
Prime Factorization
Examples
Sequence
Eg: Finding Terms of Sequences Given by Explicit Formulas
Define sequence a1 , a2 , a3 , . and b2 , b3 , b4 , by the following

explicit formulas:
ak =
k / (k + 1)
bi = (i 1 )/ i
for all integers k > 1

for all integers i > 2
Solution:
1 2 3
, , ,...
2 3 4
Alternating Sequence
An Alternating Sequence
Compute the first six terms of the sequence c0 , c1 , c2 ,
. defined as follows:
c (1)
for all integers j > 0
Soln:
c (1)
c , c , c , c ,...
1, -1,1,-1,
4
Explicit Formula
Eg: Finding an Explicit Formula to Fit Given Initial Terms
Find an explicit formula for a sequence that has the following initial terms:
1 , - (1/4) , (1/9) , - (1/16) , (1/25) , - (1/36) , .
Soln:
a (1)
i
i 1
1
, i 1, i Z
i
2
Summation
Eg: Computing Summations
Let a1 = -2 , a2 = -1 , a3 = 0 , a4 =1 , and a5 = 2 . Compute the following:

2
a)
ak
ak
b)
k=1
a 2k
c)
k=2
k=1
Soln:
a a a a a
1
a)
2 1 0 1 2
0
Summation formula
Eg: When the Terms of a Summation are given by a Formula
Compute the following summation:

5
k2
k=1
Soln:
12 2 2 32 4 2 52
55
Summation Expansion
Eg: Changing from summation Notation to Expanded Form
Write the following summation in expanded form:

n
(-1) i
i=0
i+1
Soln:
1,-1/2, 1/3, -1/4, 1/5, , (-1)n /(n+1)

8
Expanded Form
Eg: Changing from Expanded Form to summation Notation
Express the following using summation notation:

1
n+1
n+2
n+1
2n
Soln:
n
(i+1)/(n+i)
i=0
9
Eg: a) Rewrite the following summation and separate off the final term:
n
i=1
1
i2
a) 1, , 1/9, , 1/n2
b) Write the following as a single summation:

n-1
i=1
Soln:
1 + 2n
i2
b) n=4: 1+16, +16, 1/9 + 16

10
Product Notation
Product Notation ( ):
Eg:
5
1.
ak= a1a2a3a4a5
k=1
n
2.
a k = am . a m+1 . a m+2 . ..a n

k=m
1
3.
k / (k+1) = 1 / (1 + 1) = 1/2
k=1
11
Theorems
Properties of Summations and Products
Theorem:
If a m , a m+1 , a m+2 , and b m , b m+1 , b m+2 , are sequences of real numbers and c
is any real number, then the following equations hold for any integer n > m :
1.
2.
k=m
k=m
k=m
a k + b k = (a k + b k)
n
c. ak
k=m
3.
= c.ak
generalized distributive law
k=m
k=m
k=m
k=m
( ak )(bk)= (ak.bk)
12
Eg: Let a k = k + 1 and b k = k 1 for all integers k . Write each of the

following as a single summation or product:
a)
b)
Soln:
k=m
k=m
ak + 2. bk
n
( ak )(bk)
k=m
k=m
13
Change of Variable
Eg: Change of variable
3
a)
k2 =
12 + 2 2 + 3 2
k =1
b) i 2 = 12 + 2 2 + 3 2
i =1
k =1
k =1
Observe that: k 2 = i 2
14

4
a)
(j 1) 2 = (2 1)2 + (3 2) 2 +(4 1) 2
j =2
= 12 + 2 2 + 3 2
b) i 2 = 12 + 2 2 + 3 2
k =1
Observe that: (j 1)
j =2
= i2
k =1
15
Transforming the following summation by making the specified change of

variable:
6
1/(k+1)
change j = k + 1
k =0
Soln:
7
(1/j)
J=1
16
Transforming the following summation by making the specified change of

variable:
n+1
k / (n + k)
change j = k - 1
k =1
Soln:
n
(j+1)/(j+n+1)
J=0
17
Mathematical Induction most basic methods
of proof to establish the truth of a statement
about all the natural numbers or, sometimes
all sufficiently large integers.
18
Principle
Principle of Mathematical Induction
Let S(n) be a property that is defined for integers n, and let a be a
fixed integer. If
1. S(a) is true, and,
2. for all integers k > a , if S(k) is true then S(k+1) is true.
Then the statement, for all integers n > a , S(n) is true.
19
Proof by Mathematical Induction

Consider a statement of the form, For all integers n > a , a property S(n) is
true.
To prove such a statement, perform the following steps:
Step 1(basis step):
Show that S(n) is true for n = a.
Step 2(Inductive step):
2.1 Assume S(n) is true for n = k, and,

2.2 show that for all integers k > a , S(n) is
true for n = k + 1.
Step 3: Then, S(n) is true for all n > a.
20
Eg: Sum of the First n Integers

Use mathematical Induction to prove that:
1 + 2 + 3 +.+ n = n ( n + 1 )
for all integers n > 1
2
Soln:
21
Eg: Sum of a Geometric Sequence
n
Prove that r i = r n + 1 - 1
i=0
r1
for all integers n > 0 and all real numbers
r except 1.
Soln:
22
Eg: Proving a Divisibility Property
Use mathematical induction to prove that for all integers n > 1 , 2 2n 1 is
divisible by 3.
Soln:
23
Eg: Proving an Inequality
Use mathematical induction to prove that for all integers n > 3 , 2n + 1 < 2 n
Soln:
24
Eg: Proving a Property of a sequence
Define a sequence a1 , a2 , a3, . as follows:
a1 = 2
a k = 5 a k1
for all integers k > 2.
a. Write the first four terms of the sequence.

b.
Use mathematical induction to show that the terms of the sequence satisfy the
property a n = 2 . 5 n 1
for all integers n > 1 .
Soln:
a.
2, 5(2), 5(10), 5(50), 5(250) =2,10,50,250,1250
25
Eg: Prove that for each n Z +
n
i 2 = n ( n + 1) ( 2n + 1)
i=1
Soln:
26
Eg: If n Z + , establish the validity of the open statement
n
S(n) : i = 1 + 2 + 3 + . + n = n 2 + n
i=1
Soln:
See slide 21
27
Eg: Let us consider the sums of consecutive odd positive integers
1) 1
=1
(12 )
2) 1 + 3
=4
(22 )
3) 1 + 3 + 5
=9
(32 )
(42 )
4) 1 + 3 + 5 + 7 = 16
The sum for the first n consecutive odd positive integers is n 2 , that is for all
n Z + . Prove S(n) by using mathematical induction.
n
S(n) : (2i 1) = n 2
Soln:
i=1
OK
28
Eg:
4n
n2-7
4n
n2-7
1
2
3
4
4
8
12
16
-6
-3
2
9
5
6
7
8
20
24
28
32
18
29
42
57
From the table above, the values of 4n and n2-7 are listed where 1 < n < 8 .
From the table, observe that
Prove that S(n): 4n < (n2-7)
(n2-7) < 4n
for n = 1 , 2 , 3 , 4 ,5
4n < (n2-7)
for n = 6 , 7 , 8
for n > 6
Soln:
29
Eg: Sequence of Harmonic numbers is given below:
H1 = 1
H2 = 1 + = 3/2
H3 = 1 + + 1/3 = 11/6
Note: Hk+1 = Hk + 1/(k+1)
In general, Hn = 1 + + 1/3 + . + 1/n for each n Z +

Or
H(n) = Hj = (n + 1) Hn n for all n Z + .
n
Provej =
H(n)
1 by using mathematical induction.
Soln:
H(1) = 1
H(2) = H1 + H2 = 1 + (1+1/2) = 5/2
H(k+1) = [(k+1)Hk k] + Hk+1 =(k+1)[Hk+11/(k+1)]k +H
k+1
30
Division Algorithm
Divisibility: The Division Algorithm
Def: If a and b are integers with b 0 , we say that b

divides a, and we write b | a , if there is an integer c
such that a = bc. When this occurs we say that b is a
divisor of a or a is a multiple of b.
We write a | b when a does not divide b.
When ab = 0 for a , b Z then either a = 0 or b = 0
When 2x = 2y , x = y for x , y Z
31
Divisibility: The Division Algorithm

Eg: Determine whether 3 | 7 and whether 3 |12.
Soln:
32
Divisibility : The Division Algorithm
Theorem: Let a , b , and c be integers. Then

1. If a | b and a | c then a | (b + c).
2. If a | b then a | bc for all integers c.
3. If a | b and b | c then a | c .
33

Theorem: For any a , b , c Z
a)
1| a and a| 0
b) [(a | b) (b | a) ] a = b
c)
[(a | b) (b | c) ] a | c
d) a | b a | bx , for all x Z
e)
If x + y = z , for some x , y , z Z and a divides two of the three

integers, then a divides the remaining integer.
f)
[ (a | b) (a | c) ] a | (bx + cy) , for all x , y Z
g) For 1 < i < n , let ci Z . If a divides each ci , then

a |(c1x1 + c2x2 ++ cnxn) , where xi Z for all 1 < i < n .
34

Eg: Let a, b in Z so that 2a+3b is a multiple of 17. Prove that 17 divides 9a+5b.
Soln:
17|17(a+b) i.e 17|17a+17b
17|2a+3b 17|(-4)[2a+3b] i.e 17|-8a-12b
Hence, 17|(17a+17b) + (-8a-12b)
i.e. 17|9a+5b (qed)
35

For all integers in Z+ , n Z+ and n > 1 ; n has at least two positive
divisors, namely 1 and n itself.

Some integers, such as 2 , 3 , 5 , 7 , 11 , 13 and 17 have exactly two positive
divisors. These integers are prime numbers. All other positive integers greater
than 1 and not prime are called composite number.
36

Consider 17 | 58
divisor)
then 58 = 3 (17) + 7 (remainder must be less than the
37

Theorem: (The Division Algorithm)
If a , b Z , with b > 0 , then there exist unique q , r Z with a=qb + r where 0 < r < b
a: dividend
b: divisor
q: quotient
r: remainder
Eg: a) a = 170 , b = 11
b) a = 98 , b = 7
c) a = - 45 , b = 8
a) 170 = 15(11) + 5
b) 98= 14(7) + 0
c) -45 = -6(8) + 3
a
45
45
-45
-45
b
8
-8
8
-8
q
5
-5
-6
6
r
5
5
3
3
38

Eg: Verify that a = qb + r in each of the following cases and, in the process, notice that
q is not always what we might expect ( where 0 < r < |b| )
a
58
58
-58
-58
17
-17
17
-17
3
-3
-4
4
7
7
10
10
39

Eg: Find integers q and r with 0 < r < |b| such that a = qb + r in each of the following
cases:
a) a = 500 ; b = 17
b) a = -500 ; b = 17
c) a = 500 ; b = -17
d) a = -500 ; b = -17
Soln:
a)
b)
c)
d)
500 = 29(17) + 7
-500 = -30(17) +10
500 = -29(-17) + 7
-500 = 30(-17) + 10
40

Theorem: (The Division Algorithm)
If a , b Z with b > 0 , then there exist unique q , r Z with a = qb + r where 0< r<b
Eg: Find the quotient q and the remainder r and write a = qb + r

a) When a = 9 is divided by b = 7
b) When a = 589,621 is divided by b = 7893
c) When a = 11,109,999,999 is divided by b = 1111
Soln:
a) 9 = 1(7) + 2
b) 589621 = 74(7893) +5539
c) 11109999999 = 9999999(1111)+1110
41
GCD:Euclidean Algorithm
The Greatest Common Divisor: the Euclidean Algorithm
Def: For a, b in Z, a position integer c is said to be a common divisor of a and b if

c|a and c|b.
Eg: Find common divisor of 42 and 70.
D(42) = 1, 2, 21, 3,14, 6,7
D(70) = 1, 2, 35, 5, 14, 7, 10
CD(42,70) = 1, 2, 7, 14
70 = 1(42) + 28
42 = 1(28) + 14
28 = 2(14) + 0
Gcd(42,70)=14
Def: (Greatest Common Divisor)

For any common divisor d of a and b, we have d|c. Then c is a greatest common
divisor of a and b.
Theorem: For any a,b in Z+, there exists a unique c in Z+ that is the greatest
common divisor of a and b.
42
Eg: Find the greatest common divisor of 30 and 24.

Soln:
30 = 1(24) + 6
24 = 4(6) + 0
Hence gcd(24,30) = 6
43
Note:
1. gcd (a , b) = gcd (a ,-b) = gcd (-a ,b) = gcd (-a ,-b) for a , b Z
2. For each a Z , if a = 0 , then gcd (a , 0) = | a |
3. Integers a and b are relatively prime when gcd ( a , b ) = 1
4. If c is gcd (a , b ) then c = ax + by where x , y , a , b , c Z
44
Theorem: gcd(a,b) is the smallest positive integer we can write as a linear

combination of a and b.
Integers a and b are called relative prime when gcd(a,b)=1.That is, when there exist
x,y in Z with ax+by=1.
Eg: Since gcd (42 ,70) = 14 , we can find x , y in Z with 42 x + 70 y = 14, or
3 x + 5 y = 1.
By inspection, x = 2, y = -1 is a solution. But, general solution?
x = (1/3) (5/3) y
y = (1/5) (3/5) x
45
Let a , b be positive integers and let c = a mod b . Then

gcd (a,b) = gcd (b,c)
OR
gcd (a , b) = gcd ( b , a mod b)
e.g. Let a=27 and b = 12, so 27 mod 12 = 3 = c

Gcd(27,12) = gcd(12,3) = 3
46

Eg: Find gcd (689,234)
Soln:
689 = 2(234) + 221
234 = 1(221) + 13
221 = 17(13) + 0
Hence gcd(689,234) = 13
47

Theorem: Euclidean Algorithm
+
If a , b Z , we apply the division algorithm as follows:

a q1b r1 , 0 r1 b
b q 2 r1 r2 , 0 r2 r1
r1 q 3r2 r3 , 0 r3 r2
ri q i 2 ri1 ri 2 , 0 ri 2 ri1
rk 3 q k 1rk 2 rk 3 , 0 rk 1 rk 2
rk 2 q k rk 1 rk , 0 rk rk 1
rk 1 q k 1rk
Then rk , the last nonzero remainder, equals gcd( a , b).
48

Eg: Find gcd (689,234) using Euclidean Algorithm. Also, find x and y where
ax + by = d is a linear combination of a and b.
(a = 689 ; b = 234 ; d = gcd(689,234) )
Soln:
689 = 2(234) + 221
234 = 1(221) + 13
221 = 17(13) + 0
13 = 234 1(221)
= 234 - 1[689-2(234)]
= 3(234) -1(689)
Hence gcd(689,234) = 13
13 = 689x
+ 234y
= 689(-1) +234(3)
49

Eg: Find gcd (431,29) using Euclidean Algorithm. Find x and y if 431 and 29
is express as a linear combination.
ax + by = gcd (431,29)
(where a = 431 ; b = 29)
Soln:
431 = 14(29) + 25
29 = 1(25) + 4
25 = 6(4) + 1
hence gcd(431,29) =1
1 = 431x + 29y
1 = 431(7) +29(-104)
1=25 6(4)
=25 6 (29-1(25))
=25 6(29) + 6(25)
=7(25) 6(29)
=7(431-14(29)) 6(29)
=7(431) (104)(29)
50
Eg: Find gcd(250,111)=?
250 111
*2 222
28
84
27
*1 27
1
gcd(250,111)=1, what is x, and y such

that 250x+111y=1?
*3
1 =28-1(27)
=28-1[111-3(28)]
=(-1)111+4(28)
=(-1)111+4[250-2(111)]
=4(250)+(-9)(111)
x = 4, y = -9
51

Eg: For any n in Z+, prove that 8n+3 and 5n+2 are relative prime.
Soln:
8n+3 5n+2
5n+2
3n+1
3n+1
2n+1
2n+1
n
2n
1
gcd(8n+3,5n+2)=1. But we could also arrived at this

conclusion if we had noticed that
(8n+3)(-5)+(5n+2)(8)=1
8n+3=1(5n+2) + (3n+1)
5n+2=1(3n+1) + (2n+1)
3n+1=1(2n+1) + n
2n+1=2(n) + 1
Gcd(8n+3,5n+2)=1
1=(2n+1) 2n
=(2n+1) 2[(3n+1)-1(2n+1)]
=3(2n+1) 2(3n+1)
=3[(5n+2)-1(3n+1)]-2(3n+1)
=3(5n+2) -5(3n+1)
=3(5n+2) -5[(8n+3)-1(5n+2)]
52
1 =8(5n+2) -5(8n+3)
Eg: Griffin has two unmarked containers. One container holds 17 ounces and
the other holds 55 ounces. Explain how Griffin can use his two containers to
have exactly one ounce.
Soln:
Gcd (17 , 55) = 1 , 1=13(17)-4(55),
Consequently, Griffin must fill his smaller container 13 times and empty the
contents into the larger container. Affer 12 times filling from small container to
the bigger container, 12(17) =204 and 3(55) = 165 i.e. 39 oz left in bigger
container.
The 13th times of smaller container, 17 -16 = 1 oz left

in small container.
55=3(17) + 4
17=4(4) + 1
4 =4(1) + 0
Gcd(55,17) =1
1 = 17 4(4)
= 17 4[55-3(17)]
53
= 13(17) 4(55)

Eg: An executive buys $2490 worth of presents for the children of her employees. For
each girl she gets an art kit costing $33; each boy receives a set of tools costing $29.
How many presents of each type did she buy?
Soln:
2490 =33x + 29y find x & y positive integers.
33 = 1(29) + 4
29 = 7(4) + 1
4 = 4(1) + 0
Gcd(33,29)=1
1= 29 7(4)
= 29 7[33-1(29)]
=33(-7) +29(8)
2490=33(2490)(-7) +29(2490)(8)
=33(-17430) + 29(19920)
54
***The Solutions***
2490 = 33x + 29y

= 33x + 29y
= 33(-17430) + 29(19920)
= 33(-17430 + 29k) + 29(19920 - 33k)
X = -17430 + 29k >= 0
Y = 19920 - 33k >= 0
17430/29 =< k <= 19920/33
601.03 < k < 603.6
Therefore k= 602 and 603
k=602
x = -17430 + 29(602) = 28
y = 19920 - 33(602) = 54
k=603
x = -17430 + 29(603) = 57
y = 19920 - 33(603) = 21
55

Eg: After a weekend at the Mohegan Sun Casino, Gary finds that he has won $1020 --in $20 and $50 chips. If he has more $50 chips than $20 chips, how many chips of each
denomination could he possibly have?
Soln:
x = 102 - 2n >= 0
1020 = 50x + 20y
y = -204 + 5n >= 0
102 = 5x + 2y
5 = 2(2) + 1
2 = 2(1) + 0
Gcd(5,2) = 1
1 = 5(1) +2( 2)
102 = 5(102) +2( 204)
= 5(102-2n) + 2(-204+5n)
x>=0, y>=0 x >y

204/5 =< n <= 102/2
40.8 =< n <= 51.0
Therefore, n=41, 42,,51
Answers:
n=41 (20,1)
n=42 (18,6) and
n=43 (16,11)
56

Eg: Assisting students in programming classes, Brian finds that on the average he can
help a student debug a Java Program in 6 minutes, but it takes 10 minutes to debug a
program written in C++. If he works continuously for 104 minutes and doesnt waste
time, how many programs can he debug in each language?
Soln:
6x + 10y = 104
3x + 5y = 52
5 = 1(3) + 2
3 = 1(2) + 1
2 = 1(2) + 0
Gcd(3,5) = 1
1= 3 1(2)
= 3 1[5-1(3)]
= 3(2) + 5(-1)
So,
52 = 3(104) + 5(-52)
52 = 3(104 - 5n) + 5(-52+3n)
57
58
Solving Diophantine Eqns.
104 = 6x + 10y
52 = 3x + 5y
52 = 3(104) + 5(-52)
= 3(104-5n) + 5(-52+3n)
X= 104 5n >= 0
Y = -52 + 3n >= 0
52/3 =< n <= 104/5
17.3 < n < 20.8
Therefore n=18, 19 and 20
N=18
x= 104 - 5(18) = 14
y= -52 + 3(18) = 2
N=19
x= 104 - 5(19) = 9
y= -52 + 3(19) = 5
N=20
x= 104 - 5(20) = 4
y= -52 + 3(20) = 8
59
Prime Factorization
The Prime Factorization
Eg: Find the prime factorization for 980,220.

Soln:
980220 = (2)(490110)
= (2)(2)(245055)
= (2)(2)(3)(81685)
= (2)(2)(3)(5)(16337)
= (2)(2)(3)(5)(17)(961)
= (2)(2)(3)(5)(17)(31)(31)
= 22 31 51 171 312
Primes 2,3,5,7,11,13,17,19,23,29,31,37, 41,43,47, 53,
60

Theorem: (The fundamental theorem of arithmetic) Every integer n>1 can be written as a
product of primes uniquely, up to the order of the primes.
Note: Another method to find the greatest common divisor of two integers is to use the
prime factorization.
Suppose a and b can be written as prime factorization:
a = p1a1p2a2p3a3pnan
b = p1b1p2b2p3b3pnbn
where each exponent is a nonnegative integer.
Then, gcd(a , b) is given by
gcd(a , b) = p1 min(a1,b1)p2min(a2,b2) p3 min(a3,b3)3pn min(an,bn)
61
Eg: Find gcd of 120 and 500 using prime factorization.

Soln:
120 = (2)(2)(2)(3)(5) = 23 31 51
500 = (2)(2)(5)(5)(5) = 22 53
Alternatively,
Gcd(120,500) = 22 51 =20
500=4(120) + 20
120=6(20) + 0
62

Note: Prime factorization can also be used to find the least common multiple of two
integers.
Suppose a and b can be written as prime factorization:
a = p1a1p2a2p3a3pnan
b = p1b1p2b2p3b3pnbn
where each exponent is a nonnegative integer.
Then, lcm(a , b) is given by
lcm(a
, b) = p1 max(a1,b1)p2max(a2,b2) p3 max(a3,b3)3pn max(an,bn)
63
Eg: Find lcm of 233572 and 243370 using prime factorization.

Soln:
64
Theorem: For a,b in Z+, ab=lcm(a,b)gcd(a,b)
65
Eg: Find gcd(1000,625) and lcm(1000,625) and verify that

gcd(1000,625) . lcm(1000,625) = 625000
Soln:
66
Theorem: Every integer n>1 can be written as a product of primes

uniquely, up to the order of the primes.
For n in Z+, we can count the number of positive divisors of n.
e
e e
By Theorem, n = p 1 p 2 p k , w herefor
1
2
k
each 1 i k , p is a prime and e 0.
i
i
f
f
f
1
2
If m | n, then m =
p
p k w here0 f e for all
1
2
k
i
i
1 i k.
So by the rule of product, the number of
positive divisors of n is (e 1)(e 1) (e 1).
1
2
k
67
Examples
Problem Examples
Eg: A fast-food chain has a contest in which a card with numbers on it is given to each
customer who makes a purchase. If some of the numbers on the card add up to 100, then
he will be awarded $100. A customer receives a card containing the numbers 72 , 21 ,15 ,
36 , 69 , 81 , 9 , 27 , 42 and 63. Will the customer win $100? Why or Why not?
Soln:
No, because none of the numbers will add up to 100.
68
Problem Examples
Eg: Check the following integer for divisibility by 3 , 4 , 5 and 9.
a)
637,425,403,705,125
b)
12,858,306,120,312
c)
517,924,440,926,512
d)
14,328,083,360,232
69
End of Chapter 3
70

Discrete Structure Chapter 3 Mathematical Induction-68

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Discrete Structure Chapter 3 Mathematical Induction-68

Uploaded by

Copyright:

Available Formats

Chapter 3

Define sequence a1 , a2 , a3 , . and b2 , b3 , b4 , by the following

for all integers k > 1

for all integers j > 0

Let a1 = -2 , a2 = -1 , a3 = 0 , a4 =1 , and a5 = 2 . Compute the following:

Compute the following summation:

Write the following summation in expanded form:

1,-1/2, 1/3, -1/4, 1/5, , (-1)n /(n+1)

Express the following using summation notation:

b) Write the following as a single summation:

b) n=4: 1+16, +16, 1/9 + 16

a k = am . a m+1 . a m+2 . ..a n

generalized distributive law

Eg: Let a k = k + 1 and b k = k 1 for all integers k . Write each of the

Eg: Change of variable

Eg: Change of variable

Transforming the following summation by making the specified change of

Eg: Change of variable

Transforming the following summation by making the specified change of

Proof by Mathematical Induction

Show that S(n) is true for n = a.

Step 2(Inductive step):

2.1 Assume S(n) is true for n = k, and,

Step 3: Then, S(n) is true for all n > a.

Eg: Sum of the First n Integers

for all integers n > 1

for all integers n > 0 and all real numbers

for all integers k > 2.

a. Write the first four terms of the sequence.

2, 5(2), 5(10), 5(50), 5(250) =2,10,50,250,1250

Prove that S(n): 4n < (n2-7)

Note: Hk+1 = Hk + 1/(k+1)

In general, Hn = 1 + + 1/3 + . + 1/n for each n Z +

H(2) = H1 + H2 = 1 + (1+1/2) = 5/2

H(k+1) = [(k+1)Hk k] + Hk+1 =(k+1)[Hk+11/(k+1)]k +H

Def: If a and b are integers with b 0 , we say that b

Divisibility: The Division Algorithm

Divisibility : The Division Algorithm

Theorem: Let a , b , and c be integers. Then

Divisibility : The Division Algorithm

If x + y = z , for some x , y , z Z and a divides two of the three

[ (a | b) (a | c) ] a | (bx + cy) , for all x , y Z

g) For 1 < i < n , let ci Z . If a divides each ci , then

Divisibility : The Division Algorithm

Divisibility : The Division Algorithm

divisors, namely 1 and n itself.

Divisibility : The Division Algorithm

then 58 = 3 (17) + 7 (remainder must be less than the

Divisibility : The Division Algorithm

Divisibility : The Division Algorithm

Divisibility : The Division Algorithm

Divisibility : The Division Algorithm

Eg: Find the quotient q and the remainder r and write a = qb + r

Def: For a, b in Z, a position integer c is said to be a common divisor of a and b if

Def: (Greatest Common Divisor)

The Greatest Common Divisor: the Euclidean Algorithm

Eg: Find the greatest common divisor of 30 and 24.

The Greatest Common Divisor: the Euclidean Algorithm

The Greatest Common Divisor: the Euclidean Algorithm

Theorem: gcd(a,b) is the smallest positive integer we can write as a linear

The Greatest Common Divisor: the Euclidean Algorithm

Let a , b be positive integers and let c = a mod b . Then

e.g. Let a=27 and b = 12, so 27 mod 12 = 3 = c

The Greatest Common Divisor: the Euclidean Algorithm