最終更新日：2024/08/08
(mathematics) A problem in combinatorics, in which 15 schoolgirls go walking three abreast for seven days in succession, and must be arranged so that no two walk abreast more than once.
正解を見る
Kirkman's schoolgirl problem
編集履歴（0）
元となった辞書の項目
Kirkman's schoolgirl problem
name
