freeCodeCamp/problem-78-coin-partitions.english.md at ef79ddd0de35a4e10b8b4588e67938f86d2bae10

Files

mrugesh 22afc2a0ca feat(learn): python certification projects (#38216 )

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>

2020-05-27 13:19:08 +05:30

1.3 KiB

Raw Blame History

id, challengeType, isHidden, title, forumTopicId

id	challengeType	isHidden	title	forumTopicId
5900f3ba1000cf542c50fecd	5	false	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() {
  // Good luck!
  return true;
}

coinPartitions();

Solution

// solution required

1.3 KiB Raw Blame History