Problem 25 1000-digit Fibonacci number
Problem 25: 1000-digit Fibonacci number
The Fibonacci sequence is defined by the recurrence relation:
Fn = Fn−1 + Fn−2, where F1 = 1 and F2= 1.
Hence[……]
Problem 20 Factorial digit sum
Problem 20: Factorial digit sum
n! means n × (n − 1) × … × 3 × 2 × 1
For example, 10! = 10 × 9 × … × 3 × 2 ×[……]
Problem 13 Large sum
Problem 13: Large sum
Work out the first ten digits of the sum of the following one-hundred 50-digit numbers.
37[……]