I am working on a combinatorial problem. My current approach is to “shuffle together” the solutions to two smaller problems. Hence the following.

Problem: How many ways are there to clumsily shuffle two piles of cards together? Clumsy shuffles include those where cards in one or both piles stick to each other. This graphic explains.

Clumsy Shuffle Examples

The problem I was working on caused me to reason in this way. Let’s shuffle two piles of four cards each together. The total number of ways to order eight distinct cards is . Each pile of cards is in a distinct order – one of possibilities. So the number of ways to shuffle the cards must be since there are possible orders of the two piles.

But wait. This is just , the number of ways to choose four objects from eight objects. Thus this more enlightened rationale: We have eight slots into which to place the cards. Pick four of those slots and put the cards from the first pile in the slots in order. Put the cards from the other pile in order in the remaining slots. The number of ways to do this is . This diagram provides a visualization.

Shuffle – 8 Choose 4

### Like this:

Like Loading...

*Related*

## About jrh794

I am a sixty-five year old math instructor at Southern Oregon University. I taught at the College of the Siskiyous in Weed California for twenty-six years. Prior to that I worked as a computer programmer, carpenter and in various other jobs. I graduated from Rice University in 1967 and have a MS in Operations Research from Stanford. In the past I have hand-built a stone house and taken long solo bicycle tours. Now I ride my mountain bike and play golf for recreation.