A discrete mathematics problem by Rajdeep Bharati

Six cards and six envelopes are numbered 1, 2, 3, 4, 5, 6 and cards are to be placed in envelopes so that each envelope contains exactly one card and no card is placed in the envelope bearing the same number and moreover the card numbered 1 is always placed in envelope numbered 2.

Find the number of ways to do so.

×

Problem Loading...

Note Loading...

Set Loading...