A polynomial is called Gelatinous if its coefficients are integers and . If is a Gelatinous polynomial, what's the maximum number of integer solutions for ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Consider the polynomial g ( x ) = p ( x ) − x 3 . We want to find maximum number of integral roots of g ( x ) subject to the given constraints on the polynomial p ( x ) . By the fundamental theorem, the polynomial g ( x ) can be factorized into its roots (assumed to be there are m of them) as follows g ( x ) = p ( x ) − x 3 = A i = 1 ∏ m ( x − α i ) For some real number A and possibly complex numbers α i , i = 1 , 2 , … , m . Since p ( 1 0 0 ) = 1 0 0 , we require 1 0 0 − 1 0 0 3 = A i = 1 ∏ m ( 1 0 0 − α i ) i.e., A i = 1 ∏ m ( 1 0 0 − α i ) = − 1 × 2 2 × 3 2 × 5 2 × 1 1 × 1 0 1 Clearly, there can be at most m integral roots of g ( x ) which is achieved when A and all of α i 's are integers. In that case the polynomial p ( x ) will have all integral coefficients. From the factorization above, we can choose at most 2 + 2 + 2 + 1 + 1 + 2 = 1 0 (the last two is for the factor ± 1 ) distinct integral values of the roots α i , which gives the maximum number of integral solutions for p ( k ) = k 3 .