Set complexity of construction of a regular polygon

Publication date 15 November 2017

Abstract: Given a subset of

m a t h b b C

containing

x, y

, one can add

x + y,, x - y,, x y

or (when

y e 0

)

x / y

or any

z

such that

z^{2} = x

. Let

p

be a prime Fermat number. We prove that it is possible to obtain from

1

a set containing all the

p

-th roots of 1 by

12 p^{2}

above operations. This result is different from the standard estimation of complexity of an algorithm computing the

p

-th roots of 1.

This page was built for publication: Set complexity of construction of a regular polygon