1permutations in circular are (n-1)! where n is no of persons here
There are n numbered seats around a round table.In how many ways can m(<n)persons sit around the table ?
-
UP 0 DOWN 0 0 9
9 Answers
62Hint: Seat one person first.. and fix him..
(IF you knwo the derivation for the round table, you will solve the rest easily ;)
1so is the answer n-1Pm-1........since after fixing one person, n-1 seats are left and m-1 persons are left.....is that the right ansr............
1Not into n again since the fixed person can sit on n seats? Or is that immaterial?
1Fix One Persons Seat Thus There are Now (n-1) people
thus the ways of seating them is (n-1)! Thus Giving the (n-1)! ways of Seating the People
Bue there are Now m people thus it becomes n-1Pm-1 ways of setting them
62One important thing which I also ignored..
See here, the seats are numbered.. So circular does not matter. because each seat is different.. Hence CHamp the answer given is correct..