Contest Math Possible Triangles In the xy-plane, how many triangles have each of their vertices at points (a,b) where a,b are integers satisfying 1 ≤ a ≤ 5 and 1≤b≤5?
I got twenty-five, but something tells me this isn't right. I set up an inequality, square root of a squared plus b squared is less than a plus b but more than the absolute value of b minus a. Squaring, we can get rid of a squared plus b squared, leaving -2ab<0<2ab, which is always true. So, each pairing works, and we have five times five for twenty-five. 
I feel that the answer is way too simple. If it is indeed wrong, where did I go wrong?

It seems to me that it could be (25)(24)(20)/6.  You start with 25 points you can choose your first point from.  Then you pick any second point from any of the 24 remaining points.  Then you would pick from any of the remaining 23, but you could end up with a line that way.  Three  points could yield a line at that point, so you actually have 20 points to choose from.  But we've over-counted.  There are six ways to get any of those triangles, so we divide the (25)(24)(20) by six.  I'm not sure it's right, but you can check the general method with a 3x3 grid and see if it works for that.
