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. _______________________________________________ Tutor maillist - Tutor@python.org To unsubscribe or change subscription options: https://mail.python.org/mailman/listinfo/tutor
