Fibonacci_digit_sum_number

Правка en2, от prodipdatta7, 2017-10-16 16:49:16

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 :)

Теги number theory, big integers

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский prodipdatta7 2017-10-16 16:49:16 1
en1 Английский prodipdatta7 2017-10-16 16:47:37 241 Initial revision (published)