The triangle with sides 3, 4, and 5, is the smallest integer sided pythagorean triangle. Can you prove that in every such triangle:
- at least one of its sides must be multiple of 3?
- at least one of its sides must be multiple of 4?
- at least one of its sides must be multiple of 5?
These two sites have an interesting discussion relating to this matter, one is more intense, but both offer support for KS.
http://www.friesian.com/pythag.htmhttp://www.logicville.com/sel1.htmThe first offers a lot of background which could be drawn into a proof while the other offers some of the equation sets already on offer.
|
|
Posted by brianjn
on 2006-07-03 20:02:57 |
Interesting dialog
