Given two non-negative integers M, N which signifies the range [M, N] where M ≤ N, the task is to find the last digit of the sum of FM + FM+1… + FN where FK is the Kth Fibonacci number in the Fibonacci series.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …
Input: M = 3, N = 9
We need to find F3 + F4 + F5 + F6 + F7 + F8 + F9
=> 2 + 3 + 5 + 8 + 13 + 21 + 34 = 86.
Clearly, the last digit of the sum is 6.
Input: M = 3, N = 7
We need to find F3 + F4 + F5 + F6 + F7
=> 2 + 3 + 5 + 8 + 13 = 31.
Clearly, the last digit of the sum is 1.
Naive Approach: The naive approach for this problem is to one by one find the sum of all Kth Fibonacci Numbers where K lies in the range [M, N] and return the last digit of the sum in the end. The time complexity for this approach is O(N) and this method fails for higher-ordered values of N.
Efficient Approach: An efficient approach for this problem is to use the concept of Pisano Period.
- The idea is to calculate the sum of (M – 1) and N Fibonacci numbers respectively, and subtracting the last digit of the computed values.
- This is because the last digit of the sum of all the Kth Fibonacci numbers such that K lies in the range [M, N] is equal to the difference of the last digits of the sum of all the Kth Fibonacci numbers in the range [0, N] and the sum of all the Kth Fibonacci numbers in the range [0, M – 1].
- These values can respectively be calculated by the concept of the Pisano period in a very short time.
- Let’s understand how the Pisano period works. The following table illustrates the first 10 Fibonacci numbers along with its values obtained when modulo 2 is performed on the numbers.
i 0 1 2 3 4 5 6 7 8 9 10 Fi 0 1 1 2 3 5 8 13 21 34 55 Fi mod 2 0 1 1 0 1 1 0 1 1 0 10
- Clearly, the Pisano period for (Fi mod 2) is 3 since 011 repeat itself and length(011) = 3.
- Now, lets observe the following identity:
7 = 2 * 3 + 1
Dividend = (Quotient × Divisor) + Remainder
=> F7 mod 2 = F1 mod 2 = 1.
- Therefore, instead of calculating the last digit of the sum of all numbers in the range [0, N], we simply calculate the sum until the remainder given that the Pisano period for Fi mod 10 is 60.
Below is the implementation of the above approach:
Time Complexity: O(1), because this code runs almost 60 times for any input number.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Count numbers divisible by K in a range with Fibonacci digit sum for Q queries
- Nth Term of a Fibonacci Series of Primes formed by concatenating pairs of Primes in a given range
- Numbers with a Fibonacci difference between Sum of digits at even and odd positions in a given range
- Check if sum of Fibonacci elements in an Array is a Fibonacci number or not
- Sum of Fibonacci Numbers in a range
- Sum of all Non-Fibonacci numbers in a range for Q queries
- Count Fibonacci numbers in given range in O(Log n) time and O(1) space
- Check if a M-th fibonacci number divides N-th fibonacci number
- Sum of nth terms of Modified Fibonacci series made by every pair of two arrays
- Array range queries to count the number of Fibonacci numbers with updates
- Sum of range in a series of first odd then even natural numbers
- Find n terms of Fibonacci type series with given first two terms
- Queries for the count of even digit sum elements in the given range using Segment Tree.
- Pair of fibonacci numbers with a given sum and minimum absolute difference
- Count of Fibonacci pairs with sum N in range 0 to N
- Program to find last two digits of Nth Fibonacci number
- n'th multiple of a number in Fibonacci Series
- C/C++ Program for nth multiple of a number in Fibonacci Series
- Factorial of each element in Fibonacci series
- Print Fibonacci Series in reverse order
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.