This repository is for sharing programming assignments of the "Algorithmic Toolbox" course of coursera. Any enhancements / suggestions /additions are purely welcome! Learning purpose only :)
- FibonacciHuge.java : To compute Fn modulo m, where n may be really huge and Fn is the nth Fibonacci term.
- FibonacciLastDigit.java : To find the last digit of any nth Fibonacci term specifically efficient for the large values of n
- FibonacciPartialSumLastDigit.java : To find the last digit of partial sum of Fibonacci numbers, i.e, given m and n, find last digit of sum of m to n th Fibonacci numbers (F(m)+F(m+1)+F(m+2)+...F(n))
- FibonacciSumLastDigit.java : To find the last digit of the sum of n Fibonacci Numbers.
- FibonacciSumOfSquaresLastDigit.java : To find the last digit of sum of squares of n Fibonacci terms.
- GCD.java : To find GCD of 2 numbers using Euclid's Lemma.