We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 67eb4cc commit d8991a2Copy full SHA for d8991a2
README.md
@@ -7,6 +7,7 @@ https://github.com/user-attachments/assets/6ea9df84-c21d-4ac7-8089-b85673842827
7
- **Integer square root:** Exact `floor(sqrt(N))` for big integers.
8
- **Primality test:** Check if a 64-bit unsigned integer is prime
9
- **Prime factorization:** Factorize a 64-bit unsigned integer into primes
10
+- **Modular Inverse:** Compute the modular inverse of a 64-bit unsigned integer $N$ modulo $M$, i.e., find $x$ such that $N \times x \equiv 1 \pmod{M}$
11
12
## Planned Features (not implemented yet)
13
- **Count prime <= N**
0 commit comments