|
||
Title: A Polynomial Post by THUDandBLUNDER on Dec 6th, 2004, 10:26am Let P(x) = cnxn + cn-1xn-1 + ... + c0 be a polynomial with integer coefficients. Suppose that r is a rational number such that P(r) = 0. Show that the n numbers cnr, cnr2 + cn-1r, cnr3 + cn-1r2 + cn-2r, ......., cnrn + cn-1rn-1 + ... + c1r are integers. |
||
Title: Re: A Polynomial Post by Barukh on Dec 8th, 2004, 1:26am [smiley=blacksquare.gif][hide] Since this problem is in Putnam section, it is possible to use heavier stuff – so I will exploit Gauss’s Polynomial Theorem (http://mathworld.wolfram.com/GausssPolynomialTheorem.html) (GPT). Because r = p/q is a root of P(x), the latter – according to GPT – may be factored as where all bi-s are integers. So, we get: cn = bn-1q cn-1 = bn-2q - bn-1p … ci = bi-1q - bip ... c0 = -b0p Now, suppose we want to evaluate P(r) using those expressions and applying Horner’s rule (http://mathworld.wolfram.com/HornersRule.html). We will get the following partial sums: cn = bn-1q cnr + cn-1 = bn-2q … cnri + cn-1ri-1 + … + cn-i = bn-i-1q ... cnrn-1 + cn-1rn-2 + … + c1 = b0q Note that when multiplied by r, these sums become the n requested numbers – which therefore equal bn-1p, bn-2p, …, b0p, all integers. [/hide][smiley=blacksquare.gif] Nice problem, THUD&BLUNDER! Is it possible to know the source? ;) |
||
Title: Re: A Polynomial Post by THUDandBLUNDER on Dec 8th, 2004, 7:12am Quote:
Yes, it is possible. ;) |
||
Title: Re: A Polynomial Post by Barukh on Dec 8th, 2004, 9:20am on 12/08/04 at 07:12:58, THUDandBLUNDER wrote:
Thanks for the answer. ;D You are in a good company: |
||
Powered by YaBB 1 Gold - SP 1.4! Forum software copyright © 2000-2004 Yet another Bulletin Board |