Ménage problem
id:
m-nage-problem-283-5915796
title:
Ménage problem
text:
In combinatorial mathematics, the ménage problem or problème des ménages asks for the number of different ways in which it is possible to seat a set of male-female couples at a round dining table so that men and women alternate and nobody sits next to his or her partner. This problem was formulated in 1891 by Édouard Lucas and independently, a few years earlier, by Peter Guthrie Tait in connection with knot theory. For a number of couples equal to 3, 4, 5, ... the number of seating arrangements
brand slug:
wiki
category slug:
encyclopedia
description:
Assignment problem in combinatorial mathematics
original url:
https://en.wikipedia.org/wiki/M%C3%A9nage_problem
date created:
date modified:
2023-08-18T08:40:37Z
main entity:
{"identifier":"Q3406269","url":"https://www.wikidata.org/entity/Q3406269"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/90/Wedding_Banquet_setting.jpeg","width":2816,"height":2112}
fields total:
13
integrity:
15