Very simple roots – 2

Algebra Level 3

A polynomial

p ( x ) = x n + a n 1 x n 1 + + a 2 x 2 + a 1 x + a 0 p(x) = x^n + a_{n-1}x^{n-1} + \cdots + a_2x^2 + a_1x + a_0

of degree n n may be called simple if it satisfies the following conditions:

  • All coefficients are integers
  • Its n n roots r 0 , 1 , , n 1 r_{0,1,\ldots,n-1} are all real and distinct
  • For every root r i r_i there is exactly one coefficient a j a_j such that r i = a j r_i = a_j

If I want n 3 n \geq 3 , what integer must a 0 a_0 be in order to keep the possibility of a simple polynomial with degree n n ?


The answer is 0.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Henry U
Nov 19, 2018

A polynomial with roots r 0 , , n 1 r_{0,\ldots,n-1} can be written as

p ( x ) = ( x r 0 ) ( x r 1 ) ( x r 2 ) ( x r n 2 ) ( x r n 2 ) p(x) = (x-r_0)(x-r_1)(x-r_2)\cdots(x-r_{n-2})(x-r_{n-2}) .

When this is factored out, we get

p ( x ) = r 1 r 2 r 3 r n 2 r n 1 + stuff x p(x) = r_1r_2r_3\cdots r_{n-2}r_{n-1} + \text{stuff} \cdot x

By comparing the coefficients, in particular the constant terms, we note that

r 1 r 2 r n 1 = a 0 r_1r_2\cdots r_{n-1} = a_0

Since each root is equal to exactly one coefficient, we can also write this as

a 0 = a 0 a 1 a 2 a n 2 a n 1 a_0 = a_0a_1a_2\cdots a_{n-2}a_{n-1}

This is either equal if a 0 = 0 a_0 = 0 or a 1 a 2 a n 1 = 1 a_1a_2\cdots a_{n-1} = 1 , but the second is impossible since all coefficients are supposed to be distinct integers. Therefore, a 0 = 0 \boxed{a_0 = 0} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...