Is there any efficient way to calculate the number of digits and sum of digits in the n'th Fibonacci number?? Range of n can have 1 <= n <=10^18...Any answer related to this topic will be appreciated... Thanks :)
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3821 |
3 | Benq | 3736 |
4 | Radewoosh | 3631 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3388 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Fibonacci_digit_sum_number
Is there any efficient way to calculate the number of digits and sum of digits in the n'th Fibonacci number?? Range of n can have 1 <= n <=10^18...Any answer related to this topic will be appreciated... Thanks :)
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | prodipdatta7 | 2017-10-16 16:49:16 | 1 | |||
en1 | prodipdatta7 | 2017-10-16 16:47:37 | 241 | Initial revision (published) |
Name |
---|