Differences
This shows you the differences between two versions of the page.
Both sides previous revision Previous revision | Last revision Both sides next revision | ||
finite_geometric_series [2016/06/10 01:41] nikolaj |
finite_geometric_series [2016/06/10 01:42] nikolaj |
||
---|---|---|---|
Line 31: | Line 31: | ||
The proof of the infinitude of primes using Fermat numbers uses this. | The proof of the infinitude of primes using Fermat numbers uses this. | ||
- | In $\mathbb C$, the equation $(x/b)^n=1$ is solved by $x=b\cdot{\mathrm e}^{2\pi i\frac{k}{n}$, so | + | In $\mathbb C$, the equation $(x/b)^n=1$ is solved by $x=b\cdot{\mathrm e}^{2\pi i\frac{k}{n}}$, so |
- | $a^n-b^n=\prod_{k=1}^n (a-b\cdot{\mathrm e}^{2\pi i\frac{k}{n}})=(a-b)\prod_{k=1}^{n-1} (a-b\cdot{\mathrm e}^{2\pi i\frac{k}{n}})$ | + | $a^n-b^n = (a-b)\prod_{k=1}^{n-1} (a-b\cdot{\mathrm e}^{2\pi i\frac{k}{n}})$ |
<code> | <code> |