title: Recursive method - Java
body: <p>Addition information:</p>
  
  <p>Chip doesn't support multiplication, only addition. I should work around this problem by creating a recursive method, mult(), that performs multiplication
  of x and y by adding x to itself y times. Its arguments are x and y and its return
  value is the product of x and y. I should then write the method and a main() to
  call it.</p>
  
  <p>It's pure logical thinking, but I get lost every time I try to think what to do.</p>
  
  <p>I am stuck at the math part.. 
  What I have, that doesn't work and I know the math is wrong, but I am not good at this:</p>
  
  <pre><code>public static void mult(int x, int y) {
      x = 0;
      y = 0;
      if (y &gt; 0) {
          for (int i = 0; i &lt; y; i++) {
              x = x * (x * y);
              return mult(x, y);
          }
      }
  }
  </code></pre>