freeCodeCamp/problem-276-primitive-triangles.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

932 B

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4801000cf542c50ff93	5	false	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() {
  // Good luck!
  return true;
}

euler276();

Solution

// solution required

932 B Raw Blame History