2018-10-10 22:03:03 +00:00
---
id: 5900f4b11000cf542c50ffc3
2021-02-06 04:42:36 +00:00
title: 'Problem 324: Building a tower'
2018-10-10 22:03:03 +00:00
challengeType: 5
2021-02-06 04:42:36 +00:00
forumTopicId: 301981
2021-01-13 02:31:00 +00:00
dashedName: problem-324-building-a-tower
2018-10-10 22:03:03 +00:00
---
2020-12-16 07:37:30 +00:00
# --description--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
Let f(n) represent the number of ways one can fill a 3× 3× n tower with blocks of 2× 1× 1. You're allowed to rotate the blocks in any way you like; however, rotations, reflections etc of the tower itself are counted as distinct.
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
For example (with q = 100000007) :f(2) = 229,f(4) = 117805,f(10) mod q = 96149360,f(103) mod q = 24806056,f(106) mod q = 30808124.
Find f(1010000) mod 100000007.
2018-10-10 22:03:03 +00:00
2020-12-16 07:37:30 +00:00
# --hints--
2018-10-10 22:03:03 +00:00
2021-02-06 04:42:36 +00:00
`euler324()` should return 96972774.
2018-10-10 22:03:03 +00:00
```js
2020-12-16 07:37:30 +00:00
assert.strictEqual(euler324(), 96972774);
2018-10-10 22:03:03 +00:00
```
2021-01-13 02:31:00 +00:00
# --seed--
## --seed-contents--
```js
function euler324() {
return true;
}
euler324();
```
2020-12-16 07:37:30 +00:00
# --solutions--
2020-08-13 15:24:35 +00:00
2021-01-13 02:31:00 +00:00
```js
// solution required
```