Article thumbnail
Location of Repository

Mathematical Case Studies: Finite Combinatorics

By Rob Arthan

Abstract

This document presents some definitions and theorems from elementary finite combinatorics. The definitions include a “fold ” operator for finite sets and the operation that sums a real-valued function on a finite indexed set. The theorems include: more facts about finiteness and the size of finite sets; algebraic properties of indexed sums; induction over finitely-supported functions; the inclusion/exclusion principle; the binomial coefficients and their basic properties, including the formula for the number of combinations and the binomial theorem.

Year: 2006
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.9962
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.lemma-one.com/Proof... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.