Originally posted by IdNod4u2
View Post
Announcement
Collapse
No announcement yet.
Axe a Black Dude!
Collapse
-
Originally posted by Sparkman0811 View PostBlack dude, can you prove that a set with n elements has n(n-1)/2 subsets containing exactly two elements whenever n is an integer greater than or equal to 2?
C-n+n/1 = U
Nˆ2+C/N1 = N
1Nˆ2C/2N1 = T
Feel free to critique my working out.
Comment
-
-
Originally posted by Timmie Smalls View PostNope. Not even a little bit.
There are n ways to put the first element in the subset so there are n-1 elements left in the set which we can put as a second element in the subset. But we double count so there are exactly n(n-1)/2 subsets with 2 elements.
Get it?
Comment
-
Originally posted by Uncle Kadyo View PostLet a dark brown guy help you out with this.
There are n ways to put the first element in the subset so there are n-1 elements left in the set which we can put as a second element in the subset. But we double count so there are exactly n(n-1)/2 subsets with 2 elements.
Get it?
Comment
-
-
Originally posted by Uncle Kadyo View PostLOL
My take is that when letters are used to represent numbers, people from all strata got discoutaged and start asking, "what am I gonna use this for?".
Comment
Comment