22afc2a0ca
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>
78 lines
1.2 KiB
Markdown
78 lines
1.2 KiB
Markdown
---
|
|
id: 5900f4cb1000cf542c50ffde
|
|
challengeType: 5
|
|
isHidden: false
|
|
title: 'Problem 351: Hexagonal orchards'
|
|
forumTopicId: 302011
|
|
---
|
|
|
|
## Description
|
|
<section id='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).
|
|
</section>
|
|
|
|
## Instructions
|
|
<section id='instructions'>
|
|
|
|
</section>
|
|
|
|
## Tests
|
|
<section id='tests'>
|
|
|
|
```yml
|
|
tests:
|
|
- text: <code>euler351()</code> should return 11762187201804552.
|
|
testString: assert.strictEqual(euler351(), 11762187201804552);
|
|
|
|
```
|
|
|
|
</section>
|
|
|
|
## Challenge Seed
|
|
<section id='challengeSeed'>
|
|
|
|
<div id='js-seed'>
|
|
|
|
```js
|
|
function euler351() {
|
|
// Good luck!
|
|
return true;
|
|
}
|
|
|
|
euler351();
|
|
```
|
|
|
|
</div>
|
|
|
|
|
|
|
|
</section>
|
|
|
|
## Solution
|
|
<section id='solution'>
|
|
|
|
```js
|
|
// solution required
|
|
```
|
|
|
|
</section>
|