Math 2.0

statement theorem

Sum of a finite geometric progression

Statement

Let xx be a real number with x≠1x \neq 1, and let nn be a natural number. Then ∑k=0n−1xk=1+x+x2+⋯+xn−1=xn−1x−1.\sum_{k=0}^{n-1} x^k = 1 + x + x^2 + \dots + x^{n-1} = \frac{x^n - 1}{x - 1}.

Remarks

The same formula holds for xx in any field, for example for complex numbers, when x≠1x \neq 1. For x=1x = 1, the sum is nn. A short proof: (x−1)(1+x+⋯+xn−1)=xn−1(x - 1)(1 + x + \dots + x^{n-1}) = x^n - 1, because the other terms cancel.

Explanations

L1 human

In a geometric progression, you get each term from the one before by multiplying by the same number xx. For x=2x = 2, the formula gives 1+2+4+8=24−1=151 + 2 + 4 + 8 = 2^4 - 1 = 15. Multiply the sum by xx and subtract the sum: almost all terms cancel, and only xn−1x^n - 1 stays.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 2 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Mathematical induction concept
  2. Sum of a finite geometric progression statement

What depends on this

2 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Geometric_progression, Geometric series