International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 45 - Issue 3 |
Published: May 2012 |
Authors: Rinku Kumar, Rakesh Kamboj, Chetan Pahwa |
![]() |
Rinku Kumar, Rakesh Kamboj, Chetan Pahwa . An Algorithm to Count onto Functions. International Journal of Computer Applications. 45, 3 (May 2012), 29-32. DOI=10.5120/6761-9029
@article{ 10.5120/6761-9029, author = { Rinku Kumar,Rakesh Kamboj,Chetan Pahwa }, title = { An Algorithm to Count onto Functions }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 45 }, number = { 3 }, pages = { 29-32 }, doi = { 10.5120/6761-9029 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Rinku Kumar %A Rakesh Kamboj %A Chetan Pahwa %T An Algorithm to Count onto Functions%T %J International Journal of Computer Applications %V 45 %N 3 %P 29-32 %R 10.5120/6761-9029 %I Foundation of Computer Science (FCS), NY, USA
This paper proposes an algorithm to derive a general formula to count the total number of onto functions feasible from a set A with cardinality n to a set B with cardinality m. Let f:A?B is a function such that ?A?=n and ?B?=m, where A and B are finite and non-empty sets, n and m are finite integer values. To count the total number of onto functions feasible till now we have to design all of the feasible mappings in an onto manner, this paper will help in counting the same without designing all possible mappings and will provide the direct count on onto functions using the formula derived in it.