(In reply to re: maybe a soln.....
To Charlie: Right on both counts. I see now what I did was only a start. Thanks.
We search for the maximum size set of 3-tuples such that the floor taken pairwise of any two does not equal the elements of a third, and, as I stated before, the pairwise floor is set by at least one element of each.
I wonder: does one try to populate such a set from the bottom up or the top down?
Edited on November 13, 2019, 8:10 pm