# <span lang="EN-US

Total number of ways in which the letters can be put = 3! = 6

Suppose, out of the three letters, one has been put in the correct envelope.

This can be done in 3C1 ways. (3 ways)

Now, out of three, if two letters have been put in the current envelope, then the last one has been put in

the correct envelope as well. This can be done in 3C3 ways. (1 way)

Number of ways = 3 + 1 = 4

Number of ways in which no letter is put in correct envelope = 6 – 4 = 2

Rate this question :

How useful is this solution?
We strive to provide quality solutions. Please rate us to serve you better.
Try our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts
Dedicated counsellor for each student
24X7 Doubt Resolution
Daily Report Card
Detailed Performance Evaluation
view all courses
RELATED QUESTIONS :

There are 1RD Sharma - Mathematics

How many diRD Sharma - Mathematics

A committeeRD Sharma - Mathematics

How many woRD Sharma - Mathematics

A paralleloRD Sharma - Mathematics

How many woRD Sharma - Mathematics

In an examiRD Sharma - Mathematics

Out of 18 pRD Sharma - Mathematics

A committeeRD Sharma - Mathematics

How many woRD Sharma - Mathematics