Problem 57949. Easy Sequences 106: Counting Pythagorean Triangles inside a Circle

• Created by Ramon Villamangca

×

Like (1)

Difficulty:

(695)

Rate

• Solve Later   
• Add To GroupÂ

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.

Solve

Solution Stats

50.0% Correct | 50.0% Incorrect

• 2 Solutions
• 1 Solvers

Last Solution submitted on Jun 12, 2023

Last 200 Solutions

Solution Comments

Problem Recent Solvers1

Suggested Problems

• Swap the first and last columns

  21478 Solvers

• Poker Series 01: isStraightFlush

  121 Solvers

• What number has this problem?

  393 Solvers

• Height of a right-angled triangle

  1900 Solvers

• Spot the First Occurrence of 5

  421 Solvers

More from this Author116

• Easy Sequences 117: Fractional Part of Cube Roots

  4 Solvers

• Easy Sequences 25: Product of Series

  16 Solvers

• Easy Sequences 99: One-line Code Challenge - Real Digitizer

  1 Solvers

• Easy Sequences 15: Pythagorean Area with maximum Hypotenuse

  8 Solvers

• Easy Sequences 45: Second Derivative of Inverse Polynomial Function

  5 Solvers