# PERMUT

## Content

This function returns the number of possible permutations for a specified number of items.

## Syntax

`PERMUT(k, n)`

## Arguments

This function has these arguments:

| Argument | Description |
| -------- | ----------- |
| *k* | [Required] Number of items; must be greater than 0; if not an integer, the number is truncated |
| *n* | [Required] Number of items in each possible permutation; must be positive or 0; if not an integer, the number is truncated |

## Remarks

A permutation is any set or subset of items where internal order is significant. Contrast with combinations (the COMBIN function).
The equation for this function is:
![](https://cdn.mescius.io/document-site-files/images/8d606653-16a0-474d-b9dc-e2b4d01c2446/images/Func-PERMUT.png)
where k and n are defined in the arguments.

## Examples

`PERMUT(B3,5)`
`PERMUT(C4,B2)`
`PERMUT(R1C2,2)`
`PERMUT(8,2)` gives the result 56
`PERMUT(100,3)` gives the result 970200