[ADD] Number_theory_functions : Chinese Remainder Theorem

[Mayank9207]

I want to work over this issue

[imsuraj675]

@Mayank9207 What type of function you will implement? Explain with example

[Mayank9207]

basically i will implement a function to solve system of congruences providing a set of mod values (mods are co prime) and their corresponding remainders.
Multiply all modulo together to get N.
For each congruence compute Ni=N/ni
Then we will compute modular inverse of Ni modulo ni
Add the contribution aiNiMi to the solution
finally reduce the sum of these contributions modulo N
It has a TC of O(logk*N) where k is the number of congruence and N is the product of all moduli

[imsuraj675]

@Mayank9207 Go ahead, make sure to add a readme file too, as it's a completely unfamiliar topic. Also make sure to add example, and show that in which case this function will be used