perplexus.info :: Geometry : Calling all pythagoreans

Calling all pythagoreans (Posted on 2006-07-03)

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?

See The Solution Submitted by e.g.

Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)

re: Somekind of solution

| Comment 4 of 7 |

(In reply to Somekind of solution by atheron)

Actually, not ALL pythagorean triples are produced with this formula; for example, (9,12,15) cannot be obtained. The general formula is 2LMN, L(M^2-N^2), L(M^2+N^2).

Posted by Federico Kereki on 2006-07-03 14:26:46

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:


perplexus dot info