Question

Suppose that p is prime. For a regular p-gon to be Euclidean constructible, then the roots of r- 1 must be constructible. The

0 0
Add a comment Improve this question Transcribed image text
Answer #1

\phi(p)=p-1

If a regular p-gon is (Euclidean) constructible then [\mathbb{Q}(p):\mathbb{Q}]=2^n

Thus, we must have \phi(p)=p-1=2^n so that p=2n + 1

We claim that now n but itself be a power of 2. If not we have

s|n where s is odd

Then (2^s+1)|(2^n+1) which is impossible as p=2n + 1 is prime

Thus, we must have n=2^k itself and so p=2n + 1 is of the form

p=2^{2^k}+1

Add a comment
Know the answer?
Add Answer to:
Suppose that p is prime. For a regular p-gon to be Euclidean constructible, then the roots of r- ...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT