2018-09-30 22:01:58 +00:00
---
id: 5900f5361000cf542c510049
title: 'Problem 458: Permutations of Project'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 302132
2021-01-13 02:31:00 +00:00
dashedName: problem-458-permutations-of-project
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2018-09-30 22:01:58 +00:00
Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.
2020-11-27 18:02:05 +00:00
2018-09-30 22:01:58 +00:00
Let T(n) be the number of strings of length n consisting of letters from A that do not have a substring that is one of the 5040 permutations of "project".
T(7)=77-7!=818503.
Find T(1012). Give the last 9 digits of your answer.
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`euler458()` should return 423341841.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert.strictEqual(euler458(), 423341841);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
# --seed--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function euler458() {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return true;
}
euler458();
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```