Bourbaki

Exercise 18, § 2

Algebra, VI, p. 41

Let K be a maximal ordered field and let f be a polynomial of degree n in K[T], all of whose roots are in K. Show that for all c≠0c \neq 0 in K the polynomial f2+cf′f^2 + c f' has at least n−1n - 1 and at most n+1n + 1 roots in K, counted with multiplicity (use Ex. 13).

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.