AngouriMath

Navigation

← Back to list of members

#ctor​(AngouriMath.​Entity)

 Method (no overloads)

Summary

The prime factorisation of a positive integer, factorization(n): the finitely
supported map from each prime p to its exponent v_p(n) in n, which
is mathlib's Nat.factorization. factorization(360) is
2 ↦ 3, 3 ↦ 2, 5 ↦ 1, and factorization(1) the empty map.

Remarks

By the fundamental theorem of arithmetic a positive integer is its exponent vector, and
multiplying integers adds the vectors; so the factorisation is that map, with
primefactors(n) its support and valuation(n, p) its value at p, and
product(p ^ valuation(n, p), p in primefactors(n)) = n.
A node of its own, and not the product 2^3 * 3^2 * 5, which evaluates to the
number it was meant to explain; nor a number, so it does not equal n. Defined on
the positive integers, and NaN at any other number, as primenu is: 0 has no
factorisation, and a negative integer is -1 times one, which the map cannot write.
Left as written for an expression, and for an integer with a factor neither proven prime
nor split, whose Factors is then null.
https://github.com/asc-community/AngouriMath/issues/2449

























Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 6003 pages online