AngouriMath
Congruence(AngouriMath.Entity,AngouriMath.Entity.Number.Integer,AngouriMath.Entity.Variable)
Method (no overloads)
Summary
The solutions of difference = 0 (mod modulus) in x , where
the difference is a polynomial in it with whole coefficients: solved outright when
linear, and by trying every residue when not and the modulus is small.
the difference is a polynomial in it with whole coefficients: solved outright when
linear, and by trying every residue when not and the modulus is small.
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 4378 pages online