## Mathematical Induction

MATHEMATICAL INDUCTION:

Mathematical induction is a unique and special way to prove the things, in only two steps.

Step 1. Show that it is true for n = 1.
Step 2. Show that if n = k is true then n = k+1 is also true.

For example:

Prob. By principal of mathematical induction prove that
11n+2 + 122n+1 is divisible by 133, n ∈ N.

Solution.
Step 1 P(1)- Show it is true for n = 1
11n+2 + 122n+1 = 111+2 + 122(1)+1 = 1331 + 1728 = 3059

Yes 3059 is divisible by 133.
111+2 + 122(1)+1  is true.

Step 2 P(k)- Assume it is true for n = k

11k+2 + 122(k)+1  is true.
(above line is an assumption only, which we will use as a fact in rest of the solution)

Now, prove that 11(k+1)+2 + 122(k+1)+1 is divisible by 133. (here n = k +1 now, P(k+1))
We have,
P(k+1)

11(k+1)+2 + 122(k+1)+1 = 11k+3 + 122k+3

11(k+1)+2 + 122(k+1)+1 = 11k+2 x 11 + 122k+1x 122

11(k+1)+2 + 122(k+1)+1 = (11k+2 x 11) + (122k+1x 144 )

11(k+1)+2 + 122(k+1)+1 = (11k+2 x 11) + (122k+1x (11 + 133))

11(k+1)+2 + 122(k+1)+1 = (11k+2+ 122k+1)x 11+(122n+1 x 133)

11(k+1)+2 + 122(k+1)+1 = ((11k+2+122k+1)x 11)+(122n+1 x 133)

Here 11k+2+122k+1 is divisible by 133 as assumed in n = k, P(1),

And 122n+1 x 133 is multiple of 133 so it is divisible by 133.

So,

11(k+1)+2 + 122(k+1)+1 = ((divisible by 133)x 11)+(divisible by 133)

11(k+1)+2 + 122(k+1)+1 = divisible by 133.

In this problem

If n = n, i.e, P(1) is true then n = n+1, i.e, P(n+1) is also true. Hence proved.

Problems based on above study:

Prob. Prove the following proposition
12 + 22 + 32 +...........+ n2  = (n (n+1)(2n+1) ) /6.

Prob. By principal of mathematical induction prove that
11n+2 + 122n+! is divisible by 133, n ∈ N.

Prob. By mathematical induction prove that for any integer n,  11n+2 + 122n+1 is divisible by 133.

Prob. Show that 2 + 4 + 6 + …… + 2n = n (n+1) by mathematical induction.

Prob. Prove by induction that the sum of the cubes of three consecutive integers is divisible by 9.

Prob. Prove by mathematical induction that n2 + n is an even number for all natural numbers, n ≥ 1.

Prob. Prove by using method of induction-
12 + 22 + 32 +.......+ (3n - 2)2 = (n(6n2 - 3n -1)) /2.

Prob. Prove by mathematical induction -

12 - 22 + 32 -............+ (-1)n+1n2 = ((-1)n+1n(n+1)) /2.

Discrete Structure

EasyExamNotes.com covered following topics in these notes.
A list of Video lectures
ACA: ADVANCED COMPUTER ARCHITECTURE EasyExamNotes.com covered following topics in these notes.
Discrete Strucutre ↓ 👆
Discrete Structure EasyExamNotes.com covered following topics in these notes.
A list of Video lectures
Information Storage Management ↓ 👆
Network & Web Security ↓ 👆
Web Engineering ↓ 👆
Web Engineering EasyExamNotes.com covered following topics in these notes.
Cloud Computing ↓ 👆

Cloud Computing:

EasyExamNotes.com covered following topics in Cloud Computing.

1. Buyya, Selvi ,” Mastering Cloud Computing “,TMH Pub
2. Krutz , Vines, “Cloud Security “ , Wiley Pub
3. Velte, “Cloud Computing- A Practical Approach” ,TMH Pub
4. Sosinsky, “ Cloud Computing” , Wiley Pub
Python Programming ↓ 👆
Principles of Programming Languages ↓ 👆
Principles of Programming Languages
EasyExamNotes.com covered following topics in these notes.

#### Language Evaluation Criteria Influences on Language Design  Language Categories Programming Paradigms Compilation Virtual Machines  Programming Environments Issues in Language Translation Parse Tree  Pointer and Reference type Concept of Binding Type Checking Strong typing  Sequence control with Expression Subprograms Fundamentals of sub-programs Scope and lifetime of variable Static and dynamic scope Design issues of subprogram and operations Local referencing environments Parameter passing methods Overloaded sub-programs Generic sub-programs  Design issues for functions  Co routines  Abstract Data types Abstraction and encapsulation Static and Stack-Based Storage management Garbage Collection OOP in C++ OOP in Java  OOP in C#  OOP in PHP Concurrency Semaphores  Monitors Message passing Java threads  C# threads  Exception handling  Exceptions Exception Propagation  Exception handler in C++  Exception handler in Java Introduction and overview of Logic programming Basic elements of Prolog Application of Logic programming Functional programming languages Introduction to 4GL  Practicals: Memory Implementation of 2D Array.  Memory Implementation of 3D Array.  Implementation of pointers in C++.  Write a program in Java to implement exception handling. Write a program in C++ to implement call by value parameter passing Method. Write a program in C++ to implement call by reference parameter passing Method.  Write a program in Java to implement concurrent execution of a job using threads. Implement Inheritance in C#. Implement Encapsulation in C#. Implement static/compiletime Polymorphism in C#. Implement dynamic/runtime Polymorphism in C#. Previous years solved papers: PPL|RGPV|May 2018  PPL|RGPV|June 2017  A list of Video lectures Click here References: Sebesta,”Concept of programming Language”, Pearson Edu  Louden, “Programming Languages: Principles & Practices” , Cengage Learning  Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill.  E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

Computer Organization and Architecture ↓ 👆

### Computer Organization and Architecture

#### References:

1. William stalling ,“Computer Architecture and Organization” PHI
2. Morris Mano , “Computer System Organization ”PHI

Theory of Computation ↓ 👆
TOC EasyExamNotes.com covered following topics in these notes.
Computer Network ↓ 👆
Computer Network

EasyExamNotes.com covered following topics in these notes.
References:
1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.
R Programming ↓ 👆

### R Programming

EasyExamNotes.com covered following topics in these notes.

Management Information System ↓ 👆