Function can be tricky (4)

Algebra Level 5

Let f ( x ) f(x) be a quadratic polynomial with integer coefficients. If the value of f ( 0 ) f(0) , f ( 3 ) f(3) and f ( 4 ) f(4) are pairwise distinct but all belong to the set { 7 , 71 , 710 , 7102 } \{ 7 , 71 , 710 , 7102 \} , find the sum of all possible values of f ( 1 ) f(1) .


The answer is 7890.

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.

1 solution

Mark Hennings
Jul 31, 2017

We can write f ( x ) = A ( x 3 ) ( x 4 ) + B ( x 3 ) + C f(x) \; = \; A(x-3)(x-4) + B(x-3) + C where A , B , C A,B,C are integers, and f ( 0 ) = 12 A 3 B + C f ( 3 ) = C f ( 4 ) = B + C f(0) \; = \; 12A - 3B + C \hspace{1cm} f(3) \; =\; C \hspace{1cm} f(4) \; = \; B + C In particular, f ( 0 ) f ( 3 ) = 3 ( 4 A B ) f(0) - f(3) = 3(4A-B) is a multiple of 3 3 and f ( 0 ) f ( 4 ) = 4 ( 3 A B ) f(0) - f(4) = 4(3A-B) is a multiple of 4 4 . Thus there are only four possibilities: f ( 0 ) f ( 3 ) f ( 4 ) A B C f ( 1 ) 71 710 7 229 703 710 742 710 71 7102 1811 7031 71 3125 7 7102 71 2349 7031 7102 7070 7102 7 710 767 703 7 3203 \begin{array}{|ccc|ccc|c|}\hline f(0) & f(3) & f(4) & A & B & C & f(1) \\ \hline 71 & 710 & 7 & -229 & -703 & 710 & 742 \\ 710 & 71 & 7102 & 1811 & 7031 & 71 & -3125 \\ 7 & 7102 & 71 & -2349 & -7031 & 7102 & 7070 \\ 7102 & 7 & 710 & 767 & 703 & 7 & 3203 \\ \hline \end{array} and hence the answer is 742 3125 + 7070 + 3203 = 7890 742 - 3125 + 7070 + 3203 = \boxed{7890} .

(playing devil's advocate) Why can the first step be done? IE Can all quadratic polynomials with integer coefficients be expressed in that way for integer A, B, and C?

Note: The conclude that a b f ( a ) f ( b ) a - b \mid f(a) - f(b) can be obtained directly / is a "well known" result.

Calvin Lin Staff - 3 years, 10 months ago

Log in to reply

The first is "yes", since it is a matter of finding quotients and remainders when dividing by a two monic polynomials, the first quadratic and the second linear.

That a b a-b divides f ( a ) f ( b ) f(a)-f(b) is a bit fiddly in general (you gave to concatenate the fact that a b a-b divides a n b n a^n-b^n for all n n ), but the fact that a a divides f ( a ) f ( 0 ) f(a)-f(0) , which is all I use, is trivial. That yields a nicer approach.

Mark Hennings - 3 years, 10 months ago

Log in to reply

Indeed! I wanted to point out that it's an application of the remainder factor theorem with a slight twist. We first find the remainder when divided by x 3 x-3 , and then the remainder of the quotient when divided by x 4 x - 4 .

Most of the time, people are used to dividing out by the same term repeatedly, which leads to (say) f ( x ) = A ( x 3 ) 2 + B ( x 3 ) + C f(x) = A ( x-3)^2 + B(x-3) + C , which is also the maclaurin series expansion :)

Calvin Lin Staff - 3 years, 10 months ago

Interestingly, 7 + 71 + 710 + 7102 = 7890 7 + 71 + 710 + 7102 = 7890 . I found this by using a flawed method, but I still managed to get the right answer. :P

Jon Haussmann - 3 years, 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...