Reference · stzNumber
LeastCommonMultiple()
The least common multiple with the given number.
also written: LCM
Basic examples (2)
Softanza
? Q(25).LCM(42) ? @@( Q(1050).PrimeFactorsXT() ) + NL ? @@( Q(1050).FactorsXT() )
Output
1050 [ [ 2, 525 ], [ 3, 350 ], [ 5, 210 ], [ 7, 150 ] ] [ [ 1, 1050 ], [ 2, 525 ], [ 3, 350 ], [ 5, 210 ], [ 6, 175 ], [ 7, 150 ], [ 10, 105 ], [ 14, 75 ], [ 15, 70 ], [ 21, 50 ], [ 25, 42 ], [ 30, 35 ], [ 35, 30 ], [ 42, 25 ], [ 50, 21 ], [ 70, 15 ], [ 75, 14 ], [ 105, 10 ], [ 150, 7 ], [ 175, 6 ], [ 210, 5 ], [ 350, 3 ], [ 525, 2 ], [ 1050, 1 ] ]
run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from 32_lcm.ring(opens in a new tab)
Softanza
# 5! is 120 ? Q(5).Factorial() # GCD(12,18) is 6 ? Q(12).GCD(18) # LCM(4,6) is 12 ? Q(4).LCM(6) # Fibonacci(10) is 55 ? Q(10).Fibonacci()
Output
120 6 12 55
run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from 00_number_narrated.ring(opens in a new tab)
Scope (1)
Softanza
# gcd works ? (new stzNumber(12)).GCD(18) # ...and its full name agrees ? (new stzNumber(12)).GreatestCommonDividor(18) # the Q form works, which it never could ? (new stzNumber(12)).GreatestCommonDividorQ(18).Content() # lcm of two numbers works ? (new stzNumber(4)).LCM(6) # lcm of a LIST works ? (new stzNumber(4)).LCM([6, 8]) # ...and of numbers written as strings ? (new stzNumber(4)).LCM(["6", "8"]) # ...which is what stzListOfNumbers depends on ? (new stzListOfNumbers([4, 6, 8])).LeastCommonMultiple()
Output
6 6 6 12 24 24 24
run on 2026-10-02 04:23 inside the library at commit 0e72e2e2c; taken from number_dead_calls_narrated.ring(opens in a new tab)
The extensions of this method
Each extension, and whether it exists for this method; an extension that exists combines with the others (FindSTCS).
Extension
Exists
What it adds · The names
Q
yes
does what the method does, then returns the object, so the call can be chained · LeastCommonMultipleQ
QQ
no
chains on the next, more specific type of object (the Q ladder)
QQQ
no
chains on the most specific type of object (the Q ladder)
QRT
no
returns the result as an object of the requested type
CS
no
takes a case-sensitivity flag
ST
no
takes the position to start from (StartingAt)
IB
no
takes bounds that are included (IncludingBounds)
XT
no
the extended form: more parameters than the base method
XTT
no
yet another extension: a further extended form, after XT
Z
no
includes the position in what it returns
ZZ
no
returns positions as sections, [start, end]
W
no
selects by a condition
WF
no
selects by a condition, with the expressive keywords (@NextItem, @PreviousItem...)
D
no
takes a direction, forward or backward (Directional)
F
no
takes a function (the condition or the update is given as a function); the forms document also uses F for the future form, which defers the action
Many
no
works on a collection of items instead of one (the plural form)
Except
no
takes exceptions, what to leave out (the exceptional form)
U
no
returns the result without duplication
Every example is a test file of the library, run inside the library for this page; only those whose output kept every promise their file wrote are shown.
See also
- The class stzNumber
- The area's reference: Numeric & optimization
- The other methods in these examples: stzListOfNumbers.LeastCommonMultiple · stzNumber.Factorial · stzNumber.Factors · stzNumber.Fibonacci · stzNumber.GreatestCommonDividor · stzNumber.PrimeFactors

