i think you're misreading the [docs](http://fedeomoto.github.io/bignum/#mod,Int,) for bignum, in that it does provide infix overloads, so `x =(x*x + c) mod n` syntax works just fine
- BigNum and BigInt timings on the Pollard Rho algorithm DougT
- BigNum and BigInt timings on the Pollard Rho algorithm planetis
- BigNum and BigInt timings on the Pollard Rho algorit... DougT
- BigNum and BigInt timings on the Pollard Rho alg... Hlaaftana
- BigNum and BigInt timings on the Pollard Rho... dlesnoff
- BigNum and BigInt timings on the Pollar... DougT
- BigNum and BigInt timings on the Po... shirleyquirk
- BigNum and BigInt timings on th... auxym
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... dlesnoff
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... DougT
- BigNum and BigInt timings on th... fsh
- BigNum and BigInt timings on th... mratsim
- BigNum and BigInt timings on th... fsh
- BigNum and BigInt timings on th... pietroppeter
- BigNum and BigInt timings on th... mratsim
