This question asks for the number of distinct seating arrangements possible when 6 people are seated at a round table. This is a problem involving permutations, specifically circular permutations.
In a linear arrangement (like a bench), if you have 6 people, there are $6!$ (6 factorial) ways to arrange them. This is because each position is distinct.
However, at a round table, arrangements are considered the same if they can be obtained by rotating the table. For example, if we have people A, B, C, D, E, F, the arrangement ABCDEF in clockwise order is the same as BCDEFA, CDEFAB, and so on, if we just rotate everyone one seat over. Since there are 6 people, there are 6 such rotations that result in the same relative arrangement.
To account for this repetition due to rotation, we fix one person's position and arrange the remaining people relative to that fixed person. This effectively turns the circular arrangement into a linear one for the remaining people.
The formula for the number of distinct arrangements of $n$ distinct objects in a circle is:
\(P_{circular} = (n-1)!\)
In this problem:
Using the formula:
\(\text{Number of arrangements} = (6-1)!\)
$ = 5! $
Now, we calculate the factorial of 5:
\(5! = 5 \times 4 \times 3 \times 2 \times 1\)
Let's break down the calculation:
So, $5! = 120$.
There are 120 distinct seating arrangements possible for 6 people at a round table.
On a chess board, in how many different ways can 6 consecutive squares be chosen on the diagonals along a straight path ?
There are 6 persons arranged in a row. Another person has to shake hands with 3 of them so that he should not shake hands with two consecutive persons. In how many distinct possible combinations can the handshakes take place ?
In a tournament of Chess having 150 entrants, a player is eliminated whenever he loses a match. It is given that no match results in a tie/draw. How many matches are played in the entire tournament?
The letters A, B, C, D and E are arranged in such a way that there are exactly two letters between A and E. How many such arrangements are possible?
There is a numeric lock which has a 3-digit PIN. The PIN contains digits 1 to 7. There is no repetition of digits. The digits in the PIN from left to right are in decreasing order. Any two digits in the PIN differ by at least 2. How many maximum attempts does one need to find out the PIN with certainty?