Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

18.S66 The Art of Counting

        

18.S66 The Art of Counting

Logo for 18.S66 The Art of Counting
The subject of enumerative combinatorics deals with counting the number of elements of a finite set. For instance, the number of ways to write a positive integer n as a sum of positive integers, taking order into account, is 2n-1. We will be concerned primarily with bijective proofs, i.e., showing that two sets have the same number of elements by exhibiting a bijection (one-to-one correspondence) between them. This is a subject which requires little mathematical background to reach the frontiers... More
Material Type: Online Course
Date Added to MERLOT: October 20, 2011
Date Modified in MERLOT: October 20, 2011
Author:
Submitter: Sorel Reisman

Details

  • Editor Review (not reviewed)
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)

About

Primary Audience:
Mobile Compatibility: Not specified at this time
Language: English
Cost Involved: no
Source Code Available: unsure
Accessiblity Information Available: unsure
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Connections



QR Code for this Page

Browse in Categories

Discussion

Discussion for 18.S66 The Art of Counting

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page