freeCodeCamp/problem-78-coin-partitions.md at 5f956e9a16b45186aa7f3ed8590c1d23ba997624

Files

Oliver Eyton-Williams 2b9e38a17b fix: replace .english.md extension with .md

2020-09-29 22:09:04 +02:00

1.2 KiB

Raw Blame History

id, challengeType, title, forumTopicId

id	challengeType	title	forumTopicId
5900f3ba1000cf542c50fecd	5	Problem 78: Coin partitions	302191

Description

Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.

Coin piles
OOOOO
OOOO O
OOO OO
OOO O O
OO OO O
OO O O O
O O O O O

Find the least value of n for which p(n) is divisible by one million.

Instructions

Tests

tests:
  - text: <code>coinPartitions()</code> should return a number.
    testString: assert(typeof coinPartitions() === 'number');
  - text: <code>coinPartitions()</code> should return 55374.
    testString: assert.strictEqual(coinPartitions(), 55374);

Challenge Seed

function coinPartitions() {

  return true;
}

coinPartitions();

Solution

// solution required

1.2 KiB Raw Blame History