CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

An Algorithm to Count onto Functions

by Rinku Kumar, Rakesh Kamboj, Chetan Pahwa
journal cover thumbnail

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

@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 },
issue_date = { May 2012 },
volume = { 45 },
number = { 3 },
month = { May },
year = { 2012 },
issn = { 0975-8887 },
pages = { 29-32 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume45/number3/6761-9029/ },
doi = { 10.5120/6761-9029 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:36:40.351362+05:30
%A Rinku Kumar
%A Rakesh Kamboj
%A Chetan Pahwa
%T An Algorithm to Count onto Functions
%J International Journal of Computer Applications
%@ 0975-8887
%V 45
%N 3
%P 29-32
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
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
  1. Rinku Kumar, Rakesh Kamboj, Chetan Pahwa Functions Feasibility Analysis: Based on Cardinality of Sets", volume 2, issue 3(Mar. 2012), IJARCSSE.
  2. K. Rosen, Discrete Mathematics and its Applications (6th ed), New York: McGraw-Hill, 2007.
  3. L. Gerstein, Discrete Mathematics and Algebraic Structures, New York: Freeman and Co. , 1987.
  4. C L Liu, D P Mohapatra, Elements of Discrete Mathematics, TMH, 2008.
  5. Richard Johnsonbaugh, Discrete Mathematics, Prentice Hall, 2008
  6. Ronald L. Graham, Donald E. Knuth, Oren Patashnik (1988) Concrete Mathematics, Addison–Wesley, Reading MA. ISBN 0-201-14236-8, p. 244
Index Terms

Computer Science
Information Sciences

Keywords

Function Onto Cardinality Mappings Transformations Stirling Number

Powered by PhDFocusTM