Open manrajgrover opened 7 years ago
Working on this one
is this issue still available? can i work on this?
@manrajgrover I would like to do Euler's Totient Function
@manrajgrover I would like to work on the Fibonacci algorithm!
I will do Find Divisors
I would like to work on check if the number is a prime. Thank you!
I will do Fisher Yates!
I will do Inverse of first 'n' numbers
I will do Mod Inverse, Mod Inverse using Fermet, and Fisher Yates
I will implement Leonardo Numbers Sequence
I will work on the inverse of first n numbers and check if a number is prime.
I will do the Combination Modular and Euler's Inverse.
I would like to do Fibonacci and check if prime
is this issue closed? or which functions are missing?
i can do find divisors and square root by newton's method
Is this still open. I would like to contribute if anything not done yet.
I want to contribute.
I also want to contribute.
Is there any issue which requires contribution?? I want to contribute.
I want to contribute. Is there anything I can work on ?
If any of the above tasks are left to solve , kindle let me know!__
Hello, is any of the tasks available?
Hello , Is there any task available now??
Math algorithms to be implemented are: