Results 1 to 10 of 10

Math Help - Table Arrangement Problem with Combinations

  1. #1
    Newbie
    Joined
    Jan 2013
    From
    British Columbia
    Posts
    9

    Table Arrangement Problem with Combinations

    Hello,

    I am trying to help someone with this problem. I have absolutely no clue where to even begin in this question. I am only asking for a nudge in the correct direction, not asking for anyone to solve the question completely.

    "8 digits (0-7) are to be arranged in a 2 x 4 table. In how many ways can they be arranged if entry in row 1 must be less than row 2?"

    Any and all help is greatly appreciated!

    Thank you!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    MHF Contributor
    Joined
    Sep 2012
    From
    Australia
    Posts
    3,612
    Thanks
    591

    Re: Table Arrangement Problem with Combinations

    Hey ianm.

    Can you use a computer to check this for you? A simple algorithm should compute all possibilities for you in a matter of seconds.

    Another way to do this is to set up a probability calculation where the limits are such that Row 1 < Row 2 but this is going to be a bit more involved.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Jan 2013
    From
    British Columbia
    Posts
    9

    Re: Table Arrangement Problem with Combinations

    Quote Originally Posted by chiro View Post
    Hey ianm.

    Can you use a computer to check this for you? A simple algorithm should compute all possibilities for you in a matter of seconds.

    Another way to do this is to set up a probability calculation where the limits are such that Row 1 < Row 2 but this is going to be a bit more involved.
    Hi,

    I am helping someone in high school. The only available tools we have are a TI-83 calculator. Is the only option through using the computer? Personally I have R, though I am weak at it. I just assume there's another way, because on an exam, a grade 12 student will not be using R.

    Cheers and thanks for the rapid reply!
    Last edited by ianm; January 24th 2013 at 08:46 PM.
    Follow Math Help Forum on Facebook and Google+

  4. #4
    MHF Contributor
    Joined
    Sep 2012
    From
    Australia
    Posts
    3,612
    Thanks
    591

    Re: Table Arrangement Problem with Combinations

    The other way is through exhaustion: you fix a particular number and then work through the possibilities.

    A computer could do this for you and simply count the number of matches it gets to your criteria.

    Either way, both simply evaluate the possibilities and then see if they match the criteria.

    The thing that makes this complex is that you have dependencies between rows and columns (since you can't repeat elements).
    Follow Math Help Forum on Facebook and Google+

  5. #5
    Newbie
    Joined
    Jan 2013
    From
    British Columbia
    Posts
    9

    Re: Table Arrangement Problem with Combinations

    Hello,

    He asked one of his peers, who has:  \frac{8!}{2^4} = 2520 for an answer, with the reasoning that there are 8! ways of arranging the 8 numbers, but you have divide by  2^4 , since this is the number of ways to permutate the rows where the first is less than the next column.

    Would you agree with this?

    For interest's sake, would you use R to calculate this?
    Follow Math Help Forum on Facebook and Google+

  6. #6
    MHF Contributor
    Joined
    Sep 2012
    From
    Australia
    Posts
    3,612
    Thanks
    591

    Re: Table Arrangement Problem with Combinations

    I'm not exactly sure on the specifics of the argument he gives so I can't comment on that solution.

    I would indeed use R to calculate this and the number of iterations in the loop would be 8! which would be evaluated in a second or two.

    The loop would simply evaluate a configuration, check if it satisfies the constraints and increment a counter if it meets them.
    Follow Math Help Forum on Facebook and Google+

  7. #7
    Newbie
    Joined
    Jan 2013
    From
    British Columbia
    Posts
    9

    Re: Table Arrangement Problem with Combinations

    Quote Originally Posted by chiro View Post
    I'm not exactly sure on the specifics of the argument he gives so I can't comment on that solution.

    I would indeed use R to calculate this and the number of iterations in the loop would be 8! which would be evaluated in a second or two.

    The loop would simply evaluate a configuration, check if it satisfies the constraints and increment a counter if it meets them.
    Know of any really good ways to start learning R? Would this even be that hard in R?
    Follow Math Help Forum on Facebook and Google+

  8. #8
    MHF Contributor
    Joined
    Sep 2012
    From
    Australia
    Posts
    3,612
    Thanks
    591

    Re: Table Arrangement Problem with Combinations

    If you know something like C then R will be straight-forward.

    You can just set variables equal to things without declaring them.

    Just read up on loops and comparisons (for statement for loop and if statement for checking).
    Follow Math Help Forum on Facebook and Google+

  9. #9
    Super Member
    Joined
    Mar 2008
    Posts
    934
    Thanks
    33
    Awards
    1

    Re: Table Arrangement Problem with Combinations

    Quote Originally Posted by ianm View Post
    Hello,

    I am trying to help someone with this problem. I have absolutely no clue where to even begin in this question. I am only asking for a nudge in the correct direction, not asking for anyone to solve the question completely.

    "8 digits (0-7) are to be arranged in a 2 x 4 table. In how many ways can they be arranged if entry in row 1 must be less than row 2?"

    Any and all help is greatly appreciated!

    Thank you!
    There are \frac{8!}{(2!)^4} ways to break the 8 digits into 4 subsets of size 2. If we arrange the digits in each pair so that the smaller is on top, these pairs form the columns in your table. For each such set of columns, the columns can be ordered in 4! ways. So in all, there are

    \frac{8!}{(2!)^4} \;4!

    possible arrangements.
    Follow Math Help Forum on Facebook and Google+

  10. #10
    Super Member
    Joined
    Mar 2008
    Posts
    934
    Thanks
    33
    Awards
    1

    Re: Table Arrangement Problem with Combinations

    Oops, I replied too hastily on that one.

    \frac{8!}{(2!)^4} takes into account the ordering of the pairs as well as their selection, so there is no need to multiply by 4!. The number of acceptable tables is

    \frac{8!}{(2!)^4}
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Card arrangement problem.
    Posted in the Statistics Forum
    Replies: 1
    Last Post: May 12th 2011, 07:50 PM
  2. arrangement in circle problem
    Posted in the Discrete Math Forum
    Replies: 4
    Last Post: April 24th 2010, 06:23 AM
  3. Book Arrangement Problem
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: February 1st 2009, 10:47 AM
  4. truth table problem
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: February 24th 2008, 06:59 PM
  5. Seating Arrangement Problem
    Posted in the Advanced Statistics Forum
    Replies: 2
    Last Post: December 4th 2007, 12:45 PM

Search Tags


/mathhelpforum @mathhelpforum