How Many Ways Can a Postman Deliver 4 Wrong Letters to 4 Houses?

  • Thread starter kashan123999
  • Start date
  • Tags
    Permutation
In summary, the conversation discusses a problem in which a postman delivers 4 letters to 4 houses in a way that no house receives the correct letter. The question is how many ways can this be done. Different methods are suggested, including using the fundamental law of counting, considering alphabetical order, finding the probability of delivering to the right house, and enumerating all possibilities. The final solution is found to be !4, or 9 ways.
  • #1
kashan123999
98
0

Homework Statement



A notorious postman delivered 4 letters to four houses in such a way that no house will get the correct letter...in how many ways he delivered the letter ? Please explain it

Homework Equations



I think this is permutation question...using fundamental law of counting

The Attempt at a Solution



I don't know where to start,i think they can be delivered in 7 ways cause first letter will be delivered in 3 ways,because 1 house is correct..after that 2nd letter can be arranged in 2 ways...3rd and 4th in 1 1 way..so 3+2+1+1=7 ways...
 
Physics news on Phys.org
  • #2
Are you sure you're supposed to be adding those numbers?
 
  • #3
The first letter can be delivered to the first house in 3 ways, as you noted. However depending on what this letter is, there may or may not be 2 choices for the second house. For example, denote the four houses by A,B,C,D and their correct letters by a,b,c,d. If we have b going to house A, then we have 3 choices for the letter in B. While if we have,say, c in A, then we can only have two choices for B(a and d).
 
  • #4
Ah, I didn't notice that. Here's a slightly different way of looking at it. Let's say that he delivers the letters a,b,c,d in alphabetical order. There are 3 houses where he can leave a. If he leaves a at B, there are now 3 houses where he can leave b. But if he leaves a at C or D, there are now only 2 houses where he can leave b.
 
  • #5
There are only 24 permutations, it might be instructive to write them all out. Another approach is to consider that there are three choices for the first slot (ie 2,3,4 not one), one can go any where else (ie slot 2,3,4 not one) but where ever 1 goes determines where the other numbers go. So each choice is a choice of what slot one goes in and what goes in slot one so it is easy to see the possibilities.
 
Last edited:
  • #6
so what is the answer?
 
  • #7
kashan123999 said:
so what is the answer?

Forum rules require you to work that out for yourself. You have received several hints, and that should be sufficient.
 
  • #8
kashan123999 said:
so what is the answer?
As lurflurf said , write all the choices. It might take some time but it is a good way to understand problems like this.
 
  • #9
How about you try and find the probability that the postman does deliver to the right house? This should be basic enough. Subtract your answer from 1, and use this to compare to your answer using permutations.
 
  • #10
TimeToShine said:
How about you try and find the probability that the postman does deliver to the right house? This should be basic enough. Subtract your answer from 1, and use this to compare to your answer using permutations.

That won't work: he wants the number of permutations in which every element is in the wrong place, but your method will get him the number in which at least one (hence at least two) are in the wrong place. The OP wants to find the number if derangements, although he may not know that.
 
  • #11
!4
done!
Why didn't we do that sooner?
We can do {delivers all to wrong houses}={all}-{delivers to the right house)
delivers to the right house in this case means at least one letter.
As you point out we cannot have 3 right
so we have
{0 right}={all}-{4 right}-{2 right}-{1 right}

Summary of Methods suggested
A)
pick one slot ie 1
choose which what to put there (in 1)
chose where to put what was there before (where 1 goes)
B)
!4
done!
C)
{0 right}={all}-{4 right}-{2 right}-{1 right}
D)
Enumerate (write out or draw) all possibilities
 
Last edited:

1. What is a permutation?

A permutation is a way of arranging a set of objects or elements in a specific order. It is a type of mathematical concept where the order of the elements matters.

2. How do I calculate the number of possible permutations?

To calculate the number of permutations, you can use the formula n! / (n-r)! where n is the total number of objects and r is the number of objects being arranged. For example, if you have 5 objects and you want to arrange 3 of them, the number of permutations would be 5! / (5-3)! = 5! / 2! = 5*4*3 = 60.

3. Can repetitions occur in permutations?

It depends on the type of permutation. In a permutation with repetition, the same object can be used more than once in the arrangement. In a permutation without repetition, each object can only be used once in the arrangement.

4. How is a permutation different from a combination?

In a permutation, the order of the elements matters, while in a combination, the order does not matter. For example, in a combination, the set {1,2,3} would be considered the same as {3,2,1}, but in a permutation, these would be counted as two separate arrangements.

5. Can permutations be used in real-life situations?

Permutations are used in many real-life situations, such as arranging a set of numbers in a specific order for a lottery or creating unique passwords. They are also commonly used in statistics and probability to calculate the number of possible outcomes in a given scenario.

Similar threads

  • Precalculus Mathematics Homework Help
Replies
8
Views
427
  • Precalculus Mathematics Homework Help
Replies
23
Views
1K
  • Precalculus Mathematics Homework Help
Replies
16
Views
517
  • Precalculus Mathematics Homework Help
Replies
3
Views
3K
  • Precalculus Mathematics Homework Help
Replies
3
Views
889
  • Precalculus Mathematics Homework Help
Replies
4
Views
2K
  • Precalculus Mathematics Homework Help
Replies
10
Views
2K
  • Precalculus Mathematics Homework Help
Replies
11
Views
2K
Replies
27
Views
1K
Replies
2
Views
2K
Back
Top