📚 Investigation 3: Fibonacci Sequence and Golden Ratio | 探究3：斐波那契数列与黄金比例
Mathematical investigations often begin with a simple observation that blossoms into a rich web of relationships. In this investigation, we explore the Fibonacci sequence, uncover its connection to the golden ratio, and build the skills of pattern recognition, conjecture, and proof that are central to the IB mathematical toolkit. By examining recursive rules, explicit formulas, and geometric representations, you will learn how a seemingly innocent number pattern governs everything from spiral shells to Renaissance art.
数学探究往往始于一个简单的观察，然后扩展成一张丰富的关系网。在本次探究中，我们将深入研究斐波那契数列，揭示它与黄金比例的关联，并培养模式识别、提出猜想与证明的能力——这些都是 IB 数学工具箱的核心。通过考察递推规则、显式公式和几何表示，你将了解一个看似无害的数字规律如何支配着从螺旋贝壳到文艺复兴艺术的各种事物。
1. Introducing the Fibonacci Sequence | 斐波那契数列简介
The Fibonacci sequence begins with two ones, and each subsequent term is the sum of the two preceding terms. Named after the Italian mathematician Leonardo of Pisa, known as Fibonacci, the sequence appeared in his 1202 book Liber Abaci as a model for rabbit population growth. The first dozen terms are 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144. Today it appears across number theory, computer science, and natural growth forms.
斐波那契数列从两个 1 开始，之后每一项都是前两项之和。它以意大利数学家、比萨的莱昂纳多（又名斐波那契）的名字命名，在其 1202 年的著作《计算之书》中作为兔子繁殖模型出现。前十二项为 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144。如今，它出现在数论、计算机科学和自然生长形态中。
| Index n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| Fn | 1 | 1 | 2 | 3 | 5 | 8 | 13 | 21 | 34 | 55 |
2. Observing Patterns and Making Conjectures | 观察规律并提出猜想
Look at every third Fibonacci number: 2, 8, 34, 144. Each is even. In fact, F3, F6, F9 are all even. Does this pattern continue? Checking further, F12=144 is even, F15=610 is even. It appears that Fn is even if and only if n is a multiple of 3. We formulate the conjecture: For all positive integers k, F3k is even. This early stage of investigation highlights the IB emphasis on noticing structure before seeking proof.
观察每隔三个的斐波那契数：2, 8, 34, 144。它们全是偶数。事实上，F3, F6, F9 都是偶数。这个规律会延续吗？进一步验证，F12=144 是偶数，F15=610 也是偶数。看起来 Fn 是偶数当且仅当 n 是 3 的倍数。我们提出猜想：对所有正整数 k，F3k 是偶数。这个早期探究阶段突出了 IB 所强调的：先注意结构，再寻求证明。
²+1²=2, 1²+2²=5, 2²+3²=13. The results are themselves Fibonacci numbers. More precisely, Fn² + Fn+1² = F2n+1. Testing for n=3: 2²+3²=4+9=13, and F7=13. Observing such identities deepens our appreciation of the sequence's hidden harmony.
另一个规律：将两个连续的斐波那契数平方再求和。例如 1²+1²=2, 1²+2²=5, 2²+3²=13。结果本身也是斐波那契数。更准确地说，Fn² + Fn+1² = F2n+1。检验 n=3：2²+3²=4+9=13，而 F7=13。观察这样的恒等式让我们更深刻地体会到数列隐藏的和谐性。
3. Recursive and Closed Forms | 递推形式与封闭形式
The Fibonacci sequence is defined recursively: F1=1, F2=1, and Fn = Fn-1 + Fn-2 for n ≥ 3. Sometimes the indexing starts with F0=0, F1 e sequence from the second term onward. Using this base, the recurrence holds for n ≥ 2: Fn = Fn-1 + Fn-2. Recursive definitions are compact but inefficient for computing large terms directly. We need a closed-form expression.
斐波那契数列递归定义为：F1=1, F2=1，且对于 n ≥ 3，Fn = Fn-1 + Fn-2。有时下标从 F0=0, F1=1 开始，这样从第二项起序列相同。采用这组初值，递推对 n ≥ 2 成立：Fn = Fn-1 + Fn-2。递推定义虽然紧凑，但直接计算很大的项时效率不高，我们需要一个封闭表达式。
Assuming a solution of the form Fn = rⁿ and substituting into the recurrence (with base F0=0, F1 leads to the characteristic equation r² = r + 1, or r² − r − 1 = 0. The roots are φ = (1+√5)/2 ≈ 1.618034 and ψ = (1−√5)/2 ≈ −0.618034. The general solution is Fn = Aφⁿ + Bψⁿ. Using initial conditions gives A = 1/√5, B = −1/√5. Thus we obtain Binet's formula.
假设解的形式为 Fn = rⁿ，将其代入递推关系（基值为 F0=0, F1=1），得到特征方程 r² = r + 1，即 r² − r − 1 = 0。两个根为 φ = (1+√5)/2 ≈ 1.618034 和 ψ = (1−√5)/2 ≈ −0.618034。通解为 Fn = Aφⁿ + Bψⁿ。利用初始条件得 A = 1/√5, B = −1/√5。由此我们得到比内公式。
4. Binet's Formula and Its Power | 比内公式及其威力
Binet's formula states: Fn = (φⁿ − ψⁿ)/√5. Although ψ is negative and its absolute value is less than 1, ψⁿ rapidly approaches zero as n grows. Therefore, for large n, Fn ≈ φⁿ/√5. This approximation is accurate even for moderate n: for n=10, φ¹⁰/√5 ≈ 55.0036, while F10 he formula transforms the sequence from a recursive puzzle into an exact algebraic object.
比内公式为：Fn = (φⁿ − ψⁿ)/√5。虽然 ψ 为负数且绝对值小于 1，ψⁿ 随着 n 增大而迅速趋近于零。因此对较大的 n，有 Fn ≈ φⁿ/√5。即使对中等大小的 n，这个近似也相当准确：当 n=10 时，φ¹⁰/√5 ≈ 55.0036，而 F10=55。这个公式将数列从递推谜题转化为一个精确的代数对象。
Using Binet's formula, we can prove properties that are cumbersome to show by induction alone. For example, the sum of the first n Fibonacci numbers equals Fn+2 − 1. Verifying this algebraically with the closed form involves summing geometric series, confirming the identity for all n. Such proofs exemplify the IB value of connecting different representations.
利用比内公式，我们可以证明那些仅靠归纳法难以处理的性质。例如，前 n 个斐波那契数之和等于 Fn+2 − 1。用封闭形式进行代数验证，涉及对等比数列求和，这样可确认对所有 n 的恒等式。这类证明体现了 IB 注重联结不同表示的价值取向。
5. Discovering the Golden Ratio | 发现黄金比例
= 1 + 1/φ. The equation φ² = φ + 1 arises naturally from the limit assumption L = 1 + 1/L.
观察逐项比：1/1=1，2/1=2，3/2=1.5，5/3≈1.667，8/5=1.6，13/8=1.625，21/13≈1.615，34/21≈1.619，55/34≈1.6176。这些比值似乎在向约 1.618 的常数收敛。这就是黄金比例 φ，它满足 φ = 1 + 1/φ。方程 φ² = φ + 1 正是由极限假设 L = 1 + 1/L 自然产生的。
To prove convergence formally, apply the recurrence to the ratio Rn = Fn+1/Fn. We have Rn = (Fn + Fn-1)/Fn = 1 + 1/Rn-1 tive root is φ. Showing the limit exists requires monotonic bounded argument: the even-index ratios increase toward φ, the odd-index ratios decrease toward φ, sandwiching the limit.
要正式证明收敛，可对比例 Rn = Fn+1/Fn 应用递推。我们有 Rn = (Fn + Fn-1)/Fn = 1 + 1/Rn-1。如果极限 L 存在，它必满足 L = 1 + 1/L，从而得到 L² − L − 1 = 0。正根即 φ。证明极限存在需要单调有界论证：偶数下标比值递增逼近 φ，奇数下标比值递减逼近 φ，从而夹挤出极限。
6. Golden Ratio, Geometry, and Spirals | 黄金比例、几何与螺旋线
A golden rectangle has side lengths in the ratio φ:1. Removing the largest possible square leaves a smaller rectangle with the same proportions. This self-similarity generates an infinite sequence of nested rectangles. Drawing quarter-circles inside these squares yields a logarithmic spiral, often called the golden spiral, which closely approximates the spiral observed in nautilus shells and sunflower seed heads.
黄金矩形的边长之比为 φ:1。从中切去一个尽可能大的正方形，剩下的矩形仍保持同样比例。这种自相似性产生了一个无穷嵌套矩形序列。在这些正方形内画四分之一圆弧，可以得到一条对数螺线，通常称为黄金螺线，它非常接近鹦鹉螺壳和向日葵花盘中所观察到的螺旋。
The connection to the Fibonacci sequence emerges through adjacent terms. If you build a rectangle with sides Fn and Fn+1, its aspect ratio approximates φ. As n increases, the rectangle becomes almost a golden rectangle. Many artists and architects, including Le Corbusier, have used these proportions to achieve aesthetic balance. The Modulor system is directly based on φ and human scale.
与斐波那契数列的联系通过相邻项体现出来。如果你以 Fn 和 Fn+1 为边长构造矩形，其长宽比近似 φ。随着 n 增大，该矩形几乎就是黄金矩形。许多艺术家和建筑师，包括勒·柯布西耶，都曾利用这些比例实现美学平衡。模度系统就直接基于 φ 和人体尺度。
7. Fibonacci Numbers in Nature | 自然中的斐波那契数
mbers, such as 8 and 13 or 13 and 21. This packing efficiency is related to the golden angle 360°×(1−1/φ) ≈ 137.5°.
叶片的茎周排列，即叶序，常常遵循斐波那契数以优化光照。松果鳞片和菠萝果实沿两个相反方向形成螺旋；每个方向上的螺旋数通常为连续的斐波那契数，例如 8 和 13 或 13 和 21。这种堆积效率与黄金角 360°×(1−1/φ) ≈ 137.5° 有关。
In bee populations, the ancestry of a drone bee follows the Fibonacci sequence: a drone has one parent (the queen), but two grandparents (the queen's parents), three great-grandparents, and so on. The number of ancestors in each generation matches the Fibonacci pattern. Though idealized, this model illustrates how the sequence appears in recursive genealogical structures.
在蜜蜂种群中，雄蜂的家系符合斐波那契数列：一只雄蜂有一位亲本（蜂王），但有两位祖辈（蜂王的双亲），三位曾祖辈，依此类推。每一代的祖先数均与斐波那契模式吻合。尽管是理想化模型，但它展示了数列如何在递归谱系结构中出现。
8. Proof by Induction: Even Valued Terms | 归纳法证明：偶数项
Earlier we conjectured that F3k or all positive integers k. We can prove this by mathematical induction. Base case: k=1, F3=2, which is even. Inductive step: assume F3k = 2m for some integer m. Then F3k+1 = F3k+F3k-1, and F3k+2 = F3k+1+F3k. Finally F3k+3 = F3k+2+F3k+1 = 2F3k+1+F3k. Since F3k is even and 2F3k+1 is even, the sum is even. Hence the statement holds for k+1.
之前我们猜想对所有正整数 k，F3k 为偶数。我们可以用数学归纳法证明。基始情形：k=1，F3=2，为偶数。归纳步：假设 F3k = 2m（m 为整数）。那么 F3k+1 = F3k+F3k-1，F3k+2 = F3k+1+F3k。最后 F3k+3 = F3k+2+F3k+1 = 2F3k+1+F3k。因为 F3k 是偶数且 2F3k+1 是偶数，其和也是偶数。因此命题对 k+1 成立。
Induction is a central technique in IB Mathematics: Analysis and Approaches. It allows us to transform an observed pattern into a rigorous truth. Similar induction proofs can establish divisibility properties (e.g., F5k is divisible by 5) and the identity for the sum of squares.
归纳法是 IB 数学“分析与方法”中的核心技巧，使我们能将观察到的规律转化为严谨的真理。类似的归纳证明还可确立整除性质（如 F5k 能被 5 整除）以及平方和的恒等式。
9. The Lucas Sequence and Generalisations | 卢卡斯数列及推广
Changing the initial values while keeping the same recurrence yields the Lucas numbers: Ln = Ln-1 + Ln-2 with L1=1, L2 7, 11, 18, 29. Lucas numbers share many properties with Fibonacci numbers; for instance, Ln = Fn-1 + Fn+1. The ratio of consecutive Lucas numbers also tends to φ, and they satisfy their own Binet-style formula: Ln = φⁿ + ψⁿ.
保持同样的递推关系但改变初值，就得到卢卡斯数：Ln = Ln-1 + Ln-2，其中 L1=1, L2=3。数列开头为 1, 3, 4, 7, 11, 18, 29。卢卡斯数与斐波那契数共享许多性质；例如 Ln = Fn-1 + Fn+1。相邻卢卡斯数之比也趋向 φ，并且它们有自己的比内型公式：Ln = φⁿ + ψⁿ。
This illustrates a broader principle: any sequence obeying the Fibonacci recurrence can be expressed as a linear combination of φⁿ and ψⁿ. The sequences differ only in the choice of coefficients A and B in Aφⁿ + Bψⁿ. This realisation connects the investigation to linear homogeneous recurrence relations, a topic in IB HL. It also opens the door to studying Fibonacci polynomials and matrix representations.
这揭示了一个更广泛的原理：任何满足斐波那契递推的数列都可表示为 φⁿ 与 ψⁿ 的线性组合。不同数列的区别仅在于 Aφⁿ + Bψⁿ 中系数 A 和 B 的选择。这一认识将探究与线性齐次递推关系联系起来，属于 IB HL 内容。它也开启了研究斐波那契多项式和矩阵表示的大门。
10. The Fibonacci Q-Matrix and Fast Computation | 斐波那契 Q 矩阵与快速计算
Using matrices, the Fibonacci recurrence can be written as [Fn+1, Fn; Fn, Fn-1] = [[1,1],[1,0]]ⁿ when using initial (F1,F0)=(1,0). The matrix Q = [[1,1],[1,0]] satisfies Qⁿ = [[Fn+1, Fn], [Fn, Fn-1]]. This representation enables computation of Fn in O(log n) time using exponentiation by squaring, a significant improvement over the recursive addition method.
利用矩阵，斐波那契递推可写为 [Fn+1, Fn; Fn, Fn-1] = [[1,1],[1,0]]ⁿ，当采用初值 (F1,F0)=(1,0) 时。矩阵 Q = [[1,1],[1,0]] 满足 Qⁿ = [[Fn+1, Fn], [Fn, Fn-1]]。这种表示使得我们可以用平方求幂法在 O(log n) 时间内计算 Fn，相比递归加法有显著改进。
Q is λ² − λ − 1 = 0, whose roots are φ and ψ. Diagonalising Q yields another path to Binet' athematical investigation. Students exploring computational thinking will appreciate how theory translates into efficient algorithms.
Q 的特征多项式为 λ² − λ − 1 = 0，其根为 φ 和 ψ。将 Q 对角化可以得到通往比内公式的另一途径。这种矩阵观点将线性代数、递推关系和数论统一起来，展示了数学探究的跨学科性质。探索计算思维的学生将体会到理论如何转化为高效算法。
11. Further Investigations and Open Questions | 延伸探究与开放问题
Having established core properties, an inquisitive student might ask: which Fibonacci numbers are prime? F3=2, F4=3, F5=5, F7=13, F11=89, F13=233 are prime, and it is known that if Fn s prime then n must be prime (with the exception n=4). The converse is false: n=19 gives F19=4181=37×113. Studying Fibonacci primes leads to deep unsolved problems in number theory.
在掌握了核心性质之后，好奇的学生可能会问：哪些斐波那契数是质数？F3=2, F4=3, F5=5, F7=13, F11=89, F13=233 都是质数，而且已知若 Fn 为质数，则 n 必为质数（n=4 例外）。其逆命题不成立：n=19 给出 F19=4181=37×113。研究斐波那契质数引向数论中深刻的未解问题。
Another rich area is the Fibonacci sequence modulo m. The sequence of remainders is periodic (the Pisano period), and finding the length of this period for a given m connects to group theory and cryptography. For instance, modulo 10 the period is 60; modulo 3 it is 8. These patterns are accessible for investigation with simple spreadsheets or Python scripts, embodying the IB spirit of inquiry.
另一个丰富的领域是模 m 下的斐波那契数列。余数序列是周期性的（皮萨诺周期），求给定 m 下的周期长度与群论和密码学有关。例如，模 10 的周期是 60；模 3 的周期是 8。这些规律可以用简单的电子表格或 Python 脚本进行探究，体现了 IB 的探究精神。
12. Reflecting on the Investigation | 对探究的反思
This investigation began with a deceptively simple number pattern and unfolded into a network of algebra, geometry, calculus, and computing. Along the way we practised the IB inquiry cycle: observe and classify, conjecture, test, prove, and extend. The Fibonacci sequence exemplifies how mathematical curiosity, when pursued systematically, reveals hidden unity across diverse phenomena.
这次探究从一个看似简单的数字模式开始，逐渐展开为一个涵盖代数、几何、微积分和计算的网络。一路走来，我们实践了 IB 的探究循环：观察归类、提出猜想、检验、证明和推广。斐波那契数列示范了当以系统性的方式追随数学好奇心时，如何在不同的现象中揭示出隐藏的统一性。
When writing your own investigation report, remember to present clear notation, justify each step, and connect back to the original question. Use diagrams to illustrate geometric links and tables to organise numerical evidence. Above all, let genuine curiosity guide the choice of avenues to explore. The golden thread through this work is the joy of discovering that a single recursive rule can echo from the spirals of a sunflower to the elegance of algebraic identities.
在撰写你自己的探究报告时，记得给出清晰的符号说明，为每一步提供理由，并回扣原始问题。用图示阐明几何联系，用表格组织数值证据。最重要的是，让真正的好奇心指引你选择探索的路径。贯穿这项工作的黄金线索是那种发现的喜悦——一条简单的递归规则竟能从向日葵的螺旋回荡到代数恒等式的优雅之中。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图