📚 Exploring Fibonacci Sequences and the Golden Ratio | 斐波那契数列与黄金比例的探究
This investigation guides you through one of the most famous number patterns in mathematics – the Fibonacci sequence – and its deep connection to the golden ratio. You will learn how to generate the sequence, observe the ratio of consecutive terms, derive the golden ratio algebraically, and use Binet's formula to express Fibonacci numbers explicitly. Along the way, we also look at Lucas sequences, generalised recurrences, and real-world applications, all of which can form the core of a strong IB Mathematics Internal Assessment.
本探究将带你走进数学中最著名的数列之一——斐波那契数列，并揭示它与黄金比例之间的深刻联系。你将学习如何生成数列、观察连续两项的比值变化、从代数角度推导黄金比例，并运用比内公式显式表达斐波那契数。与此同时，我们还会探讨卢卡斯数列、广义递推关系以及现实世界中的应用，这些都可以成为 IB 数学内部评估的核心内容。
1. Introduction to Fibonacci Sequences | 斐波那契数列简介
The Fibonacci sequence is named after Leonardo of Pisa, known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book Liber Abaci irs at the start of each month forms the sequence 1, 1, 2, 3, 5, 8, 13, ... . Today the sequence is usually defined with F₁ = 1, F₂ = 1, and Fₙ = Fₙ₋₁ + Fₙ₋₂ for n > 2. (Some textbooks use F₀ = 0, F₁ = 1; you should choose one convention and apply it consistently.)
斐波那契数列以比萨的列奥纳多（Fibonacci）命名，他曾在 1202 年的著作《计算之书》中向西方数学界引入了这个数列。引出该数列的问题是关于兔子在理想化条件下的繁殖：从一对兔子开始，每对兔子从第二个月起每月生一对，且永远不死。每个月初的兔子对数构成数列 1, 1, 2, 3, 5, 8, 13, …。如今通常定义为 F₁ = 1, F₂ = 1, 且当 n > 2 时 Fₙ = Fₙ₋₁ + Fₙ₋₂。（有些教材使用 F₀ = 0, F₁ = 1；你需选定一种定义并始终如一使用。）
2. The Recursive Definition | 递推定义
A recursive definition gives the first two terms explicitly and then defines each subsequent term as the sum of the two preceding terms. For the Fibonacci numbers, we write:
递推定义明确给出数列的前两项，然后将每一项定义为前两项之和。对于斐波那契数，我们可写为：
F₁ = 1, F₂ = 1, and Fₙ = Fₙ₋₁ + Fₙ₋₂ for n ≥ 3
This means that to find the 10th Fibonacci number, you need the 9th and the 8th, which in turn depend on earlier terms. Recursive definitions are fundamental in computer science and mathematical induction. The simplicity of the rule belies the rich structure of the resulting sequence.
这意味着要找到第 10 个斐波那契数，就需要第 9 个和第 8 个，而它们又依赖于更早的项。递推定义是计算机科学和数学归纳法的基础。这条简单规则背后隐藏着数列的丰富结构。
3. Generating Terms | 生成数列项
Using the recurrence, the first fifteen Fibonacci numbers (starting with F₁ = 1) are:
利用递推关系，前十五个斐波那契数（从 F₁ = 1 开始）为：
| n | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| Fₙ | 1 | 1 | 2 | 3 | 5 | 8 | 13 | 21 | 34 | 55 | 89 | 144 | 233 | 377 | 610 |
Notice how rapidly the numbers grow; by the 50th term the value exceeds 12 billion. As the terms increase, the ratio of consecutive terms appears to settle around 1.618..., a number you will soon meet as the golden ratio.
注意这些数字增长得有多快；到第 50 项时数值已超过 120 亿。随着项数增加，连续两项的比值似乎稳定在约 1.618...，这正是你即将接触到的黄金比例。
4. The Golden Ratio φ | 黄金比例 φ
is the positive number satisfying φ² = φ + 1. Rearranging gives the quadratic equation φ² – φ – 1 = 0, whose solutions are:
黄金比例用希腊字母 φ 表示，是一个满足 φ² = φ + 1 的正数。整理后得二次方程 φ² – φ – 1 = 0，其解为：
φ = (1 + √5) / 2 ≈ 1.6180339887
The other root is ψ = (1 – √5) / 2 ≈ – to the longer part equals the ratio of the longer part to the shorter: (a+b)/a = a/b = φ.
另一个根为 ψ = (1 – √5) / 2 ≈ –0.618，它也出现在斐波那契数的显式表达式中。从几何上看，如果一条线段被分成两部分，使得整体与较长部分之比等于较长部分与较短部分之比，即 (a+b)/a = a/b = φ，则产生了黄金分割。
5. Limit of Ratio of Consecutive Terms | 连续项之比的极限
/21 ≈ 1.619, 55/34 ≈ 1.6176. The values oscillate around φ, getting closer with each step.
斐波那契数列最迷人的性质之一是，随着 n 增大，比值 Fₙ₊₁ / Fₙ 趋近于 φ。计算最初几个比值：1/1 = 1，2/1 = 2，3/2 = 1.5，5/3 ≈ 1.666...，8/5 = 1.6，13/8 = 1.625，21/13 ≈ 1.615，34/21 ≈ 1.619，55/34 ≈ 1.6176。这些数值在 φ 附近振荡，每一步都更加逼近。
₁ / Fₙ = 1 + Fₙ₋₁ / Fₙ = 1 + 1 / (Fₙ / Fₙ₋₁). In the limit, this yields L = 1 + 1/L, so L² – L – 1 = 0, hence L = φ (the positive root).
要正式证明这个极限，可设 lim (Fₙ₊₁ / Fₙ) = L。利用递推 Fₙ₊₁ = Fₙ + Fₙ₋₁，除以 Fₙ 得 Fₙ₊₁ / Fₙ = 1 + Fₙ₋₁ / Fₙ = 1 + 1 / (Fₙ / Fₙ₋₁)。取极限后得到 L = 1 + 1/L，于是 L² – L – 1 = 0，故 L = φ（取正根）。
6. Binet's Formula | 比内公式
Although Fibonacci numbers are defined recursively, there is an explicit formula named after Jacques Philippe Marie Binet. It expresses Fₙ directly in terms of φ and ψ:
尽管斐波那契数是通过递推定义的，但存在一个以雅克·菲利普·马里·比内命名的显式公式，它直接用 φ 和 ψ 表达 Fₙ：
Fₙ = (φⁿ – ψⁿ) / √5
Since |ψ| < 1, ψⁿ becomes negligible for large n, so Fₙ ≈ φⁿ / √5. This approximation explains why the ratio Fₙ₊₁ / Fₙ tends to φ. Binet' n or by solving the linear homogeneous recurrence with characteristic equation r² = r + 1.
由于 |ψ| < 1，当 n 很大时 ψⁿ 可以忽略不计，因此 Fₙ ≈ φⁿ / √5。这个近似解释了为什么比值 Fₙ₊₁ / Fₙ 趋于 φ。比内公式可通过归纳法证明，也可通过解特征方程 r² = r + 1 的线性齐次递推关系得到。
7. Fibonacci in Nature and Art | 自然与艺术中的斐波那契
Fibonacci numbers appear surprisingly often in nature: the number of petals on many flowers is a Fibonacci number (lilies have 3, buttercups 5, chicory 21); the arrangement of leaves around a stem often follows fractions linked to the golden ratio, leading to optimal sunlight exposure. The spirals on pinecones, pineapples, and sunflower heads typically count two consecutive Fibonacci numbers.
斐波那契数令人惊奇地频繁出现在自然界中：许多花卉的花瓣数都是斐波那契数（百合 3 瓣、金凤花 5 瓣、菊苣 21 瓣）；茎上叶片的排列方式常与黄金比例相关的分数对应，以达到最佳的阳光照射。松果、菠萝和向日葵花盘上的螺旋线通常呈两个连续的斐波那契数分布。
In art and architecture, the golden ratio has been employed for its aesthetically pleasing proportions. The Parthenon, the Pyramids, and works by Leonardo da Vinci are often claimed to exhibit φ, though some attributions are debated. Still, the ratio provides a useful tool for creating balanced compositions.
在艺术和建筑中，黄金比例因其审美上令人愉悦的比例而被广泛采用。帕特农神庙、金字塔以及达·芬奇的作品常被认为体现了 φ，尽管有些说法仍有争议。不过，这一比例依然是创造平衡构图的有用工具。
8. Lucas Sequences and Their Properties | 卢卡斯数列及其性质
metimes L₀ = 2, L₁ = 1). The first few Lucas numbers are 1, 3, 4, 7, 11, 18, 29, 47, ... .
与之紧密相关的数列是卢卡斯数列，以爱德华·卢卡斯命名。它遵循相同的递推关系 Lₙ = Lₙ₋₁ + Lₙ₋₂，但初始项不同：L₁ = 1, L₂ = 3（有时也定义为 L₀ = 2, L₁ = 1）。前几个卢卡斯数分别是 1, 3, 4, 7, 11, 18, 29, 47, …。
a Binet-like formula holds: Lₙ = φⁿ + ψⁿ. Notice that while ψⁿ is subtracted in Fibonacci' ll difference causes Lucas numbers to be related to Fibonacci numbers by Lₙ = Fₙ₋₁ + Fₙ₊₁.
比值 Lₙ₊₁ / Lₙ 的极限同样是 φ，且存在类似于比内公式的表达式：Lₙ = φⁿ + ψⁿ。注意，斐波那契公式中减去 ψⁿ，而这里则加上。这一细微差别使得卢卡斯数与斐波那契数之间满足关系 Lₙ = Fₙ₋₁ + Fₙ₊₁。
9. Comparing Fibonacci and Lucas Ratios | 比较比率
or both sequences on the same graph shows an interesting pair of sequences that squeeze φ. This convergent behaviour can be modelled using a spreadsheet or a graphing tool for your IA.
虽然两个数列连续项之比的极限相同，但卢卡斯数列的比值从上方向 φ 逼近，而斐波那契数列的比值经过最初几次振荡后则从下方向 φ 逼近。将两个数列的 rₙ = aₙ₊₁ / aₙ 绘制在同一张图上，可看到两条曲线从两侧“夹逼” φ。这一收敛行为可以在你的内部评估中用电子表格或绘图工具进行建模。
10. Generalised Fibonacci Sequences | 广义斐波那契数列
ce has the property that the limit of successive ratios is still φ, provided the two starting values are not both zero. Such sequences are called generalised Fibonacci sequences or Gibonacci sequences. For instance, starting with 2 and 1 gives 2, 1, 3, 4, 7, 11, ... – riance of the limiting ratio demonstrates that φ is an attractor for all such recurrences.
如果我们以任意两个整数 a 和 b 开始，并应用斐波那契递推 xₙ = xₙ₋₁ + xₙ₋₂，只要起始两项不同时为零，所得数列的连续项比值的极限仍然是 φ。这类数列称为广义斐波那契数列或 Gibonacci 数列。例如，从 2 和 1 开始得到 2, 1, 3, 4, 7, 11, …，这相当于一个平移的卢卡斯数列。极限比值的这种不变性表明，φ 是所有此类递推关系的一个吸引子。
11. Applications in Mathematics | 数学中的应用
r numbers of a given size, making it the worst-case input. Additionally, the generating function ∑ Fₙ xⁿ = x / (1 – x – x²) provides a powerful tool for combinatorial identities.
除了自然界，斐波那契数还出现在计算机算法（斐波那契搜索）、金融市场分析（斐波那契回调）及数论中。斐波那契数列与欧几里得算法有关：计算 gcd(Fₙ₊₁, Fₙ) 所需步数是给定大小下的最大值，因此构成了最坏情况输入。此外，其生成函数 ∑ Fₙ xⁿ = x / (1 – x – x²) 为组合恒等式提供了有力工具。
s Fibonacci numbers to linear algebra and can be used to derive properties of φ efficiently.
在矩阵中，恒等式 [[1,1],[1,0]]ⁿ = [[Fₙ₊₁, Fₙ],[Fₙ, Fₙ₋₁]] 将斐波那契数与线性代数联系起来，可用于高效推导 φ 的性质。
12. Conclusion and IA Exploration Ideas | 结论与内部评估探索思路
The Fibonacci sequence offers a rich landscape for a mathematical investigation. You can explore the derivation of Binet's formula, model natural phenomena, investigate the convergence rates of different generalised sequences, or study the connection with the golden rectangle and the golden spiral. A well-structured IA would include generating the sequence, graphing ratios, proving the limit, discussing implications, and critically evaluating the models. Remember to personalise your exploration by choosing an aspect that genuinely interests you, and use clear mathematical notation throughout.
斐波那契数列为数学探究提供了广阔的空间。你可以推导比内公式、模拟自然现象、研究不同广义数列的收敛速度，或者探索其与黄金矩形和黄金螺线的联系。一份结构良好的内部评估应包含数列的生成、比值图像、极限证明、意义讨论以及模型的关键性评估。别忘了选择你真正感兴趣的切入点来个性化你的探究，并全程使用清晰的数学符号。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图