Mathematics desk | ||
---|---|---|
< February 10 | << Jan | February | Mar >> | February 12 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Hi,
As part of a data conversion exercise I've had to quantify and label working patterns, the naming convention I'm using looks like this:
1001100
A character is either a 1 or a 0 (working or not working), and the string always starts with a 1, as the working pattern can start on any of the 7 days (i.e. 1000000 is working one day, with 6 days off, but can start on any day.) There is also always at least one 0 (no one can work every single day). From this I've been trying to work out how many different permutations there. From our data we have 34 different permutations, but I'd like to know if this is all of them or if we are missing any.
I think the calculation is something like 7! / 5! (42), but I'm having difficulty getting my head around permutation calculations.
Is this correct or have I missed something?
Thanks 85.159.128.109 ( talk) 16:59, 11 February 2016 (UTC)
Hi all,
Thanks for all the great answers, I think Naraht has hit it on the head. 85.159.128.109 ( talk) 10:30, 12 February 2016 (UTC)
Mathematics desk | ||
---|---|---|
< February 10 | << Jan | February | Mar >> | February 12 > |
Welcome to the Wikipedia Mathematics Reference Desk Archives |
---|
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Hi,
As part of a data conversion exercise I've had to quantify and label working patterns, the naming convention I'm using looks like this:
1001100
A character is either a 1 or a 0 (working or not working), and the string always starts with a 1, as the working pattern can start on any of the 7 days (i.e. 1000000 is working one day, with 6 days off, but can start on any day.) There is also always at least one 0 (no one can work every single day). From this I've been trying to work out how many different permutations there. From our data we have 34 different permutations, but I'd like to know if this is all of them or if we are missing any.
I think the calculation is something like 7! / 5! (42), but I'm having difficulty getting my head around permutation calculations.
Is this correct or have I missed something?
Thanks 85.159.128.109 ( talk) 16:59, 11 February 2016 (UTC)
Hi all,
Thanks for all the great answers, I think Naraht has hit it on the head. 85.159.128.109 ( talk) 10:30, 12 February 2016 (UTC)