Can you please let me know what should be value of Sn ? i.e. the F1[1] = ? Also , the approach explained here in Hint, looks different from one explained in handbook,Can you please provide some references in relation to this problem.
SPP-Recursive Sequence
Hey @shellcodingblock
What are you referring by Sn here
Please tell that
And please let me know which resource you need to help resolved the difference between solution provided here and in the handbook so I’ll be able to help you better
By Sn i mean the sum of n terms of the series.
we need it because we have to find sum (am,am+1,am+2…an)
I see a difference in implementation shown in handbook and approach explained in hint.
So, i was trying to ask if you can refer me any resource which can help me understand both the implementations
@shellcodingblock buddy
I am at fail here sorry
This tutorial is the best way I can refer you to solve this question
And I unfortunately don’t have the handbook to help resolve the 2 approaches
Maybe you can drop this query on the whatsapp group
Others who faced the same issue will be able to help you out quickly
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.