0
Want this question answered?
Be notified when an answer is posted
Add your answer:
Earn +20 pts
Is 6 the total number of subsets of A B C?
No
Why does a set containing n element have 2n subsets?
I presume you meant 2^n (2 raised to the nth power), not 2*n (2 times n). That's answers.com's character set problem again (I trust, giving you the benefit of the doubt). The answer is that for each of the n elements, it is either in any particular subset or it isn't. Which elements are in and which are not in a subset defines the subset. So for example, if n is 3, say a, b, and c, there are 2 sub-collections of the set of all subsets: those containing a and those not containing a. In each of those sub-collections, there are 2 sub-collections based on whether they contain b, for a total of 4 (2*2) sub-collections. Finally, of each of these 4, there are 2 subsets: those containing c and those not containing c, for a total of 8 (2*2*2 or 2^3) subsets. Got it?
To find biggest of three number?
Let the numbers be A,B and C and assume that A ≠ B ≠ C 1) Subtract B from A. If the result is a positive number then A > B otherwise B > A. 2) Subtract the greater of A and B from C. If the result is a positive number then C is the largest number otherwise the subtrahend (either A or B) is the largest number.
Answer in finding the formula of number of subsets?
i don't know the formula but it is if the formula was for instance a,b,c,d,e,f that could be one subset but f,e,d,c,b,a couldn't be because you have to picture them like floating numbers in a circle they can be in any order so all of the combomatins of a,b,c,d,e,f are just one but theen you have to count b,c,d,e,f as on and so on and so forth there are about....... under100 or over 700 figure it out!
How do you check subtraction?
If any number B is subtracted from a number A to give C, then C+B =A If A - B = C then B+C = A Eg 7 - 2 = 5 Hence 2 + 5 = 7
Is 6 the total number of subsets of A B C?
No
What are the subsets of a b c and d?
{a,b,c,d} {a,b} {a,c} {a,d} {b,c} {b,d} {c,d}
How cardinality relates to the number of subsets of a set?
Cardinality is simply the number of elements of a given set. You can use the cardinality of a set to determine which elements will go into the subset. Every element in the subset must come from the cardinality of the original set. For example, a set may contain {a,b,c,d} which makes the cardinality 4. You can choose any of those elements to form a subset. Examples of subsets may be {a,c} {a, b, c} etc.
How many molecules are there in the mixture compared to the total number in substances B and C?
Well, let's think about this in a happy little way. In a mixture of substances B and C, the total number of molecules will be the sum of the molecules in B and C. Each substance brings its own molecules to the mix, creating a beautiful blend of different molecules dancing together. So, the number of molecules in the mixture will be the total from B and C, creating a harmonious union.
Number a is 4676. number b is 10043 greater than A. Number C is 2610 less than B. What is th total value of numbers aband c?
Oh, dude, let's break this down. So, if number A is 4676, then number B is 10043 + 4676, which is like basic addition, right? And then number C is 2610 less than B, so you just subtract that from B. Add A, B, and C together, and you've got the total value. Math, man, it's wild.
What represents the number of subsets of five elements can be formed from a set of six elements?
c(6,5)
What B percent of what number is C?
Let the number be X, then B% = B/100 → B% of X = C → B/100 x X = C → X = C ÷ (B/100) = C x 100/B = 100C ÷ B So to find the number, divide C by B percent.
Why does a set containing n element have 2n subsets?
I presume you meant 2^n (2 raised to the nth power), not 2*n (2 times n). That's answers.com's character set problem again (I trust, giving you the benefit of the doubt). The answer is that for each of the n elements, it is either in any particular subset or it isn't. Which elements are in and which are not in a subset defines the subset. So for example, if n is 3, say a, b, and c, there are 2 sub-collections of the set of all subsets: those containing a and those not containing a. In each of those sub-collections, there are 2 sub-collections based on whether they contain b, for a total of 4 (2*2) sub-collections. Finally, of each of these 4, there are 2 subsets: those containing c and those not containing c, for a total of 8 (2*2*2 or 2^3) subsets. Got it?
How do you list 3 element subsets of a 7 element set?
If your 7 element set is {a, b, c, d, e, f, g}, you would list a 3 element subset by taking any 3 elements of the set eg., {a, d, g} or {b, c, f}, etc. To count all of the subsets, the formula is 7C3, where 7C3 is 7!/(3!*4!), or 35 different unique 3 element subsets of a 7 element set.
What is A - B - C if the answer is -13?
There are an infinite number of combinations for A, B, and C in this case. Just assign any number for A and for B, then calculate the value for C.There are an infinite number of combinations for A, B, and C in this case. Just assign any number for A and for B, then calculate the value for C.There are an infinite number of combinations for A, B, and C in this case. Just assign any number for A and for B, then calculate the value for C.There are an infinite number of combinations for A, B, and C in this case. Just assign any number for A and for B, then calculate the value for C.
How do you find the smallest largest numbers in c language?
for the largest number: #include<stdio.h> void main() { int a,b,c,number,largestnumber; a=99; b=9; c=77; if(a>b) { number=a; } else if(b>c) { number=b; } else { number=c; } largestnumber=number; printf("%d",largestnumber); }
What is an example of a proper subset?
Let A be the set {1,2,3,4} B is {1,2} and B is a proper subset of A C is {1} and C is also a proper subset of A. B and C are proper subsets of the set A because they are strictly contained in A. necessarily excludes at least one member of A. The set A is NOT a proper subset of itself.
