title: Adding fractions using recursion
body: <p>I need to write a recursive method to compute the following series:</p>
  
  <pre><code>m(i) = 1/3 + 2/5 + 3/7 + 4/9 + 5/11 + 6/13 + .... + i/(2i + 1)
  </code></pre>
  
  <p>Then I need to write a program that displays <code>m(i)</code> for <code>i = 1,2,....10</code>.</p>
  
  <p>I understand the basic idea of recursion I had done 2 programs so far, one for factorials and one for a Fibonacci number sequence. This problem has me stumped. </p>
  
  <p>This is what I have so far. </p>
  
  <pre><code>public static void main(String[] args) {
      for (int i = 1; i &lt;= 10; i++) {
          System.out.println(m(i));
      }
  }
  
  public static double m(int i) {
      if (i == 1)
          return 1;
      else
          return ???;
  }
  </code></pre>