This website is a semi-functional mirror of the original Project Euler. More information is available on GitHub.
projecteuler.net

Permutations of Project

Problem 458

Published on 09 February 2014 at 07:00 am [Server Time]

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.


Answer not yet available
Go to back to Problems