freeCodeCamp/problem-351-hexagonal-orchards.english.md at 088acf45d91e7e32081eabe9660beefb2e9c0172

Files

Valeriy 79d9012432 fix(curriculum): quotes in tests (#18828 )

* fix(curriculum): tests quotes

* fix(curriculum): fill seed-teardown

* fix(curriculum): fix tests and remove unneeded seed-teardown

2018-10-20 23:32:47 +05:30

1.2 KiB

Raw Blame History

id, challengeType, title

id	challengeType	title
5900f4cb1000cf542c50ffde	5	Problem 351: Hexagonal orchards

Description

A hexagonal orchard of order n is a triangular lattice made up of points within a regular hexagon with side n. The following is an example of a hexagonal orchard of order 5:

Highlighted in green are the points which are hidden from the center by a point closer to it. It can be seen that for a hexagonal orchard of order 5, 30 points are hidden from the center.

Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.

H(5) = 30. H(10) = 138. H(1 000) = 1177848.

Find H(100 000 000).

Instructions

Tests

tests:
  - text: <code>euler351()</code> should return 11762187201804552.
    testString: assert.strictEqual(euler351(), 11762187201804552, '<code>euler351()</code> should return 11762187201804552.');

Challenge Seed

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

euler351();

Solution

// solution required

1.2 KiB Raw Blame History