Problem: (EXTRA CREDIT) At King Arthur's round table there are 12 knights, such that each knight does
Fantastic news! We've Found the answer you've been seeking!
Question:
Problem: (EXTRA CREDIT) At King Arthur's round table there are 12 knights, such that each knight does not like his immediate neighbors. In how many ways can one choose 5 knights, so that any two of them like each other?
Related Book For
Discrete Mathematics and Its Applications
ISBN: 978-0073383095
7th edition
Authors: Kenneth H. Rosen
Posted Date: