1.0 KiB

Raw Blame History

id	title	challengeType	forumTopicId	dashedName
5900f3ba1000cf542c50fecd	Problem 78: Coin partitions	5	302191	problem-78-coin-partitions

--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.

--hints--

coinPartitions() should return a number.

assert(typeof coinPartitions() === 'number');

coinPartitions() should return 55374.

assert.strictEqual(coinPartitions(), 55374);

--seed--

--seed-contents--

function coinPartitions() {

  return true;
}

coinPartitions();

--solutions--

// solution required

1.0 KiB Raw Blame History