Combinatorial problem

Question:Combinatorial problem

Posted: Markiyan Hirnyk 7799 Product: Maple

March 05 2013

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?

Share via:

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

E-Mail Address:
Password:
Remember Me:	Automatically sign in on future visits

Save this setting as your default sorting preference?
Note: You can change your preference any time in your account settings
Don't show this again