document.write( "Question 375001: When finding the greatest common factor of a polynomial, can the factor ever be larger than the smallest coefficient? Can it ever be smaller than the smallest coefficient? \n" ); document.write( "
Algebra.Com's Answer #266685 by solver91311(24713)\"\" \"About 
You can put this solution on YOUR website!
\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "I'm going to assume that you mean \"...can the absolute value of the numerical coefficient ever be larger than the smallest numerical coefficient in the polynomial...\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "No. If the coefficient in the potential factor were larger than any of the coefficients in the polynomial, then that coefficient couldn't be a factor of that term of the polynomial.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Yes. Consider a three term polynomial with numerical coefficients of 6, 34, and 22. The GCF of the polynomial would have a numerical coefficient of 2 which is smaller than all of the coefficients.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "John
\n" ); document.write( "
\n" ); document.write( "My calculator said it, I believe it, that settles it
\n" ); document.write( "
\"The

\n" ); document.write( "
\n" ); document.write( "
\n" );