fix(curriculum): clean-up Project Euler 462-480 (#43069)

* fix: clean-up Project Euler 462-480

* fix: missing image extension

* fix: corrections from review

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

Co-authored-by: Tom <20648924+moT01@users.noreply.github.com>
This commit is contained in:
gikf
2021-07-30 17:32:21 +02:00
committed by GitHub
parent a2b2ef3f75
commit 397a9f0c3e
19 changed files with 309 additions and 240 deletions

View File

@@ -8,22 +8,24 @@ dashedName: problem-475-music-festival
# --description--
12n musicians participate at a music festival. On the first day, they form 3n quartets and practice all day.
$12n$ musicians participate at a music festival. On the first day, they form $3n$ quartets and practice all day.
It is a disaster. At the end of the day, all musicians decide they will never again agree to play with any member of their quartet.
On the second day, they form 4n trios, each musician avoiding his previous quartet partners.
On the second day, they form $4n$ trios, each musician avoiding his previous quartet partners.
Let f(12n) be the number of ways to organize the trios amongst the 12n musicians. You are given f(12) = 576 and f(24) mod 1 000 000 007 = 509089824.
Let $f(12n)$ be the number of ways to organize the trios amongst the $12n$ musicians.
Find f(600) mod 1 000 000 007.
You are given $f(12) = 576$ and $f(24)\bmod 1\\,000\\,000\\,007 = 509\\,089\\,824$.
Find $f(600)\bmod 1\\,000\\,000\\,007$.
# --hints--
`euler475()` should return 75780067.
`musicFestival()` should return `75780067`.
```js
assert.strictEqual(euler475(), 75780067);
assert.strictEqual(musicFestival(), 75780067);
```
# --seed--
@@ -31,12 +33,12 @@ assert.strictEqual(euler475(), 75780067);
## --seed-contents--
```js
function euler475() {
function musicFestival() {
return true;
}
euler475();
musicFestival();
```
# --solutions--