Question

Language- Java

It’s urgent, please help ASAP!

lE will result in a zero for the entire uhTe R will be submitted for you when time is up. D | Question 43 35 pts Write a recursive method to caculate the sum of the following convergent series of the alternating signs of the reciprocals of powers of 2 out to a number of terma given as a parameter: 3 1 2 4 8 16 32 The header will be as follows public double sum(int n) t Include this header in your answer. You may assume that n is always greater than O. HTM

Answer 1

public class RecursiveSum {
  
   public static double summ = 0;
   public static int i = 0;

  
   public double sum(int n){
       ++i;  
      
   if(n>0){  
if (i%2 != 0){
   summ = summ + 1/(Math.pow(2,i-1));
}      
else{   
   summ = summ - 1/(Math.pow(2,i-1));
}
  
return sum(--n);
   }
   else{
       return summ;
   }
      
   }
  
  
   public static void main(String[] args) {
      
       int n;
      
       n = 4;
       System.out.println("n = " + n);
      
       RecursiveSum r = new RecursiveSum();
       System.out.println("sum = " + r.sum(n));

   }

}

sum 0.625

COMMENT DOWN FOR ANY QUERY RELATED TO THIS ANSWER,

IF YOU'RE SATISFIED, GIVE A THUMBS UP