Computer Science – Discrete Mathematics
Scientific paper
2009-02-06
Computer Science
Discrete Mathematics
5 pages
Scientific paper
In this paper, a class of combinatorial identities is proved. A method is
used which is based on the following rule: counting elements of a given set in
two ways and making equal the obtained results. This rule is known as "counting
in two ways". The principle of inclusion and exclusion is used for obtaining a
class of (0,1)-matrices.
Iordjev Krassimir Yankov
Kovachev Dimiter Stoichkov
No associations
LandOfFree
On finding a particular class of combinatorial identities does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On finding a particular class of combinatorial identities, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On finding a particular class of combinatorial identities will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-251571