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 Solvers4
Suggested Problems
-
Project Euler: Problem 10, Sum of Primes
2131 Solvers
-
Back to basics 23 - Triangular matrix
1152 Solvers
-
Create logical matrix with a specific row and column sums
352 Solvers
-
Find the optimal shape to bring the maximum product by a given perimeter
45 Solvers
-
Return fibonacci sequence do not use loop and condition
873 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!