Write a method called fractionSum that accepts an integer parameter n and returns as a double the sum of the first n terms of the sequence
![]()
In other words, the method should generate the following sequence:
![]()
You may assume that the parameter n is nonnegative.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.