Release 0.4 Week 2

This week I chose issues in algorithms library I will work on next week and did a research about Math required to implement chosen algorithms. Of course, I am going to write efficient algorithms. These algorithms are:
Modular Multiplicative Inverse - function receives 2 integers a and m and returns smallest positive integer x such that

In simple words this means that ax - 1 is divisible by m
Modular Multiplicative Inverse using Fermets - the same problem but solved using Fermet's Small Theorem.
Fisher Yates - this is algorithm used to generate random permutations of a finite sequence.