- #36
- 19,805
- 25,822
Such small examples with high powers are easy. ##n\longmapsto n^6## quickly exceeds ##66##, so ##u## can only be ##1## or ##2##. If we seek especially integer solutions, the fastest algorithm is certainly to check all possibilities.
Edit:
If we have an integer polynomial ##p(x)=x^n+a_1x^{n-1}+\ldots +a_{n-1}x+a_n## and a number ##z## is a zero, that means ##p(z)=0##, then we can write ##p(x)=(x-z)\cdot q(x)## with a polynomial ##q(x)## of degree ##n-1##. This means especially that ##z## divides the constant term ##a_n\, : \,z|a_n\,.##
So in your example of ##p(u)=u^6+u-66## we can only have divisors of ##66## as possible integer solutions. So regardless that ##4## and ##5## are already too big, they do not divide ##66## either.
Edit:
If we have an integer polynomial ##p(x)=x^n+a_1x^{n-1}+\ldots +a_{n-1}x+a_n## and a number ##z## is a zero, that means ##p(z)=0##, then we can write ##p(x)=(x-z)\cdot q(x)## with a polynomial ##q(x)## of degree ##n-1##. This means especially that ##z## divides the constant term ##a_n\, : \,z|a_n\,.##
So in your example of ##p(u)=u^6+u-66## we can only have divisors of ##66## as possible integer solutions. So regardless that ##4## and ##5## are already too big, they do not divide ##66## either.
Last edited: