Another Way of Counting Nᴺ

Authors

Arthur T. Benjamin, Harvey Mudd CollegeFollow
Fritz Juhnke, Reed College

Document Type

Article

Department

Mathematics (HMC)

Publication Date

8-1992

Abstract

An original combinatorial proof of a combinatorial identity is presented.

Comments

Previously linked to as: http://ccdl.libraries.claremont.edu/u?/irw,446.

First published in the Journal of Discrete Mathematics, vol. 5, no. 3 (August 1992) by the Society for Industrial and Applied Mathematics.

Publisher pdf, posted with permission.

Article can also be found at http://dx.doi.org/10.1137/0405028

Rights Information

© 1992 Society for Industrial and Applied Mathematics (SIAM)

Terms of Use & License Information

Terms of Use for work posted in Scholarship@Claremont.

DOI

10.1137/0405028

Recommended Citation

Benjamin, Arthur T. "Another way of counting N^N." SIAM Journal on Discrete Mathematics 5.3 (August 1992): 377-379. DOI: 10.1137/0405028