AngouriMath
RepresentRational(AngouriMath.Entity.Number.Rational,System.Collections.Generic.IEnumerable{AngouriMath.Entity.Number.Rational})
Method (no overloads)
Summary
If it can, it will find coefficients
[a_1, a_2, ..., a_n] such that for
given rational forms [p_1, p_2, ..., p_n]
it is true that
q = a_1 * p_1 + a_2 * p_2 + ... + a_n * p_n
[a_1, a_2, ..., a_n] such that for
given rational forms [p_1, p_2, ..., p_n]
it is true that
q = a_1 * p_1 + a_2 * p_2 + ... + a_n * p_n
Returns
The sequence of pairs coef-form or
null if it cannot find them
null if it cannot find them
Angouri © 2019-2023 · Project's repo · Site's repo · Octicons · Transparency · 1534 pages online