Recall that a perfect square is the square of some integer. How many perfect squares less than 1,000 can be represented as the difference of two consecutive perfect squares?
+118609 Recall that a perfect square is the square of some integer. How many perfect squares less than 1,000 can be represented as the difference of two consecutive perfect squares?
so... how many Pythagorean triads are there such that the smallest one squared is less than 1000
Pythagorean triads with a prime number
sqrt(1000) = 31.6227766016837933
I get 16 but there is probably a much better way to do it.
