Q. 605.0( 1 Vote )

# If then use the principle of mathematical induction to show that for every positive integer n.

Answer :

Given.

We need to prove that using the principle of mathematical induction.

__Step 1__: When n = 1, we have

Hence, the equation is true for n = 1.

__Step 2__: Let us assume the equation true for some n = k, where k is a positive integer.

To prove the given equation using mathematical induction, we have to show that.

We know A^{k+1} = A^{k} × A.

Hence, the equation is true for n = k + 1 under the assumption that it is true for n = k.

Therefore, by the principle of mathematical induction, the equation is true for all positive integer values of n.

Thus, for every positive integer n.

Rate this question :

Using matrices, solve the following system of equations:

x + y + z = 6

x + 2z = 7

3x + y + z = 12

**OR**

Obtain the inverse of the following matrix, using elementary operations:

Mathematics - Board Papers

If find A^{2} – 5A – 14I.

If possible, using elementary row transformations, find the inverse of the following matrices

Mathematics - Exemplar

If possible, using elementary row transformations, find the inverse of the following matrices

Mathematics - Exemplar

If f(x) = x^{3} + 4x^{2} – x, find f(A), where

If f(x) = x^{2} – 2x, find f(A), where

Using matrices, solve the following system of linear equations:

x - y + 2z = 7

3x + 4y - 5z = - 5

2x - y + 3z = 12

**OR**

Using elementary operations, find the inverse of the following matrix:

Mathematics - Board Papers

Show that the matrix satisfies the equation A^{3} – 4A^{2} + A = 0.