Recent content by newfeeling

  1. N

    Comp Sci Project Euler Problem 002: Fibonacci sequence (in C++)

    When I punch in sufficiently large number for the program, I get clearly bogus results like -98123786458 for example; this problem does not arise with numbers that are not particularly big. And yes I have checked how large Fibonacci numbers get O_O.
  2. N

    Comp Sci Project Euler Problem 002: Fibonacci sequence (in C++)

    Homework Statement Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be: 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ... By considering the terms in the Fibonacci sequence whose values do not exceed four million...
Back
Top