-
# NUMBER THEORY
* Modular Arithmetic
* Basic Knowledge of Primes, Multiples, Divisors
* Bitwise Operations
* XOR Properties
* Euclidean Algorithm
* Sieve of Eratosthenes
* Binary Modular …
-
## Problem
I believe `modexp` (modular exponentiation) should be available as an opcode, as it seems like an important crypto primitive. It is also present in many other chains like EVM. While I ha…
-
-
Running 9 modexp test of eth test suite, the result is:
```
geth: 840+ ms
nimbus + tommath: 4s. 760+ ms
nimbus + stint: 12s, 880+ ms
```
Find a better mp-int library that can handle arbitrar…
-
## DESCRIPTION
(_Not a defect_) I would like to implement some popular mathematical algorithms in Python 3.x
## LIST OF ALGORITHMS
- Permutations and Combinations over a board of characters…
-
Hey @aaryahjolia ,
I would like to provide clear and concise explanation as well as code of topics mentioned above which are handy in solving several cp problems.
Thanks and regards,
Neha Kariya
-
in phi(n), "return amount" is indented improperly, making phi(n) = 1 for all n.
in step3(n,r) the range is set to (r,2) instead of (2,r). This means the required trial division does not happen.
…
danaj updated
5 years ago
-
I just stumbled across this project and was interested to test it out and compare performance with GMP. I am writing software to factor Mersenne numbers, and my use case deals mostly with 1 to 2 limb…
-
_From @ejmahler on June 30, 2016 22:59_
In num_integer, I see an implementation of gcd.
I would like to implement some related number theory functions: [modular exponentiation](https://en.wikipedia.…
-
We have a modular exponentiation operator. I believe that this sums it up nicely:
```
simpson | > m`x ** e % m`.expand()
airbrus | m`x.modPow(e, m)`
```
As you may have noticed, this is a mixfix ope…