freeCodeCamp/problem-351-hexagonal-orchards.english.md at f1c9b08cf322e4268a0a31ae9b5d75bf3cfce7d1

Files

Oliver Eyton-Williams f1c9b08cf3 fix(curriculum): add isHidden: false to challenges

This includes certificates (where it does nothing), but does not
include any translations.

2020-05-25 16:25:19 +05:30

1.2 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f4cb1000cf542c50ffde	5	false	Problem 351: Hexagonal orchards	302011

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);

Challenge Seed

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

euler351();

Solution

// solution required

1.2 KiB Raw Blame History