Exercise 10.3.18

A Pierpont prime is a prime p > 3 of the form p = 2 k 3 l + 1 . Prove that a regular n -gon can be constructed by origami (or by marked ruler or by intersections of conics) if and only if n = 2 a 3 b p 1 p s where a , b 0 and p 1 , , p s are distinct Pierpont primes.

Answers

Proof. A regular n -gon can be constructed by origami if and only if ζ n = e 2 πi n is an origami number (see Exercise 10.1.2, where the figures constructible by straightedge and compass are a fortiori constructible by origami).

The splitting field of ζ n over is ( ζ n ) . By Theorem 10.3.6, ζ n is an origami number if and only if [ ( ζ n ) : ] = 2 a 3 b for some integers a , b 0 , and the minimal polynomial of ζ n over is Φ n ( x ) , so [ ( ζ n ) : ] = deg ( Φ n ) = ϕ ( n ) , so

ζ n O ϕ ( n ) = 2 a 3 b , a , b .

First suppose that n = 2 u 3 v p 1 p s , u , v 0 , where p 1 , , p s are distinct Pierpont numbers.

Write p k = 2 u k 3 v k + 1 , u k , v k , for k = 1 , , s . As 2 u , 3 v , p 1 , , p s are relatively prime, if u 1 , v 1

ϕ ( n ) = ϕ ( 2 u ) ϕ ( 3 v ) ϕ ( p 1 ) ϕ ( p s ) = ( 2 u 2 u 1 ) ( 3 v 3 v 1 ) ( p 1 1 ) ( p s 1 ) = 2 u 1 ( 2 × 3 v 1 ) ( 2 u 1 3 v 1 ) ( 2 u s 3 v s ) = 2 a 3 b , a , b .

If u = 0 , ϕ ( 2 u ) = 1 , and if v = 0 , ϕ ( 3 v ) = 1 . In all cases,

ϕ ( n ) = 2 a 3 b , a , b .

Conversely, suppose that ϕ ( n ) = 2 a 3 b , a , b 0 , and let the factorization of n be n = q 1 a 1 q s a s , where q 1 , , q s are distinct primes and the exponents a 1 , , a s are all 1 . Then ϕ ( n ) = 2 a 3 b = q 1 a 1 1 ( q 1 1 ) q s a s 1 ( q s 1 ) .

If a i > 1 , then q i 2 a 3 b , so q i = 2 , or q i = 3 , and q i a i is a power of 2 or 3 .

If a i = 1 , then q i 1 2 a 3 b , therefore q i 1 = 2 u i 3 v i , and so q i is a Piermont prime number, and q i a i = q i = 2 u i 3 v i + 1 .

So n = 2 a 3 b p 1 p s where a , b 0 and p 1 , , p s are distinct Pierpont primes.

Conclusion: a regular n -gon can be constructed by origami if and only if n = 2 a 3 b p 1 p s where a , b 0 and p 1 , , p s are distinct Pierpont primes.

User profile picture
2022-07-19 00:00
Comments