Files

gikf a2b2ef3f75 fix(curriculum): clean-up Project Euler 441-460 (#43068 )

* fix: clean-up Project Euler 441-460

* fix: corrections from review

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>

2021-07-30 08:20:31 -07:00

857 B

Raw Blame History

id, title, challengeType, forumTopicId, dashedName

id	title	challengeType	forumTopicId	dashedName
5900f5361000cf542c510049	Problem 458: Permutations of Project	5	302132	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) = 7^7 - 7! = 818\\,503.

Find T({10}^{12}). Give the last 9 digits of your answer.

--hints--

permutationsOfProject() should return 423341841.

assert.strictEqual(permutationsOfProject(), 423341841);

--seed--

--seed-contents--

function permutationsOfProject() {

  return true;
}

permutationsOfProject();

--solutions--

// solution required

857 B Raw Blame History