AngouriMath
Primes
Field
Summary
Small primes to reduce modulo. Berlekamp's splitting loop runs over the whole
field, so the cost grows with the prime and there is no reason to reach for a
large one: a prime is only unusable when it divides the leading coefficient or
makes the polynomial repeat a factor, and both are rare.
field, so the cost grows with the prime and there is no reason to reach for a
large one: a prime is only unusable when it divides the leading coefficient or
makes the polynomial repeat a factor, and both are rare.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online