A function f(x) satisfies f(1) = 3600, and f(1) + f(2) + ... + f(n) = n²f(n), for all positive integers n > 1. What is the value of f(9)?
Explanation:
f(1) + f(2) + f (3) + … + f(n −1) + f(n) = n2f(n) ... (i)
Similarly, f(1) + f(2) + f (3) + … + f(n − 1) = (n − 1)2 f(n −1) ... (ii)
⇒ f(n) = n2 f(n) – (n – 1)2f(n − 1) ... (i) – (ii)
⇒ (n2 – 1)f(n) = (n – 1)2f(n – 1)
⇒ f(n) = (n-1)2f(n-1)(n2-1)
⇒ f(n) = (n-1)f(n-1)(n+1)
Now, putting
n = 2 we get f(2) = 13×f(1) n = 3 we get f(2) = 24f(2) = 24×13×f(1) ... n = 9 we get f(9) = 810f(8) = 810×79×68×57×46×35×24×13×f(1)
∴ f(9) = 810×79×68×57×46×35×24×13×3600
= 210×9×3600 = 80
Hence, option (a).
Help us build a Free and Comprehensive Preparation portal for various competitive exams by providing us your valuable feedback about Apti4All and how it can be improved.