Рет қаралды 15,235
00c - Mathematical Induction Problems - Divisibility
In this video, we are going to solve questions on mathematical induction - Divisibility.
Mathematical Induction is on of the techniques which can be used to prove variety of mathematical statements formulated in terms of n, where n is a positive integer. There basically three steps to do that.
Step 1: base step. To prove that the statement is true for the first term, thus n = 1
Step 2: induction hypothesis. To prove that the statement is true for n = k, where k is a positive integer
Step 3: induction step. To prove that based on the hypothesis made in 2, the statement is true for the next term, thus n = k + 1
then, we can make a statement for
P(n) is true for all positive integers n is greater or equal to 1.
Visit channel Playlist for more videos on Engineering mathematics, applied electricity and Basic Mechanics.
Kindly support and Subscribe
Thank you
00:00 - Intro
01:42 - Problem 1
10:11 - Problem 2