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 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
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:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
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.
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
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)}\]
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
2 + 5 + 8 + 11 + ... + (3n − 1) = \[\frac{1}{2}n(3n + 1)\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
52n+2 −24n −25 is divisible by 576 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:
12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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/(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:
`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`
Prove by method of induction, for all n ∈ N:
(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)
Prove by method of induction, for all n ∈ N:
`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N
Answer the following:
Prove, by method of induction, for all n ∈ N
`1/(3.4.5) + 2/(4.5.6) + 3/(5.6.7) + ... + "n"/(("n" + 2)("n" + 3)("n" + 4)) = ("n"("n" + 1))/(6("n" + 3)("n" + 4))`
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:
1 + 3 + 5 + ... + (2n – 1) = n2
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
n3 – 7n + 3 is divisible by 3, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.
Prove the statement by using the Principle of Mathematical Induction:
n2 < 2n for all natural numbers n ≥ 5.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
