I have problem about the polynomial. Given the polynomial, , where . How to check, whether all root belong to open unit disk ? By reading the references, I have founded the Lehmer's method can be used to solve this problem. But, until right now, I don't understand.. I implement it too into computer programming as the programming excersice.. Any help, thank you very much :)
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
Not answering your question, but k=n, right? So why don't you use just one variable? :)
Log in to reply
I am sorry, you're right. I have edited, that pk and next are the coeficient of the polynomial. Means, the general polynomial to declare. Yes, it is using one variable that x.
Anyone?