title: Upper limits for fibonnacci
body: <p>I was reading about the DP version of fibonnaci.<br>
  In Sedgewick I saw:<br>
  <code>int[] T = new int[47];</code>  for storage of the previous calculations. Elsewhere I saw that the max input for fibonacci should be less than <code>92</code>.<br>
  It is not clear to me how does these numbers come up? I understand that it has to do with overflow and size of <code>int</code> but I am not clear how we end up with these limits.<br>
  Any help?</p>