Math, asked by jeetdand2003, 10 months ago

find n(s) for 5 letters are to be placed into 5 envelopes such that no envelop is empty​

Answers

Answered by sikchisurajp00iq5
3

Answer:

5!=120

Step-by-step explanation:

as each envelope should contain an letter

there are 5 ways to place a letter in first envelope

similarly there are 4 ways to place a letter in second envelope

and so on

so total ways = 5!

Similar questions