Looks like cauchy!

Algebra Level 5

For all positive integers k k , define f ( k ) = k 2 + k + 1 f(k)=k^2+k+1 . Compute the largest positive integer n n such that 2015 f ( 1 2 ) f ( 2 2 ) f ( n 2 ) ( f ( 1 ) f ( 2 ) f ( n ) ) 2 . 2015f(1^2)f(2^2)\cdots f(n^2)\geq \Big(f(1)f(2)\cdots f(n)\Big)^2.


The answer is 44.

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.

2 solutions

Parth Lohomi
May 19, 2015

Note that f ( k 2 ) = f ( k ) ( k 2 k + 1 ) f(k^2)=f(k) \cdot (k^2-k+1) so the inequality reduces to 2015 k = 1 n k 2 + k + 1 k 2 k + 1 2015 \ge \displaystyle\prod_{k=1}^{n} \frac{k^2+k+1}{k^2-k+1} Now note that since ( k + 1 ) 2 ( k + 1 ) + 1 = k 2 + k + 1 (k+1)^2-(k+1)+1=k^2+k+1 , the RHS telescopes and we get 2015 n 2 + n + 1 n 44 2015 \ge n^2+n+1 \implies n \le \boxed{44}

Aakash Khandelwal
May 20, 2015

f(n^2)=n^4+n^2+1=(n^2+n+1)(n^2-n+1)

That is 2015 1^2 3^2 7^2….((n^2-n+1)^2 (n^2+n+1)≥1^2 3^2 7^2 …((n^2-n+1)^2 (n^2+n+1)^2

therefore 2015≥(n^2+n+1)^2

therefore n belongs to (-45.38 , 44.38)

since n is integer maximum value of it will be=44

Moderator note:

Check your working again.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...