2018-10-10 18:03:03 -04:00
---
id: 5900f4cb1000cf542c50ffde
2021-02-06 04:42:36 +00:00
title: 'Problem 351: Hexagonal orchards'
2018-10-10 18:03:03 -04:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 302011
2021-01-13 03:31:00 +01:00
dashedName: problem-351-hexagonal-orchards
2018-10-10 18:03:03 -04:00
---
2020-12-16 00:37:30 -07:00
# --description--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
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:
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
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.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Let H(n) be the number of points hidden from the center in a hexagonal orchard of order n.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
H(5) = 30. H(10) = 138. H(1 000) = 1177848.
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
Find H(100 000 000).
2018-10-10 18:03:03 -04:00
2020-12-16 00:37:30 -07:00
# --hints--
2018-10-10 18:03:03 -04:00
2021-02-06 04:42:36 +00:00
`euler351()` should return 11762187201804552.
2018-10-10 18:03:03 -04:00
```js
2020-12-16 00:37:30 -07:00
assert.strictEqual(euler351(), 11762187201804552);
2018-10-10 18:03:03 -04:00
```
2021-01-13 03:31:00 +01:00
# --seed--
## --seed-contents--
```js
function euler351() {
return true;
}
euler351();
```
2020-12-16 00:37:30 -07:00
# --solutions--
2020-08-13 17:24:35 +02:00
2021-01-13 03:31:00 +01:00
```js
// solution required
```