freeCodeCamp/problem-91-right-triangles-with-integer-coordinates.md at 2c9a900353d88bfc6736681b7ca63201ddea4dd5

Oliver Eyton-Williams 2b9e38a17b

fix: replace .english.md extension with .md

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

2.1 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f3c71000cf542c50feda	5	Problem 91: Right triangles with integer coordinates	302208

Description

The points P (x₁, y₁) and Q (x₂, y₂) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.

a graph plotting points P (x_1, y_1) and Q(x_2, y_2) at integer coordinates that are joined to the origin O (0, 0)

There are exactly fourteen triangles containing a right angle that can be formed when each co-ordinate lies between 0 and 2 inclusive; that is, 0 ≤ x₁, y₁, x₂, y₂ ≤ 2.

a diagram showing the 14 triangles containing a right angle that can be formed when each coordinate is between 0 and 2

Given that 0 ≤ x₁, y₁, x₂, y₂ ≤ 50, how many right triangles can be formed?

Instructions

Tests

tests:
  - text: <code>rightTrianglesIntCoords()</code> should return a number.
    testString: assert(typeof rightTrianglesIntCoords() === 'number');
  - text: <code>rightTrianglesIntCoords()</code> should return 14234.
    testString: assert.strictEqual(rightTrianglesIntCoords(), 14234);

Challenge Seed

function rightTrianglesIntCoords() {

  return true;
}

rightTrianglesIntCoords();

Solution

// solution required

2.1 KiB Raw Blame History