+ Reply to Thread
Results 1 to 2 of 2

Thread: A combinations problem

  1. #1
    Points: 4,110, Level: 40
    Level completed: 80%, Points required for next Level: 40

    Posts
    1
    Thanks
    0
    Thanked 0 Times in 0 Posts

    A combinations problem



    Hello everyone! I’m only beginning to study statistics. The problem is easy, yet I need help

    A shelf contains 6 separate compartments. In how many ways can 4 indistinguishable marbles be placed in the compartments?

    I solved this problem the following way:

    1) All 4 marbles in 1 compartment = 6 ways
    2) 3 marbles in one compartment and 1 marble in another compartment = 6*5 = 30 ways
    3) 2 marbles in one compartment and 2 in another compartment = 6 choose 2 = 15 ways
    4) 2 marbles in one compartment, 1 marble in another compartment, and 1 marbles yet in another compartment = 6*((5*4)/2) = 60 ways
    5) 4 marbles in four different compartments = 6 choose 4 = 15 ways

    So, 6+30+60+15+15=126 ways

    The textbook, however, gives the following formula (n compartments and r marbles):

    (n + r – 1) CHOOSE (n – 1)

    Thus, 9 CHOOSE 5 = 126

    Please, help me understand where the formula comes from.

  2. #2
    Points: 4,148, Level: 40
    Level completed: 99%, Points required for next Level: 2

    Location
    Sweden
    Posts
    17
    Thanks
    0
    Thanked 0 Times in 0 Posts

    Quote Originally Posted by Olga View Post
    Hello everyone! I’m only beginning to study statistics. The problem is easy, yet I need help

    A shelf contains 6 separate compartments. In how many ways can 4 indistinguishable marbles be placed in the compartments?

    .....

    The textbook, however, gives the following formula (n compartments and r marbles):

    (n + r – 1) CHOOSE (n – 1)

    Thus, 9 CHOOSE 5 = 126

    Please, help me understand where the formula comes from.
    I think like this:

    To divide a group of r items into n subgroups you only need n-1 walls.
    Let | be a wall and o an item, then with r = 4 and n = 6 it can look like

    |o||oo||o or maybe ooo||||o|

    Number of distinct ways to arrange r items and n-1 walls is

    (r + n - 1)!/(r!(n-1)!) = (r + n - 1) CHOOSE (r) = (r + n - 1) CHOOSE (n - 1)
    ............

+ Reply to Thread

Similar Threads

  1. Cumulative combinations
    By johnnic in forum Probability
    Replies: 5
    Last Post: 07-04-2010, 10:12 AM
  2. combinations and permutations
    By shangian_ng in forum Probability
    Replies: 3
    Last Post: 10-13-2009, 12:28 PM
  3. Permutations and Combinations Help
    By tom86 in forum Probability
    Replies: 2
    Last Post: 10-02-2009, 11:02 PM
  4. how many combinations ?
    By computeruser08 in forum Probability
    Replies: 4
    Last Post: 01-29-2009, 09:02 PM
  5. combinations/permutations
    By guitargod2112 in forum Probability
    Replies: 0
    Last Post: 10-26-2007, 03:29 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts








Advertise on Talk Stats