Falling Behind in Studies? Join Our Performance Improvement Batch. Enroll For Free
One of our academic counsellors will contact you within 1 working day.
Click to Chat
1800-1023-196
+91-120-4616500
CART 0
Use Coupon: CART20 and get 20% off on all online Study Material
Welcome User
OR
LOGIN
Complete Your Registration (Step 2 of 2 )
Live 1-1 coding classes to unleash the creator in your Child
Please provide me the proof for point to consider 1st formula
we see that f(1)+f(2)+....+f(n)+f(n+1)+....+f(n+k)= f(1)+f(2)+....+f(k)+f(k+1)+...+f(n+k)rearranging, f(n+1)+....+f(n+k) – [f(1)+f(2)+....+f(k)]= f(k+1)+...+f(n+k) – [f(1)+f(2)+....+f(n)]or, ∑f(n+m) – ∑f(m) = ∑f(k+r) – f(r)hence proved
Post Question
Dear , Preparing for entrance exams? Register yourself for the free demo class from askiitians.
points won -