Re: There are 3 doors to a lecture room. In how many ways can a
[#permalink]
10 May 2019, 02:55
Here, order is important. Suppose A, B, and C are the three doors.
The lecturer can enter and exit through the same door, repetition is allowed.
Doors are different. They are not indistinguishable, so no indistinguishable objects. Hence, we have a permutation problem, with repetition allowed and no indistinguishable objects.
The lecturer can enter the room in 3 ways and exit in 3 ways. So, in total, the lecturer can enter and leave the room in 9 (= 3 * 3) ways. The answer is (D). This problem allows repetition: the lecturer can enter by a door and exit by the same door.
Hope this helps.
Regards