divide 8 are more complex to implement, but // are likely to be more efficient if necessary. table := [(1 << 4) - 1]*Nat{ // table[i] = x ^ (i+1) // newNat calls are unrolled so they are allocated on the stack. NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), NewNat(), } table[0].set(x).montgomeryRepresenta(m) for i := 1; i < len(table); i++ { table[i].montgomeryMul(table[i-1], table[0], m) } out.resetFor(m) out.limbs[0]...

pkg math, func Y0(float64) float64
pkg math, func Y1(float64) float64
pkg math, func Yn(int, float64) float64
pkg math/big, const MaxBase ideal-char
pkg math/big, func NewInt(int64) *Int
pkg math/big, func NewRat(int64, int64) *Rat
pkg math/big, method (*Int) Abs(*Int) *Int
pkg math/big, method (*Int) Add(*Int, *Int) *Int
pkg math/big, method (*Int) And(*Int, *Int) *Int
pkg math/big, method (*Int) AndNot(*Int, *Int) *Int