Timeline for Python Solution for Project Euler #2 (Fibonacci Sums)
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 7, 2014 at 19:34 | comment | added | matheussilvapb |
@200_success The wikipedia entry you just linked, says that you can start with either [1, 1] or [0, 1].
|
|
| Aug 7, 2014 at 19:30 | comment | added | 200_success | It takes two fixed consecutive entries to uniquely define a Fibonacci-type sequence. The zero-based definition just says that it starts with 0, 1, …. A silly definition of 0, 0, … would, of course, result in all zeroes. | |
| Aug 7, 2014 at 19:26 | comment | added | matheussilvapb | @200_success Ok ok, but it just don't make sense for me to start it with zero because the whole sequence would zeroes. | |
| Aug 7, 2014 at 19:20 | comment | added | 200_success | Some say that the Fibonacci Sequence is 0, 1, 1, 2, …; other say it is 1, 1, 2, …. Either way, it makes no difference if you just want to find the sum of the even entries. | |
| Aug 7, 2014 at 18:59 | comment | added | matheussilvapb |
@ckuhn203 actually it can't start at zero because the next number is defined by the sum of the two preceding numbers, so if you start at zero you'll have [0] the second number will be the first number plus zero because you still don't have 2 numbers, and it'll become [0, 0], then the third will be 0, the forth, the fifth all of them will be equal to zero... that's why you can't start the fibonacci series at zero.
|
|
| Aug 6, 2014 at 1:18 | comment | added | RubberDuck | Saying that the Fibonacci sequence starts at zero does not break the algorithm. It's completely reasonable to believe that it does start at zero. | |
| Apr 21, 2014 at 18:40 | history | edited | matheussilvapb | CC BY-SA 3.0 |
better use of list index
|
| Apr 21, 2014 at 18:26 | comment | added | user22048 | If you solve it and look at the corresponding solution pdf (note the checkmark, pdf, and person icons to the right of the Solved By column) you will see an even more optimized solution that isn't 'cheating' but rather recommended. | |
| Apr 21, 2014 at 18:21 | history | answered | matheussilvapb | CC BY-SA 3.0 |