De arrangements:
If n things are arranged in a row, the number of ways in which they can be de arranged so that no one occupies its original place is
n!(1-(1/(1!))+(1/(2!))-(1/(3!))+....+(-1)n(1/(n!)))
Eg
A person writes letters to 6 friends and addresses the corresponding envelopes.The no. of ways in which all the letters are in wrong envelopes is
=6!(1-(1/(1!))+(1/(2!))-(1/(3!))+(1/(4!))-(1/(5!))+(1/(6!))
=265 ways
The no. of one-one functions that can be defined from a finite set A into a finite set B is n(B)Pn(A) if n(B)>=n(A) and zero otherwise.
Eg:1)no. of 1-1 from {1,2,3} into {p,q} is zero
2)no. of 1-1 from {p,q} into {{1,2,3} is 3P2=6
The no. of onto functions from A to B is equal to the number of ways of dividing n(A) things into n(B) groups so that no group is empty if n(A)>=n(B) and is zero otherwise.
Eg:The no. onto functions from {1,2,3} onto {p,q} is
(3!/(1!*2!))+(3!/(2!*1!))=3+3=6
In your question
no. of 1-1 is 4P3=24 and no. of onto is zero because n(A)<n(B)
If you have any doubt do ask!!!!
If you want experts to help then you must post the message in Ask Expert Panel.
Cheers!!!
