Define a function such that for every integer x. Find the largest positive integer "n" such that:
.
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 the factorization.
n 4 + n 2 + 1 = ( n 2 + n + 1 ) ( n 2 − n + 1 ) = ( n 2 + n + 1 ) ( ( n − 1 ) 2 + ( n − 1 ) + 1 ) .
Hence: f ( x ) satisfies the relation f ( n 2 ) = f ( n ) × f ( n − 1 ) .
Dividing both sides by ∏ ( p r o d u c t ) f ( n 2 ) .
On simplification it turns into
2 0 1 5 ≥ f ( 0 ) f ( n ) = n 2 + n + 1 .
Now since
n 2 < n 2 + n + 1 < ( n + 1 ) 2 and 4 4 2 < 2 0 1 5 < 4 5 2
So ,It suffices to check only n=44, which still satisfies the inequality.