- #1
Pandaren
- 11
- 0
Fibonacci numbers are the sequence 1,1,2,3,5,18,13,21... where after the initial two 1's, each number in the sequence is the sum of the previous two. Prove that there is no postive integer m such that the sum of every m consecutive Fibonacci numbers is odd.
Can anyone explain to me what's the underlined part mean? Thanks a lot for your help
Can anyone explain to me what's the underlined part mean? Thanks a lot for your help