Card Sorting Related to Fibonacci Numbers

Clark Kimberling

A chapter in Applications of Fibonacci Numbers, 1999, pp 219-231 from Springer

Abstract: Abstract Imaging holding a deck of n cards in your hand, numbered from 1 to n but not in that order. Let $$\alpha = (1 + \sqrt{5})/2$$ and σ = (1,3,4,6,8,9,11,12,14,16,17,19,…), where $$\sigma (n) = \left \lfloor \alpha n \right \rfloor$$ for n ≥ 1. The sequence σ will be used to select and remove cards from your hand.

Keywords: 11B39 (search for similar items in EconPapers)
Date: 1999
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-94-011-4271-7_22

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

DOI: 10.1007/978-94-011-4271-7_22

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 ().