Simple pascal's triangle problem

Question

Hi,
I'm new to Java, and I'm trying to make a recursive method that outputs a pascal's triangle, n = 4. based on the choose function: (n,k) =(n-1, k-1) + (n-1,k). I believe there are a lot of errors in my source code, which compiles, but I just can't figure out what I need to do next to get it to actually display the pascal triangle, based on what I have so far. could anyone give me some directions as to how to think through the problem. here's my source code:
public class pascal
     public int choose (int n, int k)
          int result = 0;
          if (n==0 && k==0)
               result = 1; \\base case
          else
               for (int i=0; i<=k; i++)
                    if(i==0 || i==k)
                         result = 1;
                    else
                    result = choose(n-1,i-1) + choose(n-1,i);
          System.out.print(result);
          return result;
     public static void main (String[] args)
          int n = 4;
          int k = n;
          pascal test = new pascal();
          test.choose (n,k);
}

Answer 1

Think of this little recurrence relation a bit more: c(n,k) =c(n-1, k-1) + c(n-1,k).
When n == k, the result equals 1 (one). Those values can be found
on the right diagonal side of the triangle. If k > n, the value has to be
0 (zero). Those values can be found outside the triangle.
Of course n >= 0 and k >= 0. If you put this all together you get:int c(int n, int k) {
   if (k == n) return 1;
   if (k > n) return 0;
   return c(n-1, k-1)+c(n-1, k);
}kind regards,
Jos