Let S=(a,b,c,d) be a set of 4 distinct integers, such that each of its 4 subsets of 3 integers has as a sum of the members a square number.
Find all possible sets with each of the integers not exceeding 300.
I looked at the same general issue in Square Tetrahedral Dice.
Posted by broll
on 2017-11-06 08:54:34