AngouriMath
Navigation
Factorization(AngouriMath.Entity)
Method (no overloads)
Summary
The prime factorisation of a positive integer, factorization(n) : the map from
each prime to its exponent inn , mathlib's Nat.factorization . A node of
its own, which holds the map in Factors and
is not the numbern ; NaN at any other number. For the list of pairs
alone, Factorize(AngouriMath.Entity.Number.Integer).
https://github.com/asc-community/AngouriMath/issues/2449
each prime to its exponent in
its own, which holds the map in Factors and
is not the number
alone, Factorize(AngouriMath.Entity.Number.Integer).
https://github.com/asc-community/AngouriMath/issues/2449
Example
var factorization = (Entity.PrimeFactorizationf)MathS.NumberTheory.Factorization(360).Evaled;
Console.WriteLine(factorization);
Console.WriteLine(factorization.Latexize());Prints
factorization(360)
2^{3} \cdot 3^{2} \cdot 5Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6003 pages online