Files
freeCodeCamp/curriculum/challenges/english/10-coding-interview-prep/project-euler/problem-76-counting-summations.english.md
Oliver Eyton-Williams bd68b70f3d Feat: hide blocks not challenges (#39504)
* fix: remove isHidden flag from frontmatter

* fix: add isUpcomingChange

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

* feat: hide blocks not challenges

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>

Co-authored-by: Ahmad Abdolsaheb <ahmad.abdolsaheb@gmail.com>
2020-09-03 15:07:40 -07:00

1.1 KiB

id, challengeType, title, forumTopicId
id challengeType title forumTopicId
5900f3b81000cf542c50fecb 5 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

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