SciCalc.net
IndiaFree tools

Permutation calculator (nPr)

How many ordered arrangements of r items can be made from n? Enter n and r. Order matters here: first, second and third are different places.

Last updated

10P3 =

720

Working

  1. 110P3 = 720n! ÷ (n − r)!
Try:

How it works

nPr = n! ÷ (n − r)!

There are n choices for the first place, n − 1 for the second, and so on for r places: nPr = n × (n − 1) × … × (n − r + 1).

Worked example

10 runners race. How many ways can gold, silver and bronze be awarded? 10P3 = 10 × 9 × 8 = 720. 4-letter codes with no repeated letter: 26P4 = 358,800.

Quick answers for common values

QuestionWorkingAnswer
4P24 × 312
8P28 × 756
10P410 × 9 × 8 × 75,040
12P312 × 11 × 101,320
All orders of 1, 2, 3, 4, 5, 66!720

The product n × (n − 1) × … × (n − r + 1) is called a falling factorial, and nPr is exactly that product.

Permutations with repetition

When an item can be used again, every position has the full n choices, so the count is nr. A 4-digit PIN using 0–9 has 104 = 10,000 options. If no digit may repeat, it is 10P4 = 5,040, so 10,000 − 5,040 = 4,960 PINs use some digit more than once. Four-letter codes from A to Z give 264 = 456,976 with repeats and 26P4 = 358,800 without.

With repetition, r can be larger than n. An 8-bit binary string has 28 = 256 options even though there are only 2 symbols. The calculator above counts without repeats, so it rejects r greater than n.

How many ways can you arrange letters that repeat?

Swapping two identical letters does not make a new word, so divide by the factorial of each letter's count:

n! ÷ (n1! × n2! × …)

BOOKS has 5 letters with two O's: 5! ÷ 2! = 60. MISSISSIPPI has 11 letters with four I's, four S's and two P's: 11! ÷ (4! × 4! × 2!) = 34,650. Using 11! = 39,916,800 alone would count the same word many times.

Seats around a round table

At a round table, only the order relative to the other people matters. Fix one person's seat and arrange the rest. Six people can sit in (6 − 1)! = 120 different ways.

Common mistakes

  • Using nPr when order does not matter. It overcounts by r!, so divide by r! to get nCr.
  • Using n! ÷ (n − r)! when items can repeat. Use nr instead.
  • Treating identical items as different. Divide by the repeat factorials.

Tips

  • nPn = n!, the number of ways to arrange everything.
  • If repeats are allowed (like a PIN), the count is nʳ instead.
  • On the main calculator, type 10P3 or use the nPr key.

Questions

When do I use permutations instead of combinations?

When the order or position matters, such as rankings, passwords without repeats or seating plans.

What is 10P3?

720.

How are nPr and nCr related?

nPr = nCr × r!.

What is 4 permutation 2?

4P2 = 4 × 3 = 12. From A, B, C, D the ordered pairs are AB, AC, AD, BA, BC, BD, CA, CB, CD, DA, DB and DC.

What is 8 permutation 2?

8P2 = 8 × 7 = 56.

How many permutations of 1, 2, 3, 4, 5, 6 are there?

Arranging all six numbers gives 6! = 720 different orders.

Sources

  1. NIST Digital Library of Mathematical Functions, §26.1 Special Notation. Falling factorial notation x(x − 1)(x − 2)···(x − n + 1). Checked 22 November 2026.
  2. NIST Digital Library of Mathematical Functions, §26.4 Lattice Paths: Multinomial Coefficients and Set Partitions. Eq. 26.4.2 (multinomial coefficient). Checked 22 November 2026.