Thread: Maths - Help!

  1. #1
    Warchief
    10+ Year Old Account
    Join Date
    Aug 2011
    Location
    Ferndale, MI
    Posts
    2,161

    Maths - Help!

    We have movie night every week and there are 12 attendees. Sometimes they don't all attend. We have 12 different seats.

    Just for kicks I thought it would be fun to figure out how many different seating combinations there are, including when some people don't show up. So we'd have between 0-11 empty seats on any given night, and any of the 1-12 individuals could be sitting in any different seat.

    One (or more) of you mathy individuals can probably come up with the answer to this in 2 seconds. I thought it might be something like 12 factorial, but I'm rusty at the maths these days.

    Challenge accepted?

  2. #2
    Quote Originally Posted by BLCalliente View Post
    We have movie night every week and there are 12 attendees. Sometimes they don't all attend. We have 12 different seats.

    Just for kicks I thought it would be fun to figure out how many different seating combinations there are, including when some people don't show up. So we'd have between 0-11 empty seats on any given night, and any of the 1-12 individuals could be sitting in any different seat.

    One (or more) of you mathy individuals can probably come up with the answer to this in 2 seconds. I thought it might be something like 12 factorial, but I'm rusty at the maths these days.

    Challenge accepted?
    that is one ridiculously large number...

  3. #3
    The Patient
    10+ Year Old Account
    Join Date
    May 2011
    Location
    Southern California
    Posts
    285
    12P12 + 12P11 + 12P10 + ... + 12P1 + 12P0

    Where nPx = n!/(n-x)!

    Edit: that last term should probably be 1 instead of 12P0. We don't really care how many different ways empty chairs can be arranged if no one shows up

  4. #4
    The Lightbringer Twoddle's Avatar
    10+ Year Old Account
    Join Date
    Feb 2011
    Location
    UK
    Posts
    3,775
    It's a sum of permutations as far as I can see.

    The formula for k permutations of n is n! / (n-k)!

    When 1 person turns up there are 12P1 = 12 possible arrangements.
    When 2 people turn up there are 12P2 = 132 possible arrangements.
    When 3 people turn up there are 12P3 = 1320 possible arrangements.
    When 4 people turn up there are 12P4 = 11880 possible arrangements.
    When 5 people turn up there are 12P5 = 95040 possible arrangements.
    When 6 people turn up there are 12P6 = 665280 possible arrangements.
    When 7 people turn up there are 12P7 = 3991680 possible arrangements.
    When 8 people turn up there are 12P8 = 19958400 possible arrangements.
    When 9 people turn up there are 12P9 = 79833600 possible arrangements.
    When 10 people turn up there are 12P10 = 239500800 possible arrangements.
    When 11 people turn up there are 12P11 = 479001600 possible arrangements.
    When 12 people turn up there are 12P12 = 479001600 possible arrangements.

    The sum of all those is 1302061344 and that's your answer unless I've made a mistake.

  5. #5
    The Patient
    10+ Year Old Account
    Join Date
    May 2011
    Location
    Southern California
    Posts
    285
    I think Twoddle and I both made a conceptual mistake.

    Take the case where 3 people show up. 12P3 give the number of ways you can select 3 from 12 where order matters. It's like the ways gold, silver, and bronze can be awarded among 12 competitors. But in this case what we actually need is the number of different 3 person groups out of 12 (nCx) multiplied by the number of ways those three people can occupy 12 different chairs (12P3 gives the number of ways 3 out of twelve people can occupy 3 chairs).

  6. #6
    Warchief
    10+ Year Old Account
    Join Date
    Aug 2011
    Location
    Ferndale, MI
    Posts
    2,161
    This seems like it's going to be a VERY large number.

    EDIT: Thank you for giving it a whirl!

  7. #7
    The Lightbringer Twoddle's Avatar
    10+ Year Old Account
    Join Date
    Feb 2011
    Location
    UK
    Posts
    3,775
    Quote Originally Posted by Tirivaria View Post
    I think Twoddle and I both made a conceptual mistake.

    Take the case where 3 people show up. 12P3 give the number of ways you can select 3 from 12 where order matters. It's like the ways gold, silver, and bronze can be awarded among 12 competitors. But in this case what we actually need is the number of different 3 person groups out of 12 (nCx) multiplied by the number of ways those three people can occupy 12 different chairs (12P3 gives the number of ways 3 out of twelve people can occupy 3 chairs).
    Yup, the formula for k combinations of n is n! / (k!(n-k)!)

    It seems you have to take this sum then:

    12C1 * 12P1 +
    12C2 * 12P2 +
    12C3 * 12P3 +
    12C4 * 12P4 +
    12C5 * 12P5 +
    12C6 * 12P6 +
    12C7 * 12P7 +
    12C8 * 12P8 +
    12C9 * 12P9 +
    12C10 * 12P10 +
    12C11 * 12P11 +
    12C12 * 12P12

    Someone else can do it .

  8. #8
    Warchief
    10+ Year Old Account
    Join Date
    Aug 2011
    Location
    Ferndale, MI
    Posts
    2,161
    Your mathematical formula notation is beyond my aged brain.

  9. #9
    The Lightbringer Twoddle's Avatar
    10+ Year Old Account
    Join Date
    Feb 2011
    Location
    UK
    Posts
    3,775
    Is just shorthand. 12C3 for example stands for the number of ways 3 people can turn up out of the 12. 12P3 stands for the number of ways 3 people can sit themselves in a room with 12 seats. 12P3 is higher than 12C3 because the order is taken into account.

  10. #10
    Warchief
    10+ Year Old Account
    Join Date
    Aug 2011
    Location
    Ferndale, MI
    Posts
    2,161
    Excellent! Thank you very much!

  11. #11
    Bloodsail Admiral time0ut's Avatar
    10+ Year Old Account
    Join Date
    Jan 2011
    Location
    US
    Posts
    1,089
    Sounds like homework.

  12. #12
    Warchief
    10+ Year Old Account
    Join Date
    Aug 2011
    Location
    Ferndale, MI
    Posts
    2,161
    Quote Originally Posted by time0ut View Post
    Sounds like homework.
    Not homework.

Posting Permissions

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