🔀 Permutation Calculator (nPr)

เกี่ยวกับเครื่องคิดเลขนี้

A permutation counts how many ways you can arrange r items chosen from a set of n, where order matters — so first, second and third place are three different outcomes. This calculator returns the exact count and the formula it used, even for large n and r.

The formula is nPr = n! / (n − r)!, which is the same as multiplying the top r numbers counting down from n. For 10 items taken 3 at a time, that is 10 × 9 × 8 = 720. Choosing none gives nP0 = 1, and arranging all of them gives nPn = n!. You cannot choose more items than you have, so if r is greater than n the tool returns a dash.

Permutations answer "how many ordered sequences?" — the number of possible race finishes, seating orders, PIN codes or ranked shortlists. When order does not matter, use a combination instead, which is always the smaller count.