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.
Related tools
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.