mirror of
https://github.com/josdejong/mathjs.git
synced 2026-01-25 15:07:57 +00:00
1.3 KiB
1.3 KiB
| layout |
|---|
| default |
Function permutations #
Compute the number of ways of obtaining an ordered subset of k elements
from a set of n elements.
Permutations only takes integer arguments. The following condition must be enforced: k <= n.
Syntax #
math.permutations(n)
math.permutations(n, k)
Parameters #
| Parameter | Type | Description |
|---|---|---|
n |
number | BigNumber | The number of objects in total |
k |
number | BigNumber | The number of objects in the subset |
Returns #
| Type | Description |
|---|---|
| number | BigNumber | The number of permutations |
Examples #
math.permutations(5) // 120
math.permutations(5, 3) // 60