---
id: 5900f5361000cf542c510049
title: 'Problem 458: Permutations of Project'
challengeType: 5
forumTopicId: 302132
dashedName: problem-458-permutations-of-project
---

# --description--

Consider the alphabet A made out of the letters of the word "project": A={c,e,j,o,p,r,t}.

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.

# --hints--

`euler458()` should return 423341841.

```js
assert.strictEqual(euler458(), 423341841);
```

# --seed--

## --seed-contents--

```js
function euler458() {

  return true;
}

euler458();
```

# --solutions--

```js
// solution required
```