Search   Memberlist   Usergroups
 Page 1 of 1 [3 Posts]
Author Message
roncace
science forum beginner

Joined: 04 Apr 2006
Posts: 2

Posted: Tue Apr 04, 2006 1:15 am    Post subject: Calculating how many m of n combinations in which an object appears

Say there are n objects taken m at a time. How can I determine the
number of times any single object, or any one of a subset of the
objects (size <= m) appears in the combinations. Here is an example of
what I mean:

There are 5 objects { a, b, c, d, e } and I want to look at the
combinations of those objects taken 3 at a time:

a b c
a b d
a b e
a c d
a c e
a d e
b c d
b c e
b d e
c d e

Now, how many of those combinations contain either a or b? For this
example the answer is nine, by actual count. Can anyone help me with a
general expression to solve this type of problem without enumeration of
all of the combinations?

Thanks!
Bob
Jean-Pierre LEVREL
science forum beginner

Joined: 04 Apr 2006
Posts: 1

Posted: Tue Apr 04, 2006 1:15 am    Post subject: Re: Calculating how many m of n combinations in which an object appears

"roncace" <rroncace@yahoo.com> a écrit dans le message de news:
| Say there are n objects taken m at a time. How can I determine the
| number of times any single object, or any one of a subset of the
| objects (size <= m) appears in the combinations. Here is an example of
| what I mean:
|
| There are 5 objects { a, b, c, d, e } and I want to look at the
| combinations of those objects taken 3 at a time:
|
| a b c
| a b d
| a b e
| a c d
| a c e
| a d e
| b c d
| b c e
| b d e
| c d e
|
| Now, how many of those combinations contain either a or b? For this
| example the answer is nine, by actual count. Can anyone help me with a
| general expression to solve this type of problem without enumeration of
| all of the combinations?
|
| Thanks!
| Bob
|
1) nombre de combinaisons de m éléments pris parmi n :
Nt = C(n,m) = n!/m!/(n-m)!
ex : n = 5, m = 3 => Nt = 10

2) nombre de combinaisons contenant exactement un élément prédéfini :
N1 = C(n-1,m-1), mais aussi N1 = Nt - C(n-1,m)
ex : n = 5, m = 1 => N1 = C(4,2) = 6 mais aussi N1 = 10 - C(4,3) = 10 - 4 =
6

3) nombre de combinaisons contenant au moins un élément parmi k éléments
prédéfinis :
Nk = Nt - C(n-k,m) =
ex : n = 5, m = 3, k = 2 => N2 = 10 - C(3,3) = 10 - 1 = 9

autre exemple : n = 6, m = 3 =>
Nt = C(6,3) = 20
N1 = 20 - C(5,3) = 10
N2 = 20 - C(4,3) = 16
N3 = 20 - C(3,3) = 1

JPL (from France)
roncace
science forum beginner

Joined: 04 Apr 2006
Posts: 2

 Posted: Tue Apr 04, 2006 1:34 pm    Post subject: Re: Calculating how many m of n combinations in which an object appears Jean-Pierre; Now I see it. Merci, beaucoup! Bob

 Display posts from previous: All Posts1 Day7 Days2 Weeks1 Month3 Months6 Months1 Year Oldest FirstNewest First
 Page 1 of 1 [3 Posts]
 The time now is Wed Oct 17, 2018 6:15 pm | All times are GMT
 Jump to: Select a forum-------------------Forum index|___Science and Technology    |___Math    |   |___Research    |   |___num-analysis    |   |___Symbolic    |   |___Combinatorics    |   |___Probability    |   |   |___Prediction    |   |       |   |___Undergraduate    |   |___Recreational    |       |___Physics    |   |___Research    |   |___New Theories    |   |___Acoustics    |   |___Electromagnetics    |   |___Strings    |   |___Particle    |   |___Fusion    |   |___Relativity    |       |___Chem    |   |___Analytical    |   |___Electrochem    |   |   |___Battery    |   |       |   |___Coatings    |       |___Engineering        |___Control        |___Mechanics        |___Chemical

 Topic Author Forum Replies Last Post Similar Topics Bond Mathematics: Calculating YTM, duration, and convexity Protoman Math 1 Fri Jul 14, 2006 11:42 pm calculating (interest) Claire Math 5 Mon Jul 10, 2006 8:43 pm 3D motion of an Object IED Physics 0 Fri Jul 07, 2006 7:56 pm Calculating unit costs g18c@hotmail.com Math 2 Sat Jul 01, 2006 11:32 pm Calculating Market Cap Weighted Index Protoman Math 9 Sat Jul 01, 2006 9:26 am