Showing that x^{n}-ax^{n-1}-bx-1, for non-negative integers n \geq 3, a

acceloq3c

acceloq3c

Answered question

2022-04-23

Showing that xnaxn1bx1, for non-negative integers n3,a1, b, has no double roots

Answer & Explanation

Aliana Sexton

Aliana Sexton

Beginner2022-04-24Added 20 answers

Let fZ[x] be given by
f=xnaxn1bx1
where n3,a1,b0.
Claim:f has no repeated roots.
Proof:
Suppose otherwise.
Our goal is to derive a contradiction.
First note that if f has a rational root r, then
r=1
- n is odd.
b=a+2.
f(1)=(a+1)(n2)>0.
hence no repeated root of f is rational.
Let w be a repeated root of f.
As you showed (but with a minor correction to your result), w must satisfy the equation
b(n1)w2(ab(n2)n)wa(n1)=0
so we can't have b=0, else w would be rational.
Hence w is a root of the quadratic polynomial
p=x2(ab(n2)nb(n1))xab
which must be irreducible in Q[x] (since w is not rational).
Since p is irreducible in Q[x] and w is a common root of p and f, it follows that p is a factor of f in Q[x], hence we can write f=pq for some gQ[x].
But w is a simple root of p (since p is irreducible in Q[x]), and by assumption, w is a repeated root of f, hence from f=pq, we get that w is a root of g, so p is a factor of g in Q[x].
It follows that p2 is a factor of f in Q[x].
Note that the discriminant of p is positive, so the roots of p are real, and the product of the roots of p is negative, so one of the roots of p is negative, and the other is positive.
But the roots of p are repeated roots of f, contradiction, since by Descartes' rule of signs, f can't have a repeated positive root.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?