Combinatorics

From Wikiversity

Jump to: navigation, search
Crystal Clear app kaddressbook.png
Please help develop this page

This page was created, but so far, little content has been added. Everyone is invited to help expand and create educational content for Wikiversity. If you need help learning how to add content, see the editing tutorial and the MediaWiki syntax reference.

To help you get started with content, we have automatically added references below to other Wikimedia Foundation projects. This will help you find materials such as information, media and quotations on which to base the development of "Combinatorics" as an educational resource. However, please do not simply copy-and-paste large chunks from other projects. You can also use the links in the blue box to help you classify this page by subject, educational level and resource type.

Wikipedia-logo.png Run a search on Combinatorics at Wikipedia.
Commons-logo.svg Search Wikimedia Commons for images, sounds and other media related to: Combinatorics
Wikimedia-logo.svg Search for Combinatorics on the following projects:
Smiley green alien whatface.svg Lost on Wikiversity? Please help by choosing project boxes to classify this resource by:


[edit] Pigeonhole Principle

The principle can be summarized with the following memorable sentence:

If N pigeons roost in M holes and M < N, then at least two pigeons roost in the same hole.

[edit] Memoization

External Definition