Talk:Vincent's theorem

Untitled section

I am just starting this article on Vincent's forgotten theorem. Just laid out its outline. Did some copying and pasting from Budan's theorem. Akritas2(talk) 08:42, 26 April 2012 (UTC)

Indentation in code

In VCA lines 8 and 10 it would be nice to have the text indented. How can this be done?Akritas2 (talk) 13:17, 4 May 2012 (UTC)

Square free + integer?

The algorithms are restricted to polynomials that are square-free and have integer coefficients. Is there a way to remove the restrictions? The simplicity of the algorithms is not so striking when you have to add a much more complicated factorization step.
I understand the reason for the square-free condition, but I don't see why it must be integer coefficients. — Preceding unsigned comment added by 93.220.44.166 (talk) 17:48, 12 May 2014 (UTC)

I think that square-free is not an issue. Here is a somewhat clumsy description: Give monic $f=f(x)$, compute $f'$ and find the gcd $g$ of these two (a monic polynomial). Then $h=f/g$ is the square free polynomial with the same roots as $f$. Find (small intervals containing) the roots of $h$ and then, one way or another, the multiplicity of each as a root of $f$. The last step could be done by finding the (approximate) roots, with multiplicity, of $g$ and then increasing that multiplicity by 1.Gentlemath (talk) 22:14, 12 September 2014 (UTC)

A question

?? what is l? r? is this suffled??? — Preceding unsigned comment added by 70.30.124.200 (talk) 15:14, 22 November 2016 (UTC)

What is being defined is what is meant by a sign variation between two terms, c_l and c_r. So l and r are just two indices. To paraphrase the definition without the subscripts–two (non-zero) terms of a sequence are said to have a sign variation if they have different signs and either they are consecutive or if, not consecutive, all the terms of the sequence between them are zero.--Bill Cherowitzo (talk) 03:35, 24 November 2016 (UTC)

Feedback from New Page Review process

I left the following feedback for the creator/future reviewers while reviewing this article: Thanks for creating this article!.

✠ SunDawn Ω (contact) 03:49, 21 May 2022 (UTC)