22afc2a0ca
Co-authored-by: Oliver Eyton-Williams <ojeytonwilliams@gmail.com> Co-authored-by: Kristofer Koishigawa <scissorsneedfoodtoo@gmail.com> Co-authored-by: Beau Carnes <beaucarnes@gmail.com>
1.1 KiB
1.1 KiB
id, challengeType, isHidden, title, forumTopicId
| id | challengeType | isHidden | title | forumTopicId |
|---|---|---|---|---|
| 5900f3b81000cf542c50fecb | 5 | false | Problem 76: Counting summations | 302189 |
Description
It is possible to write five as a sum in exactly six different ways:
4 + 1
3 + 2
3 + 1 + 1
2 + 2 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 + 1
3 + 2
3 + 1 + 1
2 + 2 + 1
2 + 1 + 1 + 1
1 + 1 + 1 + 1 + 1
How many different ways can one hundred be written as a sum of at least two positive integers?
Instructions
Tests
tests:
- text: <code>countingSummations()</code> should return a number.
testString: assert(typeof countingSummations() === 'number');
- text: <code>countingSummations()</code> should return 190569291.
testString: assert.strictEqual(countingSummations(), 190569291);
Challenge Seed
function countingSummations() {
// Good luck!
return true;
}
countingSummations();
Solution
// solution required