Hostname: page-component-586b7cd67f-g8jcs Total loading time: 0 Render date: 2024-11-24T17:50:36.128Z Has data issue: false hasContentIssue false
  • English
  • Français

Problem

Published online by Cambridge University Press:  03 November 2016

H. W. Lowry
H. W. Lowry*
Affiliation:
Timberley Carlton Road, Sidcup
Get access Rights & Permissions [Opens in a new window]

Extract

Eight couples have a five-course dinner. They start with 2 couples at each of four tables and finish with 2 couples (not the same two) at each table. After each course some men and women change tables, but maintain 2 men and 2 women at each table. The problem is to arrange these changes so that each person meets as many others as possible: that is, each man meets 5 other men and 8 women and each woman meets 5 other women and 8 men.

Type
Research Article
Information
The Mathematical Gazette , Volume 54 , Issue 388 , May 1970 , pp. 160
Copyright
Copyright © Mathematical Association 1970

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Note on page No 160 * See problem 68–3 SIAM REVIEW vol. 10, no. 1, Jan. 1968