The sum and product of an nth degree polynomial

Click For Summary

Homework Help Overview

The discussion revolves around a monic polynomial of degree n and its roots, specifically focusing on proving the relationships between the roots and the coefficients of the polynomial, namely the sum and product of the roots.

Discussion Character

  • Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants explore the expression for the polynomial in terms of its roots and question the assumptions made in deriving the relationships. There is a focus on understanding the multiplication of polynomials and the implications of the Fundamental Theorem of Algebra.

Discussion Status

The discussion is ongoing, with participants questioning the validity of the proof and seeking clarification on the polynomial multiplication process. Some guidance has been offered regarding counting powers of x in the polynomial expansion.

Contextual Notes

There is an indication that the original poster may feel that certain assumptions in the proof are unsubstantiated, leading to a need for more foundational understanding of polynomial properties.

phyguy321
Messages
45
Reaction score
0

Homework Statement


Suppose f(x) [tex]\in[/tex] Complex[x] is a monic polynomial of degree n with roots c1,c2,...cn. Prove that the sum of the roots is -a[tex]_{n-1}[/tex] and their product is (-1)[tex]^{n}[/tex]a[tex]_{0}[/tex]

Homework Equations





The Attempt at a Solution


(x-c1)(x-c2)...(x-cn) = x[tex]^{n}[/tex] + (c1+c2+...+cn)x[tex]^{n-1}[/tex]...(c1*c2*...*cn)

I just need a realistic proof this assumes too much
 
Physics news on Phys.org
In what way do you think that's assuming too much? Do you know the Fundamental Theorem of Algebra?
 
but how do i know that (x-c1)(x-c2)...(x-cn) = xLaTeX Code: ^{n} + (c1+c2+...+cn)xLaTeX Code: ^{n-1} ...(c1*c2*...*cn)?
 
Count powers of x. There's only one way to make x^n and x^0. There are n ways to make x^1. You just imagine multiplying it out.
 
phyguy321 said:
but how do i know that (x-c1)(x-c2)...(x-cn) = xLaTeX Code: ^{n} + (c1+c2+...+cn)xLaTeX Code: ^{n-1} ...(c1*c2*...*cn)?

Because you know how to multiply polynomials?
 
so that's a legit proof then?
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 4 ·
Replies
4
Views
8K