(adsbygoogle = window.adsbygoogle || []).push({}); Nice ques to solve !!!

1. The problem statement, all variables and given/known data

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..!!

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Nice ques to solve

**Physics Forums | Science Articles, Homework Help, Discussion**