Divisibility #1

A polynomial f ( x ) f(x) satisfies the following conditions:

  • lim x f ( x ) x 2 = 1 \displaystyle \lim_{x \to \infty} \frac{f(x)}{x^2} = 1
  • f ( 1 ) > 1 f(-1) > 1
  • f ( 0 ) f(0) is a prime number
  • There exists an integer k > 1 k > 1 such that for all positive integer n n , f ( n ) f(n) is a positive integer divisible by k k

Find the maximum value of f ( 1 ) + k f(1) + k .


The answer is 6.

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

Boi (보이)
Jun 15, 2017

Let f ( x ) = x 2 + a x + b f(x)=x^2+ax+b , according to the first condition.

Then f ( 1 ) = 1 a + b > 1 f(-1)=1-a+b>1 , which means a < b a<b , and let's figure out that f ( 1 ) = 1 + a + b < 1 + 2 b f(1)=1+a+b<1+2b for later use.

Also, f ( 0 ) = b f(0)=b is a prime number.

If f ( n ) f(n) is a multiple of k k for every natural number n n , then we can substitute n = k n=k , n = k 1 n=k-1 and n = 1 n=1 , and then find out some things.


(1) n = k n=k

k f ( k ) = k 2 + a k + b = k ( k + a ) + b k b \begin{aligned} &k | f(k)=k^2+ak+b=k(k+a)+b \\ \\ & \therefore \quad k | b \end{aligned}


(2) n = k 1 n=k-1

k f ( k 1 ) = ( k 1 ) 2 + a ( k 1 ) + b = k ( k 2 + a ) + 1 a + b k 1 a + b \begin{aligned} &k | f(k-1)=(k-1)^2+a(k-1)+b=k(k-2+a)+1-a+b \\ \\ &\therefore\quad k | 1-a+b \end{aligned}


(3) n = 1 n=1

k f ( 1 ) = 1 + a + b k | f(1)=1+a+b


From (2) and (3), we can figure out that

k 2 + 2 b k | 2+2b

And substituting (1), we can say that

k 2 k | 2

Since k > 1 k>1 , k = 2 \boxed{k=2} .


Then, from (1), we know that b b is an even number.

We've found that f ( 1 ) < 1 + 2 b f(1)<1+2b , and we know that b b is a prime.

Therefore, b = 2 \boxed{b=2} .


What about a a ?

Since 2 = k 1 + a + b = 3 + a 2=k|1+a+b=3+a and a < b = 2 a<b=2 ,

a a is an odd number which is less than 2 2 .

f ( 1 ) + k = 1 + a + b + k = 5 + a f(1)+k=1+a+b+k=5+a .

So in order for f ( 1 ) + k f(1)+k to have the largest value possible, a = 1 \boxed{a=1} .


Therefore, the maximum of f ( 1 ) + k f(1)+k is

f ( 1 ) + k = 1 + a + b + k = 6 f(1)+k=1+a+b+k=\boxed{6} .

A simpler way to conclude k = 2 k = 2 is to observe that k k divides each of f ( 1 ) , f ( 2 ) , f ( 3 ) f(1), f(2), f(3) , and so also divides f ( 1 ) 2 f ( 2 ) + f ( 3 ) = 2 f(1) - 2f(2) + f(3) = 2 .

Ivan Koswara - 3 years, 12 months ago

Log in to reply

That's very neat! I didn't think of that! 👍

Boi (보이) - 3 years, 12 months ago

Really bro like this strategy

Nivedit Jain - 3 years, 12 months ago

Isn't this the only possible polynomial?

Kushagra Sahni - 3 years, 12 months ago

Log in to reply

f ( x ) = x 2 x + 2 f(x)=x^2-x+2 is also possible!

Boi (보이) - 3 years, 12 months ago

I used eulid division lemma to conclude k=2

Nivedit Jain - 3 years, 12 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...