freeCodeCamp/problem-373-circumscribed-circles.english.md at 908adc2c372f2c1af0c8d1c80b264c23f96fd7d7

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com>
Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com>
Co-authored-by: Beau Carnes <beaucarnes@gmail.com>

2020-05-27 13:19:08 +05:30

1.0 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4e11000cf542c50fff4	5	false	Problem 373: Circumscribed Circles	302035

Description

Every triangle has a circumscribed circle that goes through the three vertices. Consider all integer sided triangles for which the radius of the circumscribed circle is integral as well.

Let S(n) be the sum of the radii of the circumscribed circles of all such triangles for which the radius does not exceed n.

S(100)=4950 and S(1200)=1653605.

Find S(107).

Instructions

Tests

tests:
  - text: <code>euler373()</code> should return 727227472448913.
    testString: assert.strictEqual(euler373(), 727227472448913);

Challenge Seed

function euler373() {
  // Good luck!
  return true;
}

euler373();

Solution

// solution required

1.0 KiB Raw Blame History