Question: (this is java 2) 1- Write a recursion method named sum to find the summation of the following: f(1)=1 f(n)=1+21+31+41++n1 for Example if n=5 x=1nx1=2.2833

(this is java 2)  (this is java 2) 1- Write a recursion method named sum

1- Write a recursion method named sum to find the summation of the following: f(1)=1 f(n)=1+21+31+41++n1 for Example if n=5 x=1nx1=2.2833 2- Write a java program to ask the user to enter the positive integer (n) and print the summation on the screen Input/output Sample: Enter a positive integer n:5 The summation is =2.283333333333333

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!