2000 character limit reached
Roots of polynomials and the Sendov's conjecture
Published 3 Jun 2018 in math.GM | (1806.00759v2)
Abstract: In this paper we first prove that a simple root of a polynomial satisfies the Sendov's conjecture. As the multiple roots trivially satisfy the Sendov's conjecture we conclude that the Sendov's conjecture holds true.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.