Enter total objects n and how many you arrange r. Get P(n,r): the number of ordered arrangements. Order matters here, so first-second-third is different from third-second-first. Runs in your browser.
Permutations count arrangements. Picking A then B then C is not the same as C then B then A. Use P(n,r) when positions, ranks, or sequence matter: podium finishes, password order, seating in a row.
Formula: P(n,r) = n! / (n−r)!. Constraint: n ≥ r ≥ 0.
Combinations ignore order; permutations do not. For the same n and r, P(n,r) = C(n,r) × r!. Use our Combination Calculator when the order of selection does not matter.
