How many different possible ways can persons be seated in a round table?

algorithm math combinations permutation discrete-mathematics
Kiran picture Kiran · Sep 2, 2011 · Viewed 12.3k times · Source

I am developing an algorithm and am looking at a possibility of the maximum number of iterations before arriving at a conclusion.

In real world, it is similar to the Classical Round Table seating problem. Can you please tell me the maximum number of ways n persons be seated in a round table without repetitions ?

Thanks

Answer

JoeBuddha picture JoeBuddha · Sep 2, 2011

Classic permutation problem: Break it into two sections: 1) All possible combinations 2) Divide by n as the number of starting locations (since they don't matter)

I get (n-1)! possibilities. Am I missing anything here? (I don't do stats much, so I'm kinda rusty)

Related questions

counting combinations and permutations efficiently

I have some code to count permutations and combinations, and I'm trying to make it work better for large numbers. I've found a better algorithm for permutations that avoids large intermediate results, but I still think I can do better …

Read More
Creating all possible k combinations of n items in C++

There are n people numbered from 1 to n. I have to write a code which produces and print all different combinations of k people from these n. Please explain the algorithm used for that.

Read More
finding substrings of a string

For a string of length n, the formula to compute all the substrings are: n(n+1)/2 Can someone help me out in intuitively understanding this formula? Wikipedia says: "The number of substrings of a string of length where symbols only …

Read More