Hi,
Homework Statement
I am expected to show that the polynomial
a1xb1 + a2xb2 + ... + anxbn = 0
has at most n-1 solutions in (0,infinity), where a1,a2,...,an are real numbers different than zero, and b1,b2,...,bn are real numbers so that bj is different than bk for j different than k...