title: Java Program Fibonacci Sequence
body: <p>I am writing a "simple" program to determine the Nth number in the Fibonacci sequence. Ex: the 7th number in the sequence is: 13.  I have finished writing the program, it works, but beginning at the 40th number it begins to delay, and takes longer, and longer.  My program has to go to the 100th spot in the series.</p>
  
  <p>How can I fix this so it doesn't take so long? This is very basic program, so I don't know all the fancy syntax codes.. my formula is:</p>
  
  <pre><code>if n =1 || n = 0
     return n;
  
  else 
      return F(n-1) + F(n-2);
  </code></pre>
  
  <p>This works great until it goes past the 40th term. What other statement do I have to add to make it go quicker for higher numbers??</p>