CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
2
You visited us 2 times! Enjoying our articles? Unlock Full Access!
Question

It is given that f(1)+2f(2)+...+nf(n)=n(n+1)f(n).The value off(1)=1and f(999)is1k , where k equals.


Open in App
Solution

Find the value of k:

Given that f999=1k.

The summation of series will be utilized. We are aware that the formula for the function f is provided as

f(1)+2f(2)+3f(3)…+nf(n)=n(n+1)f(n)…….(1)

If we use n=n+1 in the equation above, we get,

f(1)+2f(2)+3f(3)…+nf(n)+(n+1)f(n+1)=(n+1)(n+2)f(n+1)……(ii)

Now, Subtract the both equations

=(n+1)f(n+1)=(n+1)(n+2)f(n+1)-n(n+1)f(n)=(n+1)(n+2)f(n+1)-(n+1)f(n+1)=n(n+1)f(n)=f(n+1){(n+1)(n+2)-(n+1)}=n(n+1)f(n)=(n+1)f(n+1){n+1}=n(n+1)f(n)=(n+1)2f(n+1)=n(n+1)f(n)

Remove n+1 from both sides of the equation, we get,

⇒(n+1)f(n+1)=nf(n)

Now for any n, we have,(n+1)f(n+1)=nf(n).

This type of situation is only possible if the value of nf(n) is a constant.

Let the constant be C, then nf(n)=C.
⇒kf(k)=C where C is a constant.
When k=1,
⇒1f(1)=C
Now,f(999)=1k, and we have,

kf(k)=C
⇒f(k)=Ck⇒f(k)=1kwhenC=1⇒k=999
Therefore , the required value of k is 999.


flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Binary Operations
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon