// multi-utility computation suite · offline · instant · precise
┌──────────────────────────┐
│ [c] calcalyst_ │
│ computation suite │
└──────────────────────────┘
// select a module to initialize
/ search↵ open firstesc close
// adsenseEMPTY_LEADER_SLOT728×90
// adsenseMOBILE_ANCHOR_SLOT320×50
// keyboard_shortcuts
/focus search
↑↓navigate module list
Enter
open first result from search
open highlighted
compute when module is open
compute when focused in a field
Escclose module · clear selection
⌫
math.greatest-common-divisor Calculator
Calculates GCD (by Euclidean algorithm) and LCM (as GCD × product / GCD) and shows the factorisation of both. The relationship LCM(a,b) = a × b / GCD(a,b) is the most efficient route to LCM without full factorisation.
Inputs
A
Count of items or occurrences.
B
Count of items or occurrences.
C
Count of items or occurrences.
Results
GCD
GCD (greatest common divisor) -- the largest integer that divides both numbers with no remainder. Used in fraction simplification and modular arithmetic.
LCM
LCM (least common multiple) -- the smallest number divisible by both inputs. Used when finding common denominators.
GCD(a,b)
GCD (greatest common divisor) -- the largest integer that divides both numbers with no remainder. Used in fraction simplification and modular arithmetic.
LCM(a,b)
LCM (least common multiple) -- the smallest number divisible by both inputs. Used when finding common denominators.
Euclidean algorithm
The selected or recommended algorithm for this problem type based on the inputs.
GCD × LCM = a × b
GCD (greatest common divisor) -- the largest integer that divides both numbers with no remainder. Used in fraction simplification and modular arithmetic.