On this page
In 1850, an English reverend named Thomas Penyngton Kirkman published a puzzle in *The Lady's and Gentleman's Diary*. He proposed a scenario involving 15 young ladies who walk out three abreast for 7 days in succession Wikipedia. He challenged his readers to arrange them daily so that no two girls would ever walk together in the same row of three more than once.
While it sounds like a simple riddle, Kirkman's schoolgirl problem is notoriously difficult to map out by hand. If you are starting out with permutations and finding the rules hard to follow, Fermi's AI tutor can work out what you already know and build a plan for the session, so you sit down to a clear next step.
What is the Kirkman schoolgirl problem?
To understand the problem, you have to break down the mathematics. We have 15 girls, who must be divided into five groups of three every day. For a single day, this requires forming five non-overlapping rows. Over the course of 7 days, there will be 35 total groups formed Wikipedia.
The primary difficulty lies in the strict "no repeating pairs" constraint. If Alice, Betty and Chloe walk together on Monday, Alice cannot walk with Betty or Chloe on any other day of the week. Because there are 15 girls, each girl must walk with exactly 14 different companions. Since she walks with two new companions each day, it takes exactly 7 days to walk with everyone once.
How did the schoolgirl puzzle begin?
The puzzle's origins trace back to Wesley Woolhouse, the editor of *The Lady's and Gentleman's Diary*. In 1844, Woolhouse challenged his readers with a general question about combinations of symbols without repetition Wikipedia. By 1847, Kirkman had published a comprehensive paper detailing how to construct triple systems, proving that such systems exist for specific mathematical conditions.
However, it was his 1850 phrasing of the 15 schoolgirls that captured the public imagination. Prominent mathematicians, including Arthur Cayley and Jakob Steiner, soon offered their own solutions or reintroduced similar concepts. Because Steiner's work was widely read in Europe, these structures later became known as Steiner triple systems. Kirkman's original contribution was frequently overlooked, leading to bitter priority disputes Wikipedia. It wasn't until 1918 that mathematician Louise Duffield Cummings published a paper bringing Kirkman's serious mathematical work back into the spotlight.
How many solutions does the Kirkman schoolgirl problem have?
The sheer scale of possibilities makes manual calculation nearly impossible. In fact, mathematicians eventually proved that there are 404,756,352,000 total solutions to Kirkman's puzzle, accounting for all possible label permutations Wikipedia.
However, when you eliminate identical patterns (isomorphic solutions) that only differ by swapping names, there are exactly 7 distinct, non-isomorphic solutions. Frank Nelson Cole published these seven fundamental solutions in his 1922 paper *Kirkman Parades*.
How is Kirkman's puzzle used in combinatorial design?
Kirkman's puzzle became a famous early example of a resolvable Steiner triple system. A Steiner triple system distributes items into blocks of three such that every possible pair of items appears in exactly one block Wikipedia. Because the blocks in Kirkman's problem can also be divided neatly into separate days (parallel classes), it is known specifically as a Kirkman triple system.
This brand of mathematics, now called combinatorial design, reaches far beyond Victorian schoolgirls. The rules of grouping items so that every pair is tested exactly once are crucial in modern statistical experimental design. For instance, if an agricultural researcher needs to test 15 different soil treatments in batches of three across 7 fields, ensuring that every treatment is paired against every other treatment exactly once prevents bias. Similar algorithms are also used in network routing and error-correcting computer codes.
How can you solve your own combinatorial problems?
Combinatorics requires spotting underlying symmetries rather than relying on brute force. Working through foundational concepts is the best way to understand advanced systems.
If you are stuck on probability and arrangement assignments—like At least one, at most two: selection problems with combinations or Arranging letters with repeats: the MISSISSIPPI method—the Fermi Problem Library has worked problems with a step-by-step solver that explains the reasoning rather than printing an answer.
