freeCodeCamp/problem-370-geometric-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

1.1 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4de1000cf542c50fff1	5	false	Problem 370: Geometric triangles	302032

Description

Let us define a geometric triangle as an integer sided triangle with sides a ≤ b ≤ c so that its sides form a geometric progression, i.e. b2 = a · c .

An example of such a geometric triangle is the triangle with sides a = 144, b = 156 and c = 169.

There are 861805 geometric triangles with perimeter ≤ 106 .

How many geometric triangles exist with perimeter ≤ 2.5·1013 ?

Instructions

Tests

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

Challenge Seed

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

euler370();

Solution

// solution required

1.1 KiB Raw Blame History