Problem 57949. Easy Sequences 106: Counting Pythagorean Triangles inside a Circle
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 commentsProblem Recent Solvers1
Suggested Problems
-
Pythagorean perfect squares: find the square of the hypotenuse and the length of the other side
53 Solvers
-
60 Solvers
-
Poker Series 01: isStraightFlush
120 Solvers
-
355 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
471 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!