ee1e8abd87
* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
974 B
974 B
id, title, challengeType, forumTopicId, dashedName
| id | title | challengeType | forumTopicId | dashedName |
|---|---|---|---|---|
| 5900f4cf1000cf542c50ffe1 | Problem 354: Distances in a bee's honeycomb | 5 | 302014 | problem-354-distances-in-a-bees-honeycomb |
--description--
Consider a honey bee's honeycomb where each cell is a perfect regular hexagon with side length 1.
One particular cell is occupied by the queen bee. For a positive real number L, let B(L) count the cells with distance L from the queen bee cell (all distances are measured from centre to centre); you may assume that the honeycomb is large enough to accommodate for any distance we wish to consider. For example, B(√3) = 6, B(√21) = 12 and B(111 111 111) = 54.
Find the number of L ≤ 5·1011 such that B(L) = 450.
--hints--
euler354() should return 58065134.
assert.strictEqual(euler354(), 58065134);
--seed--
--seed-contents--
function euler354() {
return true;
}
euler354();
--solutions--
// solution required