MHB Cardinal of P(S) (Adam's question at Yahoo Answers)

  • Thread starter Thread starter Fernando Revilla
  • Start date Start date
AI Thread Summary
For any positive integer n, the number of subsets of a set S with n elements is given by the formula |P(S)| = 2^n. This is derived using the binomial theorem, which states that the total number of subsets can be expressed as the sum of binomial coefficients: |P(S)| = Σ from k=0 to n of C(n, k). Each term C(n, k) represents the number of subsets with k elements, leading to the conclusion that the total number of subsets equals (1 + 1)^n. Thus, it is shown that |P(S)| = 2^n, confirming the relationship between the size of a set and its power set.
Fernando Revilla
Gold Member
MHB
Messages
631
Reaction score
0
Here is the question:

Show for any n ϵ ℤ+ with |S| = n, then |P(S)| = 2n.?

Here is a link to the question:

Show for any n

I have posted a link there to this topic so the OP can find my response.
 
Mathematics news on Phys.org
Hello Adam,

The number of subsets of $S$ with $k$ elements is $\displaystyle\binom{n}{k}$. So, using the binomial theorem: $$\begin{aligned}\left|\mathcal{P}(S)\right|&= \displaystyle\binom{n}{0}+\displaystyle\binom{n}{1}+\displaystyle\binom{n}{2}+\ldots+ \displaystyle\binom{n}{n}\\&=\displaystyle\binom{n}{0}1^n\cdot 1^0+\displaystyle\binom{n}{1}1^{n-1}\cdot1+\displaystyle\binom{n}{2}1^{n-2}\cdot1^2+\ldots+\displaystyle\binom{n}{n}1^0 \cdot 1^n\\&=(1+1)^n\\&=2^n\end{aligned}$$
 
Seemingly by some mathematical coincidence, a hexagon of sides 2,2,7,7, 11, and 11 can be inscribed in a circle of radius 7. The other day I saw a math problem on line, which they said came from a Polish Olympiad, where you compute the length x of the 3rd side which is the same as the radius, so that the sides of length 2,x, and 11 are inscribed on the arc of a semi-circle. The law of cosines applied twice gives the answer for x of exactly 7, but the arithmetic is so complex that the...
Back
Top