Factorial Calculator N Over J

The factorial calculator n over j (n!/(n-j)!) helps you compute permutations where order matters. This is useful in probability, combinatorics, and statistics when you need to calculate the number of ways to arrange j items from a set of n distinct items.

What is factorial n over j?

Factorial n over j (often written as P(n,j) or nPj) represents the number of ways to arrange j items from a set of n distinct items where the order of selection matters. This is different from combinations, where order doesn't matter.

For example, if you have 5 distinct books and want to arrange 3 of them on a shelf, the number of possible arrangements is P(5,3) = 5!/(5-3)! = 60.

Formula

The formula for factorial n over j is:

P(n,j) = n! / (n-j)!

Where:

n! = n × (n-1) × (n-2) × ... × 1
(n-j)! = (n-j) × (n-j-1) × ... × 1

This formula works when n is a positive integer and j is a non-negative integer less than or equal to n.

How to calculate

Determine the value of n (total number of items)
Determine the value of j (number of items to arrange)
Calculate n! (n factorial)
Calculate (n-j)! ((n-j) factorial)
Divide n! by (n-j)! to get the result

Note: For large values of n and j, the factorial calculation can become very large quickly. The calculator handles this automatically.

Examples

Example 1: Basic permutation

Calculate P(5,2):

5! = 5 × 4 × 3 × 2 × 1 = 120
(5-2)! = 3! = 3 × 2 × 1 = 6
P(5,2) = 120 / 6 = 20

There are 20 ways to arrange 2 items from a set of 5 distinct items.

Example 2: Larger numbers

Calculate P(10,4):

10! = 3,628,800
(10-4)! = 6! = 720
P(10,4) = 3,628,800 / 720 = 5,040

There are 5,040 ways to arrange 4 items from a set of 10 distinct items.

Comparison of P(n,j) for different values
n	j	P(n,j)
5	2	20
6	3	120
7	4	840
8	5	6,720

Applications

Factorial n over j is used in various fields:

Probability: Calculating permutations in probability problems
Combinatorics: Determining the number of possible arrangements
Statistics: Analyzing ordered samples
Computer Science: Algorithm analysis and complexity
Engineering: Designing systems with ordered components

FAQ

What's the difference between factorial n over j and combinations?

Factorial n over j (permutations) counts ordered arrangements, while combinations count unordered selections. For example, P(3,2) = 6 (AB, AC, BA, BC, CA, CB) while C(3,2) = 3 (AB, AC, BC).

Can I use this calculator for large numbers?

Yes, the calculator handles large numbers automatically. However, very large factorials can result in extremely large numbers that may not be practical for all applications.

What if j is greater than n?

The calculator will show an error because factorial n over j is only defined when j ≤ n.

How is this different from n! alone?

n! gives the number of permutations of all n items, while n!/(n-j)! gives the number of permutations of j items from n items.