Find all polynomials \(P(x) = a_n x^n + a_{n-1} x^{n-1} \dots + a_1 x + a_0\) such that \(a_n \neq 0\), \((a_n, a_{n-1}, \dots, a_1, a_0)\) is a permutation of \((0, 1, 2, \dots, n)\) and all zeroes of \(P(x)\) are in \(\mathbb{Q}\).

I don't know the answer to this, but it is a problem we can work on together.

No vote yet

1 vote

×

Problem Loading...

Note Loading...

Set Loading...

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestWe can at least prove that the 0 coefficient must be at the constant place. Here is how:

Suppose that 0 is at a non constant position:

From the fact that P(0) >= 0 and P'(0) >= 0, we can deduce that all the roots are strictly negative. So the elementary symmetric polynomial of degree d in the roots is negative if d is odd and positive if d is even. In other words, it can never be zero, as is required for 0 to be at a non-constant position.

Log in to reply