- #1
Vishalrox
- 20
- 0
Nice ques to solve !
Let set 'A' have 'n' number of elements and let set 'B' have 'm' number of elements and let their's a defined function f:A→B. Determine the number of possible 'onto' functions that are possible and valid..!..prove it by mapping of elements from 'A' to 'B'..!
2. The attempt at a solution
According to my logic there are mP1 + mP2 + mP3 +... + mPn Permutations..
is my answer correct...and i could understand that Only if m=n, we will have mPn onto functions. If n<m, none of the functions would be onto...is my statement correct for n>m...and also gimme other logic or methods..!
Homework Statement
Let set 'A' have 'n' number of elements and let set 'B' have 'm' number of elements and let their's a defined function f:A→B. Determine the number of possible 'onto' functions that are possible and valid..!..prove it by mapping of elements from 'A' to 'B'..!
2. The attempt at a solution
According to my logic there are mP1 + mP2 + mP3 +... + mPn Permutations..
is my answer correct...and i could understand that Only if m=n, we will have mPn onto functions. If n<m, none of the functions would be onto...is my statement correct for n>m...and also gimme other logic or methods..!