Pythagorean Triangle is a right triangle all sides of which are represented by integers. Examples are triangles with sides
and
.
Our goal in this exercise is to write a function that outputs the maximum number of unique pythagorean triangles that can fit inside a circle of radius R, with overlaps are allowed.
For example if
, the following unique pythagorean triangles can fit inside the circle:
,
,
,
,
, and
. Hence, for
, the function should return 6.
--------------------
NOTE: Unique means that congruent triangles, even if rotated or reflected, are counted only once.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers1
Suggested Problems
-
2009 Solvers
-
Converting numbers back from extended form
127 Solvers
-
Side of an equilateral triangle
6883 Solvers
-
Divisible by n, prime divisors (including powers)
95 Solvers
-
Divisible by n, prime divisors from 20 to 200
68 Solvers
More from this Author116
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!