#901 · Combinatorics · Counting

Combinations with repeated items

Given $p + q + r$ objects where $p$ are identical, $q$ are identical (but different from the first $p$ ), and the remaining $r$ objects are all distinct, show that the total number of non‑empty selections (combinations) that can be formed is $(p + 1) (q + 1) 2^{r} - 1$ .

~5 minProof · checked by AIidentical objectscombinationscounting

H. S. Hall & S. R. Knight, Higher Algebra (1891) · Ch. XI. Permutations and Combinations, Examples XI.b, No. 31

Stuck? A gentle nudge

Something off?

Workspace

Your working

Check your full solution

Attach photos of your pages (up to 3) or one PDF — or check what you typed above. Lemma reads the work and verifies the reasoning, not just the answer.

Your first check today doesn't need an account.

Your photos and PDFs are read once and not stored — only the transcription is kept.