The area of the triangle formed by p y t h a g o r e a n t r i p l e t with integer sides is always divisible by 3 .
T r u e or F a l s e ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Yes, in general if the legs have length 2 k m n and k ( m 2 − n 2 ) then the area of the triangle is k 2 m n ( m 2 − n 2 ) = k 2 m n ( m − n ) ( m + n ) .
If either m or n is divisible by 3 then we are done. If not, then if m , n are both equivalent to either 1 or 2 mod 3 then m − n will be divisible by 3 , and if one is equivalent to 1 mod 3 and the other to 2 mod 3 then m + n will be divisible by 3 .
Problem Loading...
Note Loading...
Set Loading...
I think using the primitive pythagorean triplets( 2 m n , m 2 − n 2 , m 2 + n 2 )we can easily manage that. Note that m and n are relatively prime.