Find the largest integer , such that for some non-constant cubic polynomial with integer coefficients,
Details and assumptions
For (possibly negative or zero) integers and the notation means that for some integer
The divisibility condition is a statement about integers, not polynomial.
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.
Note that for any polynomial of degree at most 3 , and any value of x , f ( x ) − 4 f ( x + 1 ) + 6 f ( x + 2 ) − 4 f ( x + 3 ) + f ( x + 4 ) = 0 . It is easy to prove this - for example, notice that it is the method of differences (from a Brilliant post a while back) applied iteratively four times.
Let us suppose that n is at least 7 . Then, if 2 ≤ x ≤ 4 , f ( x ) ∣ f ( x + 1 ) , f ( x ) ∣ f ( x + 2 ) and f ( x ) ∣ f ( x + 3 ) . But f ( x + 3 ) = 4 f ( x + 2 ) − 6 f ( x + 1 ) + 4 f ( x ) − f ( x − 1 ) , so f ( x ) ∣ f ( x − 1 ) (since f ( x ) divides all the other terms in that expression. Hence, ∣ f ( x ) ∣ is constant for 1 ≤ x ≤ 4 .
Let f ( 1 ) = A . There are 8 cases for the values of f ( 2 ) , f ( 3 ) and f ( 4 ) , since each must be ± A .
I will not deal with all 8 cases here, but I will deal with three as examples.
We have worked out subsequent values of f using the above formula.
Dealing with the other five cases similarly shows that n < 7 .
The third case gives us our example when n = 6 : Taking A = − 3 , we find that f ( x ) = ( x − 2 ) ( x − 3 ) ( x − 4 ) + 3 works.