Counting synthematic totals
= Counting synthematic totals
Two disjoint <synthemes> form a six-cycle, whose complement is a triangular prism. The prism has a unique partition into three perfect matchings, so the pair extends uniquely to a <total of synthemes>. Eight synthemes are disjoint from a fixed syntheme; grouping them four per total yields two totals through it, and double counting gives six totals in all.
// Target: combinatorics.bigb