Prove that a cube Qn includes a number of \[\binom{n}{k} \cdot 2^{n-k}\]Qk cubes.
(We know that k<=n.)
This is a duplicate of the question here:
Graph Theory Prove Problem (Please help)
This question was originally asked at the end of another user's thread. Realizing the mistake, the user appears to have created a separate thread, and then someone split this post into its own thread.