Skip to content
Omnikalc

Circular permutations calculator: count the ways to seat guests around a round table

Enter the number of people or objects to get the number of circular arrangements, bracelet arrangements, partial seatings and arrangements with two people together or apart.

Updated on
Your inputs

Value out of range

Value out of range

Results

Circular arrangements of all of them (rotations are the same)

5,040

Bracelet arrangements (flips are also the same)
2,520
Ways to seat r of the n around the table
1,344
Arrangements with two chosen people side by side
1,440
Arrangements with two chosen people not side by side
3,600
Arrangements in a line, for comparison
40,320

A circular permutation counts the ways to arrange people or objects around a circle when turning the whole circle gives the same arrangement. The circular permutations calculator gives the circular arrangements, the bracelet arrangements, the partial seatings, the arrangements with two people together or apart and the line arrangements for comparison.

How the calculation works

  • Enter the number of distinct people or objects n that you want to place around a circle, such as guests at a round table.
  • Enter r, the number of them that you choose to sit, if you only seat part of the group.
  • The calculator gives the circular arrangements (n − 1)!, because turning the whole table does not make a new arrangement.
  • It also gives the bracelet arrangements (n − 1)! / 2, the partial arrangements nPr / r, the arrangements where two chosen people sit together or do not sit together, and the number of line arrangements n! for comparison.

Example

Take 8 guests at a round table. Seating them in a line gives 8! = 40,320 orders. At a round table, turning everyone one seat gives the same arrangement, so the count is divided by 8: (8 − 1)! = 5,040. If the table can be flipped, as for a necklace of 8 different beads, the count is 2,520. If you choose 5 of the 8 to sit, there are 8P5 / 5 = 1,344 ways. If two chosen guests must sit together there are 2 × 6! = 1,440 ways, so 3,600 arrangements keep them apart.

Why it matters

The calculator helps students of combinatorics, teachers, event planners and puzzle makers to count seating plans, necklace patterns and tournament tables without listing them. It shows how much a round table reduces the count compared with a line, and how a single constraint changes it.

Good to know

The formulas assume that all people or objects are different. If some are identical, the count is smaller and needs a different formula. Check if the seats are marked: if the seats are numbered, the table has no rotation symmetry and you must use n!. For large groups the numbers grow very fast, which is why the calculator limits n to 15.

The permutations calculator counts ordered selections in a line, the combinations calculator counts unordered selections, the factorial calculator computes n!, and the multiset permutations calculator handles arrangements with repeated items.

Frequently asked questions

What is a circular permutation?

A circular permutation is an arrangement of objects around a circle, where only the order relative to the others matters. Turning the whole circle gives the same arrangement. For n distinct objects, fix one of them as a reference and arrange the other n − 1 in any order, which gives (n − 1)! arrangements.

Why divide by 2 for a bracelet?

A necklace or a bracelet can be flipped over, and a flipped arrangement reads in the opposite direction. If a clockwise order and its mirror image count as the same, each arrangement is counted twice, so the number is divided by 2. This works for n of 3 or more, since two objects have only one arrangement.

How do I count arrangements with two people together?

Treat the two people as one block. You then have n − 1 units around the table, which gives (n − 2)! circular arrangements, and the two people can swap places inside the block, so multiply by 2. The result is 2 × (n − 2)!. Subtract it from (n − 1)! to count the arrangements where they are not together.

How do I seat only some of the people?

Choose and order r of the n people in a line, which is nPr, and then divide by r, because the r rotations of the same group are one arrangement. The result is nPr / r. For r = n, it becomes n! / n = (n − 1)!, the full circular count.

Was this calculator helpful?

Thanks for your feedback!

Results are estimates provided for information purposes. They do not replace professional advice.