Advertisements
Advertisements
प्रश्न
Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .
Advertisements
उत्तर
\[\text{ Let the given statement be defined as } P\left( n \right): \text {The number of subsets of a set containing n distinct elements } = 2^n ,\text{ for all n } \in N . \]
\[\text{ Step I: For n } = 1, \]
\[\text { LHS = As, the subsets of a set containing only 1 element are: } \phi \text{ and the set itself } . \]
\[\text{ i . e . the number of subsets of a set containing only 1 element } = 2\]
\[\text{ RHS } = 2^1 = 2\]
\[\text{ As, LHS = RHS } \]
\[\text{ So, it is true for n } = 1 . \]
\[\text{ Step II: For n = k } , \]
\[\text{ Let } P\left( k \right): \text{ The number of subsets of a set containing k distinct elements } = 2^k , \text{ be true for some k } \in N . \]
\[\text{ Step III: For n } = k + 1, \]
\[P\left( k + 1 \right): \]
\[\text{ Let } A = \left\{ a_1 , a_2 , a_3 , . . . , a_k , b \right\} \text{ so that A has } \left( k + 1 \right) \text{ elements .} \]
\[\text{ So, the subset of A can be divided into two collections; first contains subsets of A which don't have b in them and } \]
\[ \text{ the second contains subsets of A which do have b in them } . \]
\[i . e . \]
\[\text{ First collection: } \left\{ \right\}, \left\{ a_1 \right\}, \left\{ a_1 , a_2 \right\}, \left\{ a_1 , a_2 , a_3 \right\}, . . . , \left\{ a_1 , a_2 , a_3 , . . . , a_k \right\} \text{ and } \]
\[\text { Second collection } : \left\{ b \right\}, \left\{ a_1 , b \right\}, \left\{ a_1 , a_2 , \right\}, \left\{ a_1 , a_2 , a_3 , b \right\}, . . . , \left\{ a_1 , a_2 , a_3 , . . . , a_k , b \right\}\]
\[\text{ It can be clearly seen that: } \]
\[\text{ The number of subsets of A in first collection = The number of subsets of set with k elements i . e } . \left\{ a_1 , a_2 , a_3 , . . . , a_k \right\} = 2^k \left( \text{ Using step II } \right)\]
\[\text{ Also, it follows that the second collection must have the same number of the subsets as that of the first } = 2^k \]
\[\text{ So, the total number of subsets of } A = 2^k + 2^k = 2 \times 2^k = 2^{k + 1} .\]
Hence, the number of subsets of a set containing n distinct elements is 2n , for all n \[\in\] N .
APPEARS IN
संबंधित प्रश्न
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "n(n + 1) is even", then what is P(3)?
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
1 + 2 + 3 + ... + n = \[\frac{n(n + 1)}{2}\] i.e. the sum of the first n natural numbers is \[\frac{n(n + 1)}{2}\] .
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
52n −1 is divisible by 24 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Answer the following:
Prove, by method of induction, for all n ∈ N
12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`
Answer the following:
Prove by method of induction loga xn = n logax, x > 0, n ∈ N
Answer the following:
Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.
Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.
Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by
Sn = `{{:((n(n + 1)^2)/2",", "if n is even"),((n^2(n + 1))/2",", "if n is odd"):}`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
Prove the statement by using the Principle of Mathematical Induction:
4n – 1 is divisible by 3, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.
A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
