You are here

Pascal Triangles and Combinations Where Repetitions Are Allowed

by Kendell Hyde (Weber State College)

This article originally appeared in:
College Mathematics Journal
January, 1988

Subject classification(s): Discrete Mathematics | Combinatorics
Applicable Course(s): 3.2 Mainstream Calculus II

A simple and clever way to compute the entry in the pascal triangle using numbers in any row above the row to which the desired entry belongs.

A pdf copy of the article can be viewed by clicking below. Since the copy is a faithful reproduction of the actual journal pages, the article may not begin at the top of the first page.

To open this file please click here.

These pdf files are furnished by JSTOR.

Classroom Capsules would not be possible without the contribution of JSTOR.

JSTOR provides online access to pdf copies of 512 journals, including all three print journals of the Mathematical Association of America: The American Mathematical Monthly, College Mathematics Journal, and Mathematics Magazine. We are grateful for JSTOR's cooperation in providing the pdf pages that we are using for Classroom Capsules.

Capsule Course Topic(s):
Average: 3 (5 votes)

Dummy View - NOT TO BE DELETED