freeCodeCamp/problem-276-primitive-triangles.md at 2c9a900353d88bfc6736681b7ca63201ddea4dd5

Oliver Eyton-Williams 2b9e38a17b

fix: replace .english.md extension with .md

2020-09-29 22:09:04 +02:00

901 B

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f4801000cf542c50ff93	5	Problem 276: Primitive Triangles	301926

Description

Consider the triangles with integer sides a, b and c with a ≤ b ≤ c. An integer sided triangle (a,b,c) is called primitive if gcd(a,b,c)=1. How many primitive integer sided triangles exist with a perimeter not exceeding 10 000 000?

Instructions

Tests

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

Challenge Seed

function euler276() {

  return true;
}

euler276();

Solution

// solution required

901 B Raw Blame History