A computer dating service wants to match each of four women with one of six men. According
Question:
• Woman 1 would not be compatible with man 1, 3, or 6.
• Woman 2 would not be compatible with man 2 or 4.
• Woman 3 would not be compatible with man 3 or 6.
• Woman 4 would not be compatible with man 4 or 5.
In how many ways can the service successfully match each of the four women with a compatible partner?
Fantastic news! We've Found the answer you've been seeking!
Step by Step Answer:
Related Book For
Discrete and Combinatorial Mathematics An Applied Introduction
ISBN: 978-0201726343
5th edition
Authors: Ralph P. Grimaldi
Question Posted: