There are 5 letters and 5 envelopes and for each letter there is only one right envelope present.In how many ways can one put the letters in the envelopes so that no letter is in the right envelope? I would be really glad to get a hint about its solution.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Hi; You want the number of derangements. This link covers it all.
link
ya it is the no. of derangements
Log in to reply
I think the answer is 44.
Thanks for the reply.