Number theory and Group theory

As explained in the Factorial page we can use vectors to operate with large integers in any base. Apart from the code regarding the factorial, using the sum and the mproduct of vectors we also provide the sequence of Fibonacci up to any large integer and the powers nⁿ from n=1 until any n. Both codes can be used in any base. First we provide the code for large sequences of Fibonacci. The Fibonacci sequence is computed recursively using the recurrence relation a_n+2 = a_n+1 + a_n.

We can also compute the sequence formed by series of powers until any large n. Again, it can be computed in any base. The code is the following: