Identical balls in identical bins: only the **multiset of counts** matters. We need the number of ways to write 6 as a sum of at most 3 positive integers (bins may be empty), ignoring order. These are the **partitions of 6 into at most 3 parts**:
1 part: $6$
2 parts: $5+1,\ 4+2,\ 3+3$
3 parts: $4+1+1,\ 3+2+1,\ 2+2+2$
Total $=1+3+3=\mathbf7$.
More Discrete Mathematics: Combinatorics (Counting, Recurrence Relations, Generating Functions) questions
GATE 2022 CS Q36– Which one of the following is the closed form for the generating function of the sequence…
GATE 2021 CS (CS1) Q29– There are 6 jobs with distinct difficulty levels, and 3 computers with distinct processing…
GATE 2020 CS Q52– The number of permutations of the characters in LILAC so that no character appears in its…
GATE 2019 CS Q15– Let U=\1,2,,n\. Let A=\(x,X) x X,\ X U\. Consider the following two statements on A . I. A…
GATE 2018 CS Q11– Which one of the following is a closed form expression for the generating function of the…
GATE 2015 CS (CS1) Q45– Let a n represent the number of bit strings of length n containing two consecutive 1s.…