Connect via MCP →

Enter Calculation

Formula

Advertisement

Results

Circular Permutation Table
28
rows for n = 3 to 30
n Circular permutations (n-1)!
3 2
4 6
5 24
6 120
7 720
8 5040
9 40320
10 362880
11 3628800
12 39916800
13 479001600
14 6227020800
15 87178291200
16 1307674368000
17 20922789888000
18 355687428096000
19 6402373705728000
20 121645100408832000
21 2432902008176640000
22 51090942171709440000
23 1124000727777607680000
24 25852016738884976640000
25 620448401733239439360000
26 15511210043330985984000000
27 403291461126605635584000000
28 10888869450418352160768000000
29 304888344611713860501504000000
30 8841761993739701954543616000000

What is a circular permutation?

A circular permutation counts the distinct ways to arrange n distinct objects around a circle, treating arrangements that differ only by rotation as the same. While there are \(n!\) ways to arrange n objects in a line, each circular arrangement corresponds to n rotated copies, so the number of distinct circular arrangements is \(n! / n = (n - 1)!\). This calculator builds a table of \((n - 1)!\) for every integer n in a range you choose.

Four distinct people arranged around a circular table with rotations shown as equivalent
In a circular arrangement, rotations of the same order count as one permutation.

How to use this calculator

Enter a start value and an end value for n (each between 1 and 100), then pick how many significant digits to display. The tool computes \((n - 1)!\) exactly using arbitrary-precision integers, then prints the full integer when it fits within your chosen digit count, or rounds it to scientific notation otherwise. Because factorials grow extremely fast, values for large n are shown like \(8.84 \times 10^{30}\).

The formula explained

Fix one object in place to remove rotational symmetry; the remaining \((n - 1)\) objects can be arranged in \((n - 1)!\) ways. That is why circular permutations equal \((n - 1)!\) rather than \(n!\). Note that reflections are NOT treated as identical here, so this is the standard directed count, not the necklace count \((n - 1)! / 2\).

Advertisement
Linear arrangements grouped into rotation classes to show division by n
The n! linear orderings collapse into (n-1)! circular ones because each ring has n rotations.

Worked example

For n from 3 to 6: n=3 gives \(2! = 2\), n=4 gives \(3! = 6\), n=5 gives \(4! = 24\), and n=6 gives \(5! = 120\). The table therefore has 4 rows. For a larger value, n=30 gives $$29! = 8{,}841{,}761{,}993{,}739{,}701{,}954{,}543{,}616{,}000{,}000,$$ roughly \(8.84 \times 10^{30}\).

FAQ

Why do n=1 and n=2 both give 1? Because \(0! = 1\) and \(1! = 1\); a single object or two objects on a circle each have exactly one distinct arrangement.

Why scientific notation? 99! has about 156 digits, so full integers become unreadable; the significant-digits setting controls display only and does not affect the underlying exact computation.

Are reflections counted as the same? No. This tool computes \((n - 1)!\). Identifying reflections would halve the count to \((n - 1)! / 2\).

Last updated: