# So restrictive

Discrete Mathematics Level pending

The equilateral triangular grid shown below consists of 10 points. Six of these points are to be labelled $$A,B,C,D,E,F$$ such that $$|AB| > |BC| > |CD| > |DE| > |EF| > 0$$. How many different possible ways could the points have been labelled?

×