AngouriMath
Navigation
Factorization(PeterO.Numbers.EInteger)
Method (no overloads)
Summary
The prime factors of a positive whole number with their multiplicities, smallest first,
ornull where trial division up to LargestTrialDivisor leaves a part it cannot call prime: every number up to its square is factorised, and
a larger one is whenever what is left after the small primes is below that square.
https://github.com/asc-community/AngouriMath/issues/2182
or
a larger one is whenever what is left after the small primes is below that square.
https://github.com/asc-community/AngouriMath/issues/2182
Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5629 pages online