Question: Combinatorial problem

March 05 2013 by Markiyan Hirnyk 4628
false
Maple

0


We have a set S of 30 elements and choose its subsets A, B, and C such that nops(A union B) = 5,  

nops(A intersect B intersect C) = 3. How many ways are there to produce that?

How to count this number  with Maple?

 
Loading Comments & Answers