title: Recursive Boolean method to check if integer is divisible
body: <p>This is what i have so far, it works, but its not recursive. Any idea how to translate this into recursion </p>
  
  <pre><code>   public static boolean isDivide(int n)
     {
     if (n &lt; 10) System.out.println (n);
     int sum = 0;
     while (n &gt; 0)
     {
     sum += n % 10;
     n = n / 10;
     }
     while (sum &gt;= 0)
     {
     sum -=3;
     }
     //System.out.println(n==0);
     return n==0;
  
     } 
  </code></pre>