Calculadora de Permutações

The Permutations Calculator computes the number of ways to order k distinct elements chosen from a set of n elements, where order matters. The formula used is P(n,k) = n! / (n−k)!. For example, if you have 5 books and want to know how many ways you can arrange 3 of them on a shelf, the calculator returns 60 permutations. This tool is useful in combinatorial analysis, probability, and statistics problems.

The operation is simple: you enter the value of n (total size of the set) and k (number of elements to be ordered). The calculator checks if k ≤ n and applies the formula. If k > n, the result is zero, as it is impossible to choose more elements than available. The calculation uses factorials, which can generate large numbers, but the tool handles this efficiently.

Use this calculator in situations such as: determining the number of distinct passwords with non-repeating characters, calculating ways to rank participants on a podium, or planning work shifts with distinct positions. It is especially useful in contests, entrance exams, and probability problems where the order of elements matters.

Cautions: ensure that order really matters. If order does not matter, you should use a combinations calculator. Also, remember that k must be less than or equal to n. Large values of n (above 20) may result in huge numbers, but the calculator displays the result in scientific notation when necessary.