// 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.algebra-factor-pair Calculator
Lists all factor pairs of a positive integer, identifies perfect square factors, and outputs the prime factorisation. Finding all factor pairs is the first step in many number theory problems and in simplifying radical expressions.
Inputs
A
Reference formula or conversion factor shown for context.
B
Reference formula or conversion factor shown for context.
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.
factors of a
A dimensionless multiplier applied in the calculation.
gcd
GCD (greatest common divisor) -- the largest integer that divides both numbers with no remainder. Used in fraction simplification and modular arithmetic.