Finding the minimal polynomial of primitive 15th root of 1

Click For Summary
The minimal polynomial of the primitive 15th root of unity, denoted as m(x), is an irreducible factor of x^15 - 1 with a degree equal to the Euler function e(15), which is 8. To find m(x), one can start by dividing x^15 - 1 by the polynomials corresponding to the lower factors, specifically x - 1, x^3 - 1, and x^5 - 1. The resulting expressions for m(3) and m(5) are derived as m(3) = (x^3 - 1)/(x - 1) and m(5) = (x^5 - 1)/(x - 1). This leads to the formulation of m(15) through the appropriate combinations of these factors. The discussion concludes with a clear understanding of how to derive the minimal polynomial for the 15th root of unity.
PsychonautQQ
Messages
781
Reaction score
10

Homework Statement


So I need the find the minimal polynomial of the primitive 15th root of unity. Let's call this minimal polynomial m(x)

Homework Equations

The Attempt at a Solution


I know that m(x) is an irreducible factor of x^15 - 1 and also that the degree of m(x) is equal to the Euler function (e), and e(15) = 8, so m(x) will have degree 8. I also know that given one of the primitive roots of unity, call it c, that c^7+c^6+c^5+c^4+c^3+c^2+c+1 = 0. Where can I go from here to find m(x) over Q? perhaps multiplying together (x-c^7)(x-c^6)(x-c^5)...(x-1) will give me it? Is there a faster way than this?

Thanks PF!
 
Physics news on Phys.org
So x^15-1 has the minimal polynomial in it and other stuff besides
since the factors 15 are 1,3,5,15 we need to divide by the stuff in x-1,x^3-1,x^5-1
if we divide by x^3-1 and x^5-1 we have divided by x-1 twice we should put an extra x-1 in so we have two
then divide by x^3-1 and x^5-1

in other words if m(n)=minimum polynomial of x^n-1
x^15-1=m(1)m(3)m(5)m(15)
x^5-1=m(1)m(5)
x^3=m(1)m(3)
x-1=m(1)
thus
m(1)=x-1
m(3)=(x^3)/(x-1)
m(5)=(x^5)/(x-1)
so express m(15) using division and multiplication of
x-1,x^3-1,x^5-1,x^15-1
 
  • Like
Likes PsychonautQQ
lurflurf said:
So x^15-1 has the minimal polynomial in it and other stuff besides
since the factors 15 are 1,3,5,15 we need to divide by the stuff in x-1,x^3-1,x^5-1
if we divide by x^3-1 and x^5-1 we have divided by x-1 twice we should put an extra x-1 in so we have two
then divide by x^3-1 and x^5-1

in other words if m(n)=minimum polynomial of x^n-1
x^15-1=m(1)m(3)m(5)m(15)
x^5-1=m(1)m(5)
x^3=m(1)m(3)
x-1=m(1)
thus
m(1)=x-1
m(3)=(x^3)/(x-1)
m(5)=(x^5)/(x-1)
so express m(15) using division and multiplication of
x-1,x^3-1,x^5-1,x^15-1

Do you mean that m(3) = x^3-1/(x-1) and m(5)= x^5-1/(x-1) ?? and what exactly do you mean by m(n)? The minimal polynomial of some integer n? Thanks btw!
 
I see what I wrote did not make sense I meant to write m(n) is the minimum polynomial of the nth root of unity ie
(-1)^(2/n)

m(3) = (x^3-1)/(x-1)=1+x+x^2
and
m(5)= (x^5-1/)(x-1)=1+x+x^2+x^3+x^4

do you see how to find m(15)?
 
  • Like
Likes PsychonautQQ
lurflurf said:
I see what I wrote did not make sense I meant to write m(n) is the minimum polynomial of the nth root of unity ie
(-1)^(2/n)

m(3) = (x^3-1)/(x-1)=1+x+x^2
and
m(5)= (x^5-1/)(x-1)=1+x+x^2+x^3+x^4

do you see how to find m(15)?
Yes, thank you!
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 18 ·
Replies
18
Views
5K
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
Replies
5
Views
2K
  • · Replies 19 ·
Replies
19
Views
2K
Replies
13
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K