Lets put letters.

Discrete Mathematics Level pending

I have 6 different letters numbered 1 to 6. And i have 6 different envelopes numred 1 to 6 . Letter number 1 is putted in envelope 2 . Now how many ways are possible to put rest all letters in envelopes such that no envelope contains letter of same number. Extra credit : Each envelope can have maximum 1 letter

×

Problem Loading...

Note Loading...

Set Loading...