Approximately n-secting an angle

https://doi.org/10.1016/j.ipl.2007.02.007Get rights and content

Abstract

It is a well-known fact that there exists an angle that cannot be trisected with a straightedge and a compass. In general, it is impossible to divide an arbitrary angle into n-angles equally with only a straightedge and a compass, where n is a positive integer. We give an efficient algorithm to divide an arbitrary angle into n-angles almost equally with only a straightedge and a compass. Using this method, we can construct an almost regular n-gon for arbitrary n.

References (7)

  • R. Courant et al.

    What is Mathematics?

    (1960)
  • J.B. Fraleigh

    A First Course in Abstract Algebra

    (1989)
  • S. Lang

    Algebra

    (1984)
There are more references available in the full text version of this article.

Cited by (1)

  • A note on partition sum polynomials

    2008, European Journal of Combinatorics
1

The first and second authors were supported by grant No. R01-2006-000-10047-0(2006) from the Basic Research Program of the Korea Science & Engineering Foundation.

2

The third author was supported by the second stage of BK21 project.

View full text