Proof WritingHardWriting It Up
Writing It Up · Hard problem
A proof of an identity in divides by , so it covers only triples with three different values. Among the triples with each entry in , how many are NOT covered?
A proof of an identity in divides by , so it covers only triples with three different values. Among the triples with each entry in , how many are NOT covered?