M&m Sequences
Consider a sequence recursively formed as follows: Start with three real numbers, and then when k are known, let the (k +1)st be such that the mean of all k +1 equals the median of the first k. The authors conjecture that every such sequence eventually becomes stable. This article presents results r...
Gespeichert in:
Veröffentlicht in: | The College mathematics journal 2005-05, Vol.36 (3), p.191-198 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Consider a sequence recursively formed as follows: Start with three real numbers, and then when k are known, let the (k +1)st be such that the mean of all k +1 equals the median of the first k. The authors conjecture that every such sequence eventually becomes stable. This article presents results related to their conjecture. |
---|---|
ISSN: | 0746-8342 1931-1346 |
DOI: | 10.1080/07468342.2005.11922127 |