News for hackers. Stuff that matters.
Re:The Math Behind “Spot It” by thaumasiotes on Friday October 15, 2021 @09:36PM (#28884903)
> Kirkman had actually solved the problem three years prior, when he determined how many schoolgirls he’d need to make the puzzle work. This proof was in response to a question posed in the same magazine in 1844: “Determine the number of combinations that can be made of n symbols, p symbols in each; with this limitation, that no combination of q symbols which may appear in any one of them shall be repeated in any other.” Kirkman extrapolated this as a question of unrepeated pairs in triplets, asking from a certain number of elements, how many unique triplets can you have before you start repeating pairs?

This is not an extrapolation. It is a specialization of the problem in which p is 3 and q is 2. If either is an extrapolation of the other, it's the first one being an "extrapolation" of the chronologically-later second.

There are no comments on this comment yet.