斐波那契部分和技巧
Fibonacci Partial Sums Tricks
AI总结：
本文研究类斐波那契数列部分和的可除性，揭示前十项和等于第7项乘以11的魔术原理，并推广到其他二阶递推，证明类Pell数列存在类似技巧而类Jacobsthal数列不存在。
摘要：
本文的核心是以下魔术技巧。当观众写出一个类斐波那契数列（遵循与斐波那契数列相同递推关系的数列）的前十项时，魔术师通过将第7项乘以11来非常快速地计算这十项的和。这一技巧基于类斐波那契数列部分和的可除性性质。我们找到了能够整除斐波那契数1到n之和的最大斐波那契数。我们讨论了该技巧对其他二阶递推数列的推广。我们证明了类似的技巧对类Pell数列存在，而对类Jacobsthal数列不存在。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
