Take the 2-minute tour ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

If a polynomial has only integer roots, is it always possible to find a root using the rational roots theorem?

share|improve this question
7  
Yes. That's what the rational root theorem guarantees (given that you can factor the constant term). –  Qiaochu Yuan Dec 19 '11 at 20:44
1  
It's difficult to answer till you clarify precisely what you mean by "find a root". E.g. it could mean anything ranging from a nonconstructive existence proof to a polynomial time root-finding algorithm. –  Bill Dubuque Dec 20 '11 at 0:01
add comment

1 Answer

if $a_nx^n+\cdots+a_0\in\mathbb{Z}[x]$ then every rational root is in the set $\{c/d : c|a_0, d|a_n\}$ as one can see by plugging in $c/d$ and multiplying the whole expression by $d^n$

share|improve this answer
2  
Beware that the test requires $\rm\:c/d\:$ in lowest terms, i.e. $\rm\:\gcd(c,d) = 1\:$ else e.g. $\ 6/2\ $ is a root of $\rm\ x - 3\ $ but neither $\rm\ 2\ |\ 1\ $ nor $\rm\:6\ |\ 3\:.$ –  Bill Dubuque Dec 19 '11 at 22:12
    
@BillDubuque does it work when there are two variables? –  yiyi Sep 1 '12 at 15:58
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.