Subset and Proper Subset
Uploader Comments (APUS07)
All Comments (15)
-
Thank you so much! I finally understood it! :)
-
very helpful, thanks a lot
-
You have such a good voice for teaching, and you FINALLY cleared this up for me! THANK YOU!!
-
Thank you for giving a simple and clear explanation. I'm have a hard time wrapping this around my head but this short and simple video pretty much sums up an hour lecture.
-
@britishgoose01 It is just an equation to find the number of subsets. It is basic combinatorics. The subset consists of all the possible mixtures of members of the subset (where relation isn't counted in, so that [1,2] and [2,1] is the same subset. If we have 2 elements in the set, then we have subsets: 1&1,2&2&Ø (since an empty set is defined as a subset of every set), an the equation that finds this is 2 multiplied with 2= 4, and can be written as 2 exponentiated in 2. His equation is 2*2*2=8.
-
Thank you friend,
I's simple and very clear thanks to you!
-
Thank you. big help!
-
Thank You very much my dear friend,,I have learned it....Thanks to you
-
thanks.....
-
Thanksss!!!
dont understand the equation at the end 2 why 2? I understand 8 as there are 8 sets...
britishgoose01 1 year ago
In this video, the subsets contained in the set C = {1,2,3} are listed so you can count the number of subsets made. A quicker way is to show that the number of subsets is 2 raised to the nth power, where n is the number of elements in the set. In the video, it was 2^3 = 8.
If there were 10, 20, or 500 elements in C, the 2^n formulation would make it easier to find the number of subsets of a set. As an example, the number of subsets of a set with 10 elements is 2^10 = 1,024 subsets.
APUS07 1 year ago