A NPM mathematics library for CP
- Seive
- Power with Mod
- Get Divisor in sqrt(n)
- Matrix Multiplication, Addition and Exponentation
- Finding nth Fibonacci in log(n)
- Karatsuba Multiplication
- Extended Euclidean Algorithm
- Diophantine Equation(Initial Solution)
- Euler Totient
- Zfunction
- Stein's GCD
- Sigmoid
- Softmax
- Tanh
- ReLU
- Leaky ReLU
- nCr using Fermat's theorem
- PollardRho Factorization
- Dixon Factorization
- Rencontres Number (Counting partial derangements)
- Leornado Number
- Dyck Path(A staircase walk in matrix) Count
- Hosoya's Traingle
- Betrothed numbers
- Frugal Number
- Blum Integer
- Lemoine’s Conjecture
- Aliquot sum
- Fermat’s Last Theorem
- K-Jagged Number
- Euler’s Four Square Identity
- ...more to come
https://progwithme.blogspot.com/
- Fork the repository.
- Clone it to your machine.
We really appreciate the keen interest and the overall work culture we create by working together as a team with various unique experiences and minds culminated into a single project. This is only possible if we respect each other.
Kindly go through our Code of Conduct to take a moment and familiarise with the spirit of opensource.
- Kindly follow the Pull Request template provided.
For more details kindly go through our Contributing Guidelines.
Thanks goes to these wonderful people (emoji key):
prskid1000 💻 |
Athi223 💻 |
sakshidhamne 💻 |
This project follows the all-contributors specification. Contributions of any kind welcome!