Partitions of n into exactly k positive parts

\(p(n,k) = p(n-1,k-1) + p(n-k,k)\): either the smallest part is 1, or every part exceeds 1 and one can be removed from each.

Usage

morie_partitions_into_parts(n, k)

Arguments

n, k

Non-negative whole numbers.

Value

A morie_bigint.

Examples

morie_partitions_into_parts(n = 5L, k = 5L)
#> 1