benchmarks.wiki / Public workspace

MATH / Suppose the polynomial

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

Suppose the polynomial f(x)=anxn+an−1xn−1+⋯+a2x2+a1x+a0f(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_2x^2 + a_1x + a_0has integer coefficients, and its roots are distinct integers. Given that an=2a_n=2 and a0=66a_0=66, what is the least possible value of |an−1||a_{n-1}|?
Plain-text mathematical notation (without MathML)
Suppose the polynomial
f(x)=a_(n)x^(n)+a_(n−1)x^(n−1)+⋯+a₂x²+a₁x+a₀has integer coefficients, and its roots are distinct integers.

Given that a_(n)=2 and a₀=66, what is the least possible value of |a_(n−1)|?
Original LaTeX notation
Suppose the polynomial
$$f(x) = a_nx^n + a_{n-1}x^{n-1} + \cdots + a_2x^2 + a_1x + a_0$$has integer coefficients, and its roots are distinct integers.

Given that $a_n=2$ and $a_0=66$, what is the least possible value of $|a_{n-1}|$?

level

Level 5

type

Intermediate Algebra

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

Official source

initial import