擅长:python、mysql、java
<p>指数增长的离散序列称为几何级数。这个和叫做几何级数。公式<a href="https://en.wikipedia.org/wiki/Geometric_progression#Geometric_series" rel="nofollow">here</a>可以很容易地求解,以产生您需要的序列:</p>
<pre><code>>>> n = 5
>>> r = (1 + 5 ** 0.5) / 2
>>> r
1.618033988749895
>>> total = 2.28
>>> a = total * (1 - r) / (1 - r ** n)
>>> a
0.13965250359560707
>>> sequence = [a * r ** i for i in range(n)]
>>> sequence
[0.13965250359560707, 0.22596249743170915, 0.36561500102731626, 0.5915774984590254, 0.9571924994863418]
>>> sum(sequence)
2.28
>>> sequence[1] / sequence[0]
1.618033988749895
>>> sequence[2] / sequence[1]
1.618033988749895
>>> sequence[2] / sequence[1] == r
True
</code></pre>
<p>同样值得注意的是,这个问题和Fibonacci的原始问题都可以用二进制搜索/对分方法来解决。在</p>