Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2009-part-03 — 175 problems (EN–VI) Question 10

Math Olympiad Vault · MathNet 2009-part-03 — 175 problems (EN–VI)

Question 10

The twelve knights at a round table must choose a two-member delegation for a visit to King Arthur. In how many ways can this be done so that the two-member delegation does not contain knights who sit next to each other at the round table?