Fibonacci Partial Sums Tricks
| Autor: | Byrapuram, Nikhil, Ge, Adam, Ge, Selena, Khovanova, Tanya, Lee, Sylvia Zia, Mandal, Rajarshi, Redwine, Gordon, Samanta, Soham, Wu, Daniel, Xu, Danyang, Zhao, Ray |
|---|---|
| Rok vydání: | 2024 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | The following magic trick is at the center of this paper. While the audience writes the first ten terms of a Fibonacci-like sequence (the sequence following the same recursion as the Fibonacci sequence), the magician calculates the sum of these ten terms very fast by multiplying the 7th term by 11. This trick is based on the divisibility properties of partial sums of Fibonacci-like sequences. We find the maximum Fibonacci number that divides the sum of the Fibonacci numbers 1 through $n$. We discuss the generalization of the trick for other second-order recurrences. We show that a similar trick exists for Pell-like sequences and does not exist for Jacobhstal-like sequences. Comment: 26 pages, 9 tables |
| Databáze: | arXiv |
| Externí odkaz: |
|