project_euler.problem_078.sol1

Problem 78 Url: https://projecteuler.net/problem=78 Statement: 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.

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.

Functions

solution(→ int)

Module Contents

project_euler.problem_078.sol1.solution(number: int = 1000000) → int

>>> solution(1)
1

>>> solution(9)
14

>>> solution()
55374