AngouriMath
Navigation
#ctor(AngouriMath.Entity)
Method (no overloads)
Summary
The prime factorisation of a positive integer, factorization(n) : the finitely
supported map from each primep to its exponent v_p(n) in n , which
is mathlib'sNat.factorization . factorization(360) is
2 ↦ 3, 3 ↦ 2, 5 ↦ 1 , and factorization(1) the empty map.
supported map from each prime
is mathlib's
Remarks
multiplying integers adds the vectors; so the factorisation is that map, with
number it was meant to explain; nor a number, so it does not equal
the positive integers, and
factorisation, and a negative integer is
Left as written for an expression, and for an integer with a factor neither proven prime
nor split, whose Factors is then
https://github.com/asc-community/AngouriMath/issues/2449
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6003 pages online