Namma Suvarna Karnataka
Originally posted by Ryan McGuire:
You have your choice of writing a program to solve this one or just doing it in your head.
How many different right triangles with all integer sides have one side of length 60?
Ryan
Originally posted by Ryan McGuire:
You have your choice of writing a program to solve this one or just doing it in your head.
How many different right triangles with all integer sides have one side of length 60?
Ryan
A good workman is known by his tools.
Originally posted by Marc Peabody:
If the 60-side is not the hypotenuse, I think there are infinite possibilites. The other two sides could approach infinity and still make a right triangle.
I think there are infinite possibilites.
There are only two hard things in computer science: cache invalidation, naming things, and off-by-one errors
Originally posted by Timmy Marks:
Consider:
60^2 + x^2 = (x+n)^2
3600 + x^2 = x^2 + 2xn + n^2
(3600 - n^2)/2n = x
Since n^2 >= 2n when n > 1, and the smallest difference between x and n is 1, then the largest possible x is when n is 1. That would mean that for all triangles fulfilling the requirements, x < 1800
Namma Suvarna Karnataka
Originally posted by Henry Wong:
Well, I don't know if it is possible to calculate all of them in you head, but this is what I got from writing a program to calculate it.