Explore BrainMass

Explore BrainMass

    Combinations Proof : The formula used to determine the number of different ways to deal n distinct playing cards to two players where each player gets at least one card.

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Show that 2(2^n-1 - 1) is the formula used to determine the number of different ways to deal n distinct playing cards to two players where each player gets at least one card.

    I want to allow the possibility of giving a different number of cards to each player.

    © BrainMass Inc. brainmass.com March 4, 2021, 6:24 pm ad1c9bdddf
    https://brainmass.com/math/combinatorics/combinations-proof-formula-43679

    Solution Preview

    Please see the attached file for the complete solution.
    Thanks for using BrainMass.

    Show that 2(2^n-1 - 1) is the formula used to determine the number of different ways to deal n distinct playing cards to two players where each player gets at least one card.

    Proof. You can think ...

    Solution Summary

    The formula used to determine the number of different ways to deal n distinct playing cards to two players where each player gets at least one card is proven. The solution is detailed and well presented.

    $2.49

    ADVERTISEMENT