If the total number of letters is n, then the number of ways in which r letters goes into wrong envelopes =‌nCn−rDr The number of ways in which atleast two of the letters are in wrong envelopes ‌=‌6C6−2D2+‌6C6−3D3+‌6C6−4D4 ‌+‌6C6−5D5+‌6C6−6D6‌‌[∵r=2,3,4,5,6] ‌=