Added flux node and rudimentary explanations. |
cleanup, style, links |
||
| Line 13: | Line 13: | ||
|}} | |}} | ||
The | The '''Least Common Multiple''' node finds the [https://en.wikipedia.org/wiki/Least_common_multiple least common multiple] of two numbers, or the smallest positive integer that is divisible by both inputs. | ||
== Inputs == | == Inputs == | ||
=== A (Pseudo-generic) === | === A (Pseudo-generic) === | ||
The first number. | |||
The first | |||
=== B (Pseudo-generic) === | === B (Pseudo-generic) === | ||
The second number. | |||
The second | |||
== Outputs == | == Outputs == | ||
=== * (Pseudo-generic) === | === * (Pseudo-generic) === | ||
The least common multiple of <code>A</code> and <code>B</code>. | |||
== See Also == | |||
* [[ProtoFlux:Greatest Common Divisor]] | |||
[[Category:ProtoFlux:Math]] | [[Category:ProtoFlux:Math]] | ||
Latest revision as of 18:37, 7 July 2024
LeastCommonMultiple
Math
The Least Common Multiple node finds the least common multiple of two numbers, or the smallest positive integer that is divisible by both inputs.
Inputs
A (Pseudo-generic)
The first number.
B (Pseudo-generic)
The second number.
Outputs
* (Pseudo-generic)
The least common multiple of A and B.