How many possible ways can the points A, B, C, and D be ranked

[zofaan]

I wrote this question. I wan't to see if anyone gets it.

On the x-y coordinate plane there exists points A, B, C, and D, in which AB > BC > CD. No 2 points have the same x-coordinate. The absolute value of the slope of AB is less than that of BC, which is less than that of CD. How many possible ways can the points A, B, C, and D be ranked according to the relative size of their respective x-coordinate?

 

[zofaan]

ABS[m(AB)] < ABS[m(BC)] < ABS[m(CD)] ?

YES

 

[zofaan]

The points don't necessarily form a closed figure.

One way they could be ranked is A,B,C,D from lowest to highest x-coordinate
You are to find the number of distinct rankings that can occur given the conditions in the problem.