I decided to create this project to test RecyclerView, View Model and Navigation component, as well as practicing Competitive Programming in Java.
- User define a recurrence relation of their own, follow the definition in the app.
- User can define a recurrence relation with up to 100 "known" terms and coefficients with limit up to 10^9 - 1.
- Input the modulo to avoid integer overflow (1 <= m <= 10^18 - 1). The reason is mobile device has limited storage, and thus we cannot afford to show every digits on the screen.
- Input the desired term you want to calculate. This can be any integer value less than 10^18 - 1.
- Time complexity is O(m^3 log2(n)), where m is the number of terms/coefficients, while n is the n-th term.
Fibonacci sequence with first and second term = 1, we have the 30th term is 832040.
Fibonacci sequence but calculating the 100000000000000000-th (1e17-th) term.
User can easily modify the terms and coefficients.
