Scribd
Upload
7 views

Mathematics for Computer Science – lecture 3_Final.pptx

Uploaded by

Usha Chahal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views

Mathematics for Computer Science – lecture 3_Final.pptx

Uploaded by

Usha Chahal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Mathematics

for Computer
Science –
lecture 3
SONALI BATRA
Mathematical Induction- I
The following is a fundamental characteristic of the set N = 1, 2, 3,... of
positive numbers : Let P be a proposition with a definition on the positive
integers N
or P(n) is either true or false for each n ∈ N.
Assume P possesses the two qualities listed below.:
(i) P(1) is true.
(ii) P (k + 1) is true whenever P (k) is true.
If n is a positive integer and n ∈ N, P is true for all n.
Mathematical Induction
EXAMPLE
Let P (n) : 1 + 3 + 5 +···+ (2n − 1) = n^2
(The kth odd number is 2k − 1, and the next odd number is 2k
+ 1.)
Prove that P is true for all positive integers n.
To prove P(1) is true
And if P(k) is true then P(k+1) is also true
Assume P(k) to be true i.e. 1+3+5+7+…….+2k-1 = k^2 ---------
1)
Now to prove that 1+3+5+7…+2k-1+2k+1 = (k+1)^2 --------------
2)
Substituting 1 in 2 we get-
K^2 + 2K +1 = (k+1) ^2 which is true
Hence proved.
Question- To demonstrate the inequality n< 2^ n for all positive integers
n, use mathematical induction.
If P (n) is the proposition that n < 2^n.
P (1) is true, since 1 < 2^1 = 2.
First, let's assume that P(k) holds for any positive integer k. Thus k < 2^k.
Now we need to prove that if P (k) is true, then P (k + 1) or k + 1 < 2^(k+1),
is true.
we first add 1 to both sides of k < 2^k, Also we note that 1 ≤ 2^k. Now k + 1
< 2^k + 1 ≤ 2^k + 2^k = 2 · 2^k = 2^(k+1)
Question - For each integer n with n>= 4, demonstrate through
mathematical induction that 2^n< n!
Soln: If P (n) is the proposition that 2^n < n!.
The basis step is P (4). P (4) is true, since 2^4 = 16 < 24 = 4!
We assume that P (k)is true for arbitrary integer k with k ≥ 4.
thus 2^k < k! for positive integer k with k ≥ 4.
We must prove that, P (k + 1) is also true.
we must prove that if 2^k < k! for an arbitrary positive integer k
where k ≥ 4, then 2^(k+1 )< (k + 1)!.
.
We have 2^(k+1) = 2 · 2^k
< 2 · k!
< (k + 1)k! because 2 < k + 1
= (k + 1)!
Ques- When n is a positive integer, use mathematical induction to
demonstrate that n^3 - n is divisible by 3.
P (1) is true because 1^3 − 1 = 0 is divisible by 3.
we assume that P (k) is true; we assume that k^3 − k is divisible by 3 for
arbitrary positive integer k.
we must prove that the statement that (k + 1)^3 − (k + 1) is divisible by 3, is
true.
I.e. (k + 1)^3 − (k + 1) is divisible by 3.
(k + 1)^3 − (k + 1) = (k3 + 3k^2 + 3k + 1) − (k + 1) = (k^3 − k) + 3(k^2 + k)
Mathematical Induction- II
Allow P to be a proposition that is defined on the positive
integers N in such a way that :
(i) P (1) is true.
(ii) P (k) is true whenever P (j ) is true for all 1 ≤ j<k
Then P is true for every positive integer n ∈ N.
Thank You

You might also like