Required numbers = 5! [1!1+2!1−3!1+4!1−5!1] = 44 Note that if r (0 ≤ r ≤ n) objects occupy the original places and none of the remaining (n - r) objects occupies its original places then the number of such arrangements = nCr(n−r)![1−1!1+2!1−3!1 + ... + (−1)n−2(n−r)!1] or 5 letters 5 directed envelopeAll the of letters Put wrong wrong : Number of ways ==[1−1!1+2!1−3!1+4!1−5!1]5!=[1−1+21−61+241−1201]5!=[62+1204]5!=[31+301]5!=[3011]120=44