Fibinomial Identities

Arthur T. Benjamin, Jennifer J. Quinn and Jeremy A. Rouse

A chapter in Applications of Fibonacci Numbers, 2004, pp 19-24 from Springer

Abstract: Abstract Problem A — 6 from the 1990 Putnam exam states: If X is a finite set, let |X| denote the number of elements in X. Call an ordered pair (S,T) of subsets of {1, 2,... , n} admissible if s > |T| for each s ∈ S, and t > |S| for each t ∈ T. How many admissible ordered pairs of subsets of {1, 2,..., 10} are there? Prove your answer.

Keywords: 05A19; 11B39 (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-0-306-48517-6_3

Ordering information: This item can be ordered from
http://www.springer.com/9780306485176

DOI: 10.1007/978-0-306-48517-6_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().