MathDB
Prove that there are exactly $2(2^{n-1}-1)$ ways of dealing $n$ cards to two per

Source: Eotvos 1895 p1

March 13, 2020
Proofcardscombinatorics

Problem Statement

Prove that there are exactly 2(2n−1−1)2(2^{n-1}-1) ways of dealing nn cards to two persons. (The persons may receive unequal numbers of cards.)
Back to ProblemsView on AoPS