MathCastle
Proof WritingHardWriting It Up

Writing It Up · Hard problem

A proof of an identity in a,b,ca, b, c divides by (a−b)(b−c)(c−a)(a - b)(b - c)(c - a), so it covers only triples with three different values. Among the 6464 triples (a,b,c)(a, b, c) with each entry in {1,2,3,4}\{1, 2, 3, 4\}, how many are NOT covered?