With great $$F_{n}$$ comes great runtime

Let $$F_{n}$$ denotes the $$n^\text{th}$$ Fibonacci number.

Find the sum of odd-digits of $$\displaystyle F_{1000}$$.

As an explicit example, sum of odd-digits of $$128974402103=1+8+7+4+2+0=22$$

×

Problem Loading...

Note Loading...

Set Loading...