freeCodeCamp/curriculum/challenges/english/08-coding-interview-prep/project-euler/problem-78-coin-partitions.english.md

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.

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

Instructions

Tests

tests:
  - text: <code>euler78()</code> should return 55374.
    testString: assert.strictEqual(euler78(), 55374);

Challenge Seed

function euler78() {
  // Good luck!
  return true;
}

euler78();

Solution

// solution required