Place the polygon in the complex plane counterclockwise, so that
P2−P1 is a positive real number. Let
ai=∣Pi+2−Pi+1∣, which is an integer, and define the
polynomial
f(x)=apq−1xpq−1+⋯+a1x+a0. Let
ω=epq2πi; then
Pi+1−Pi=ai−1ωi−1, so f(ω)=0.
The minimal polynomial of ω over Q[x] is the
cyclotomic polynomial
Φpq(x)=(xp−1)(xq−1)(xpq−1)(x−1), so Φpq(x) divides f(x). At the
same time, Φpq(x) is the greatest common divisor of
s(x)=xp−1xpq−1=Φq(xp) and
t(x)=xq−1xpq−1=Φp(xq), so by
Bézout's identity (for real polynomials), we can write
f(x)=s(x)u(x)+t(x)v(x), with some polynomials
u(x),v(x). These polynomials can be replaced by
u∗(x)=u(x)+w(x)x−1xp−1 and
v∗(x)=v(x)−w(x)x−1xq−1, so without loss of
generality we may assume that degu≤p−1. Since
dega=pq−1,
this forces degv≤q−1.
Let u(x)=up−1xp−1+⋯+u1x+u0 and
v(x)=vq−1xq−1+⋯+v1x+v0. Denote by
(i,j) the unique integer n∈{0,1,…,pq−1} with
n≡i(modp) and n≡j(modq). By the choice of s
and t, we have a(i,j)=ui+vj. Then
P1P2+⋯+PkPk+1=i=0∑k−1a(i,i)=i=0∑k−1(ui+vi)=k1i=0∑k−1j=0∑k−1(ui+vj)=k1i=0∑k−1j=0∑k−1a(i,j)≥(∗)k1(1+2+⋯+k2)=2k3+k
where (∗) uses the fact that the numbers (i,j) are pairwise
different.