Processing math: 100%

Finite geometric series

Function

context nN
definition Qn:CC
definition Qn(z):=nk=0zk

todo: In fact

nk=0akbnk=1ab(an+1bn+1)

so

nk=0zk=11z(1zn+1)

i.e.

11z=11zznnk=0zk

i.e.

zn+11=(z1)nk=0zk

Remarks

The last line can be used to show that a bunch of ugly expressions have a factor. You may extend it to

(zn+1(a+1))+a=(z1)nk=0zk

etc.

The proof of the infinitude of primes using Fermat numbers uses this.

In C, the equation (xb)n=1 is solved by x=be2πikn, so

anbn=(ab)n1k=1(abe2πikn)

n = 6;
Product[a - b*Exp[2 \[Pi] I*k/n], {k, 1, n}] // FullSimplify

References

Requirements

Link to graph
Log In
Improvements of the human condition