[Tutor] Creating lists with definite (n) items without repetitions
Peter Otten
__peter__ at web.de
Sat Sep 5 11:27:02 CEST 2015
Peter Otten wrote:
[proofreading goof]
> OK, you want all triples where no pair inside a triple is repeated.
> There are 325 pairs, and one triple uses up three pairs.
> That puts an upper limit of 325/3 = 108 on the number of triples.
> You then have to find all sets of
three
> pairs where the union contains
... three letters.
More information about the Tutor
mailing list