query: Ways to seat $n$ couples around a circular table with restriction
positive_passages.docid: 140806
positive_passages.text: How do I tackle this combinatorics problem about married couples around a table?
negative_passages.docid: 43845
negative_passages.text: Partitioning the edges of $K_n$ into $\lfloor \frac n6 \rfloor$ planar subgraphs
negative_passages.docid: 35005
negative_passages.text: Difficult variation of the committee problem
negative_passages.docid: 55242
negative_passages.text: Command for the table Ruffini-Horner algorithm
negative_passages.docid: 146627
negative_passages.text: Table Design Help
negative_passages.docid: 59419
negative_passages.text: Crafty solutions to the following limit
negative_passages.docid: 98850
negative_passages.text: A positional number system for enumerating fixed-size subsets?
negative_passages.docid: 40852
negative_passages.text: Number of ways of distributing $n$ identical objects among $r$ groups
negative_passages.docid: 83841
negative_passages.text: Mutual Exclusion Problem
negative_passages.docid: 118293
negative_passages.text: Strategy for determining the number of homomorphisms between two Groups
negative_passages.docid: 41205
negative_passages.text: Help me solve a combinatorial problem
negative_passages.docid: 81928
negative_passages.text: Covering with most possible equal size subsets having pairwise singleton intersections
negative_passages.docid: 54631
negative_passages.text: Distribute $N$ objects to $K$ boxes such that no box has more than $c$ objects in it
negative_passages.docid: 104152
negative_passages.text: Stars and bars with lower bound on individual parts
negative_passages.docid: 58749
negative_passages.text: Choose K items from N in a circle
negative_passages.docid: 158202
negative_passages.text: Minimum dimension to hold $N$ points with given distances?
negative_passages.docid: 128480
negative_passages.text: Selection in Circular Table