Find a combinatorial proof of the above identity, where n and a are positive integers.

I'm not sure how to prove this identity. I know the LHS is the number of multisets of size n with a types and the RHS is the sum of products of numbers of (n-2k) subsets of an a-element set and k-multisets of a types

Transcribed Image Text:

[n/2] 1 1 ("try)=Σ(n 2)(*ti) a 1 η – 2k 1 k=0 α [n/2] 1 1 ("try)=Σ(n 2)(*ti) a 1 η – 2k 1 k=0 α

Answer rating: 100% (QA)

1 Solution Given that 1 nta1 Q ka1 KED h2k 91 Where ... View the full answer