I cannot figure this out:
I have a square in the plane with side length 5. A and B are points in the square. The coordinates of A and B are always integers.
I want to know how many unique Euclidean distances are possible between A and B.
I thought 15?
Editor note The original ambiguous phrasing of this question and the consequent edits to clarify resulted in conflicting solutions. Please take this into consideration as you vote on the answers.