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
-
Replace NaNs with the number that appears to its left in the row.
2968 Solvers
-
Get the elements of diagonal and antidiagonal for any m-by-n matrix
473 Solvers
-
Generate N equally spaced intervals between -L and L
857 Solvers
-
We love vectorized solutions. Problem 1 : remove the row average.
813 Solvers
-
Integer Sequence - II : New Fibonacci
482 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!