All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Shapes
Pythagorean chain converse (Posted on 2006-06-16) Difficulty: 3 of 5
Take a right triangle with integer sides A, B, & C.
(C need not be the hypotenuse.)

To side C attach another right triangle with integer sides C, D & E.

On this new triangle attach another right triangle to either side D or E.

Continue the process of attaching a new right triangle to the previous, creating a chain of integer right triangles.

No side length may be repeated.

If n is the number of triangles in the chain, what is the minimum largest side for n=2, 3, 4, 5, 6, 7, 8, 9, 10.

No Solution Yet Submitted by Jer    
No Rating

Comments: ( You must be logged in to post comments.)
  Subject Author Date
n = 8, 9 & 10 (Spoiler?)Dej Mar2006-06-19 05:51:17
re: n = 7 (Spoiler?)brianjn2006-06-18 04:08:04
n = 7 (Spoiler?)Steve Herman2006-06-17 08:14:36
Some Thoughtsn = 6 (spoiler)Steve Herman2006-06-17 08:01:43
Some Thoughtsn = 2,3,4,5 (spoiler)Steve Herman2006-06-16 17:06:43
Please log in:
Remember me:
Sign up! | Forgot password

Search body:
Forums (4)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (3)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Copyright © 2002 - 2020 by Animus Pactum Consulting. All rights reserved. Privacy Information