Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1981 USAMO Problems/Problem 1"
m (→‎Solution)
 
(3 intermediate revisions by 3 users not shown)
Line 3: Line 3:
  
 
== Solution ==
 
== Solution ==
−
{{solution}}
+
Let <math>n=3k+1</math>.  Multiply throughout by <math>\pi/3n</math>. We get
 +
 
 +
<math>\frac{\pi}{3} = \frac{\pi \times k}{n} + \frac{\pi}{3n}</math>
 +
 
 +
Re-arranging, we get
 +
 
 +
<math>\frac{\pi}{3} - \frac{\pi \times k}{n} = \frac{\pi}{3n}</math>
 +
 
 +
A way to interpret it is that if we know the value <math>k</math>, then the remainder angle of subtracting <math>k</math> times the given angle from <math>\frac{\pi}{3}</math> gives us <math>\frac{\pi}{3n}</math>, the desired trisected angle.
 +
 
 +
This can be extended to the case when <math>n=3k+2</math> where now, the equation becomes
 +
<math>\frac{\pi}{3} - \frac{\pi \times k}{n} = \frac{2\pi}{3n}</math>
 +
 
 +
Hence in this case, we will have to subtract <math>k</math> times the original angle from <math>\frac{\pi}{3}</math> to get twice the the trisected angle. We can bisect it after that to get the trisected angle.
 +
 
 +
==Generalization==
 +
If regular polygons of <math>m</math> sides and <math>n</math> sides can be constructed, where <math>m</math> and <math>n</math> are relatively prime integers greater than or equal to three, then regular polygons of <math>mn</math> sides can be constructed. Indeed, such a polygon can be constructed by first constructing an <math>m</math>-gon, and then creating <math>m</math> distinct <math>n</math>-gons with at least one vertex being a vertex of the <math>m</math>-gon.
  
 
== See Also ==
 
== See Also ==
Line 10: Line 26:
  
 
[[Category:Olympiad Geometry Problems]]
 
[[Category:Olympiad Geometry Problems]]
 +
[[Category:Geometric Construction Problems]]

Latest revision as of 16:31, 8 July 2019

Problem

Prove that if $n$ is not a multiple of $3$, then the angle $\frac{\pi}{n}$ can be trisected with ruler and compasses.

Solution

Let $n=3k+1$. Multiply throughout by $\pi/3n$. We get

$\frac{\pi}{3} = \frac{\pi \times k}{n} + \frac{\pi}{3n}$

Re-arranging, we get

$\frac{\pi}{3} - \frac{\pi \times k}{n} = \frac{\pi}{3n}$

A way to interpret it is that if we know the value $k$, then the remainder angle of subtracting $k$ times the given angle from $\frac{\pi}{3}$ gives us $\frac{\pi}{3n}$, the desired trisected angle.

This can be extended to the case when $n=3k+2$ where now, the equation becomes $\frac{\pi}{3} - \frac{\pi \times k}{n} = \frac{2\pi}{3n}$

Hence in this case, we will have to subtract $k$ times the original angle from $\frac{\pi}{3}$ to get twice the the trisected angle. We can bisect it after that to get the trisected angle.

Generalization

If regular polygons of $m$ sides and $n$ sides can be constructed, where $m$ and $n$ are relatively prime integers greater than or equal to three, then regular polygons of $mn$ sides can be constructed. Indeed, such a polygon can be constructed by first constructing an $m$-gon, and then creating $m$ distinct $n$-gons with at least one vertex being a vertex of the $m$-gon.

See Also

1981 USAMO (Problems • Resources)
Preceded by
First Question 		Followed by
Problem 2
1 • 2 • 3 • 4 • 5
All USAMO Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1981_USAMO_Problems/Problem_1&oldid=107507"