Prove (or disprove): Define Tn(x) as the Chebyshev polynomial of the first kind with degree n. If p is an odd prime, then x−1Tp(x)−1 is an irreducible polynomials over the rational numbers.
By definition Tn(x)=cos(ncos−1(x)). Listing out the first few odd primes of n shows that (for simplicity sake, we take the positive root only)
This discussion board is a place to discuss our Daily Challenges and the math and science
related to those challenges. Explanations are more than just a solution — they should
explain the steps and thinking strategies that you used to obtain the solution. Comments
should further the discussion of math and science.
When posting on Brilliant:
Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.
Markdown
Appears as
*italics* or _italics_
italics
**bold** or __bold__
bold
- bulleted - list
bulleted
list
1. numbered 2. list
numbered
list
Note: you must add a full line of space before and after lists for them to show up correctly
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.
print "hello world"
Math
Appears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3
2×3
2^{34}
234
a_{i-1}
ai−1
\frac{2}{3}
32
\sqrt{2}
2
\sum_{i=1}^3
∑i=13
\sin \theta
sinθ
\boxed{123}
123
Comments
The solution is as I expected click here.I hope you don't mind that I copied the problem to math overflow.It uses only the multiplicative property of the degrees of number fields and that xp−1+xp−2+...+1, the pth cyclotomic polynomial, is irreducible (can be proven by shifting x to x+1 and using eisenstein).
By the way do you have a solution or just spotted that they are irreducible for small values?Vecause I can't figure out what identity to use to make that square root in a better form.Eisenstein still works though
@Pi Han Goh
–
So it is perfectly possible that a counterexample exists.Well I'm going to read up on Tschebyscheff Polynomials, any reccomendations?Also, I have found a paper that states that (T_p(x)/x/) is irreducible for all primes p.But I don't know how to deal with that -1.
Well cosx is 1 only when x is 2.pi.something.So that means that n.arrcosx must be 2.pi.something.So x=cos(2.π.k/n) are the roots of T_n(x)-1.Problem is, I don't know when they double roots and how to prove that T is their minimal polynomial.It is interesting that these roots are the real parts of the roots of unity.
This post needs to be seen by more people so we can actually solve it lol.Also I still cannot understand why Eisenstein works here (what is special about the coeffs)
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
The solution is as I expected click here.I hope you don't mind that I copied the problem to math overflow.It uses only the multiplicative property of the degrees of number fields and that xp−1+xp−2+...+1, the pth cyclotomic polynomial, is irreducible (can be proven by shifting x to x+1 and using eisenstein).
Log in to reply
Haha, it's a bit of an overkill to use OverFlow! I was about to post this in StackExchange if there's no answer. Thanks!
Log in to reply
I posted it on stackexchange, but no one provided a good solution :D
If you shift x to x+1 the irreducibility of these can be proven with Eisenstein's criterion.
Log in to reply
Thanks! But how do I prove that it's true for ALL odd primes p?
By the way do you have a solution or just spotted that they are irreducible for small values?Vecause I can't figure out what identity to use to make that square root in a better form.Eisenstein still works though
Log in to reply
I don't have a solution, hence the "or disprove" statement. I got inspired by solving via the Challenge Master notes comment on my solution here.
Log in to reply
Log in to reply
Log in to reply
this paper is interesting
I think that the identity Tn(x)=cos(n.arccosx) can give us the roots of Tn(x)−1
Log in to reply
I'm listening. Please continue on your elaboration.
Log in to reply
Well cosx is 1 only when x is 2.pi.something.So that means that n.arrcosx must be 2.pi.something.So x=cos(2.π.k/n) are the roots of T_n(x)-1.Problem is, I don't know when they double roots and how to prove that T is their minimal polynomial.It is interesting that these roots are the real parts of the roots of unity.
Log in to reply
(Tn(x)−1)/(x−1)(Tn(x)+1)/(x+1)=Un−1 might help, since we know the factorisation of U.
Also the identityThis post needs to be seen by more people so we can actually solve it lol.Also I still cannot understand why Eisenstein works here (what is special about the coeffs)