1.4 KiB
1.4 KiB
id | challengeType | title |
---|---|---|
5900f3e01000cf542c50fef3 | 5 | Problem 116: Red, green or blue tiles |
Description
If green tiles are chosen there are three ways.
And if blue tiles are chosen there are two ways.
Assuming that colours cannot be mixed there are 7 + 3 + 2 = 12 ways of replacing the black tiles in a row measuring five units in length. How many different ways can the black tiles in a row measuring fifty units in length be replaced if colours cannot be mixed and at least one coloured tile must be used? NOTE: This is related to Problem 117.
Instructions
Tests
tests:
- text: <code>euler116()</code> should return 20492570929.
testString: assert.strictEqual(euler116(), 20492570929, '<code>euler116()</code> should return 20492570929.');
Challenge Seed
function euler116() {
// Good luck!
return true;
}
euler116();
Solution
// solution required