The week's pick
Random Articles
Reseach Article
An Algorithm to Count onto Functions
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 45 - Number 3 |
| Year of Publication: 2012 |
| Authors: Rinku Kumar, Rakesh Kamboj, Chetan Pahwa |
10.5120/6761-9029
|
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
Abstract
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.
References
- Rinku Kumar, Rakesh Kamboj, Chetan Pahwa Functions Feasibility Analysis: Based on Cardinality of Sets", volume 2, issue 3(Mar. 2012), IJARCSSE.
- K. Rosen, Discrete Mathematics and its Applications (6th ed), New York: McGraw-Hill, 2007.
- L. Gerstein, Discrete Mathematics and Algebraic Structures, New York: Freeman and Co. , 1987.
- C L Liu, D P Mohapatra, Elements of Discrete Mathematics, TMH, 2008.
- Richard Johnsonbaugh, Discrete Mathematics, Prentice Hall, 2008
- Ronald L. Graham, Donald E. Knuth, Oren Patashnik (1988) Concrete Mathematics, Addison–Wesley, Reading MA. ISBN 0-201-14236-8, p. 244
Index Terms
Keywords