Let S be a set consisting of m pairs (a,b) of positive integers with the property that 1≤a<b≤n. Show that there are at least
4m⋅3n(m−4n2)
triples (a,b,c) such that (a,b), (a,c), and (b,c) belong to S. floor functioninequalitiesgraph theorycombinatorics