Skip to main content

Mathematical Induction

Mathematical Induction is a method of supporting a mathematical statement. The method is based on producing evidence for the purpose of verification of the statement. The presented evidence serves to verify the mathematical statement. The correctness of the mathematical statement is tested by the verification.

The mathematical statement is verified. The mathematical statement stands true if use of scientific verification justifies the statement.

At first, the mathematical statement is verified by using a limited form of evidence. Then we go onward for further  verification. Onward verification also must justify the meaningfulness of the mathematical statement.

__________________________

Principle of Mathematical Induction:

Let P(n) be a statement involving the natural number n such that 

  1. P(1) is true and


  1. P(k+1) is true, whenever P(k) is true


then P(n) is true for all n € N.


_____________________________

 

First the element produced as evidence is the natural number '1'. '1' is used in the mathematical statement. If the use of '1' leads to a successful test, we move forward. Verification of the statement using '1' is a partial proof of correctness of the mathematical statement.

The other evidence  can be considered as compound evidence based on two terms ( (k), (k+1) ). From the  first term (  (k) ), using P(k) foundation of further verification is laid.  The first term ( (k) ) is applied as P(k) to the mathematical statement. A result is formed.

Now, the second term ( (k+1) ) is applied to the mathematical statement as P(k+1). The result drawn by application of P(k) is lent to the mathematical statement formed by application of P(k+1). If the  mathematical statement formed by the application of P(k+1), using P(k),  is correct, then the original mathematical statement is correct.

We say that the original mathematical statement is true for all values.

IMITATING MATHEMATICAL INDUCTION:

_____________________________

Statement: Hari attended the school today -> ( Suppose it to be P(n) )

Proof:

1 ) Hari was seen in school today by Jim. ( Verified by limited evidence similar to testing of mathematical statement by natural number '1') -> ( Similar to P(1) . Jim is a single person, similar to single value of natural number '1' )

Note1: The above statement can be supposed to be true.This is similar to verification of the   mathematical statement for '1'.

2 ) Hari attended his roll call today.  -> ( Similar to P(k) )

Note2: The original statement mentioned in the problem can be supposed to be true for P(k).  The original  statement is: Hari attended the school today. In a way this original statement is served by the statement: Hari attended his roll call today.


Hari's presence was found recorded in  the attendance register today.->  ( Similar to P(k+1) )

Note3: The statement analogous to P(k) was: Hari attended his roll call today. The statement for P(k+1)- Hari's presence was recorded in the attendance register today- is well served by the analogous version of the  statement for P(k) just presented.


Note: Had Hari not attended his roll call today, meaning  ( P(k) = ×), his presence would not have found recording in the attendance register today (P(k+1) = ×).

Because Hari attended his roll call today and hence P(k) has been committed and it is therefore true. 

Hari's presence has been recorded in the attendance register today and hence P(k+1) has been committed, and it is therefore true.

As Hari responds to his roll call today (P(k) is true), his attendance recorded in the attendance register is very truthful (P(k+1)) is true). So, here we have seen that if P(k) is true, P(k+1) is true. So, we say that Hari attended the school today,  and now everyone agrees with this. 

That's it.











Labels:

Comments

Post a Comment

Popular posts from this blog

Local-Area Networks

Local-Area Networks ( LANs ) are restricted to a small area. Such Networks may be established within a building. Computers that are part of Local-Area Networks are Personal Computers ( PCs ) or microcomputers. These Computers are connected to each other. Simple communication lines connect these Pers Networks bring people together. When people join  hands teamwork becomes possible. The structural composition of LANs simplifies teamwork. In other words, LAN hardware supports teams having similar processing requirements. LAN Computers readily support personalization of tasks allocated to professionals.  Office staff can work together and share information. This improves the efficiency of the entire workforce. It has been noted that here all the Networked Computers are Personal Computers. They are of equal capacity. Mostly LAN users have similar tasks. If situations allow, a user is independent to access any Computer to serve his purpose. LAN users can exercise the option of secu...
Post a Comment
Read more

Computers - An Introduction

Computers are man made machines. They are made to work very fast. Working fast they can solve  big and small problems.  Modern science has given us these computers. They are very popular. Computers affect and change lives. They keep us happy.The happiness grows. Computers are quick and smart. Great problem solvers and simplifiers are our computers. They can do our work without stopping. Focus is on doing only what is needed. Not needed, not done.  Computers are  life-less servants. They cannot think or make decisions on their own. They are empowered to work. They are given each and every thing so that they carry out our orders. Orders are respected by computers. The manner in which computers work is wholly dependent on man.  The quality of service provided by computers is remarkable. They are loved by human beings. Computers are known for smart and quick service. Computers do not give wrong results. Correct answers are always given. Questions which are difficult...
Post a Comment
Read more

Euclid's Algorithm

The Greatest Common Divisor ( GCD ) of  two numbers is a number. The number ( GCD ) causes division of the two numbers. This number ( GCD ) is the greatest number that is possible. This divisor partially forms the two numbers. Adding  the divisor successively may result in formation of the two numbers. One can note that when the divisor is the greatest, the division of the dividend is the sharpest. The division operation is very effective. When the Greatest Common Divisor of two numbers is considered, we think of a number that can cause division of both the numbers. Here the two numbers are unequal. The Greatest Common Divisor causes divisions of the two numbers differently. This is clear from the two different quotient values.  The GCD value is very interesting to note. It relates very well with the two numbers. The GCD of two even numbers is also an even number. The GCD of two odd numbers is an odd number. So, we can say that GCD is an abstraction of the two numbers in ...
1 comment
Read more