Combinatorics (n!, nPr, nCr)
Calculate factorial (n!), permutations without repetition (nPr) and combinations (nCr) for whole numbers.
Open calculatorGCD and LCM
Computes GCD using Euclid’s algorithm on absolute values, and LCM as |a × b| / GCD(a, b).
Greatest common divisor (GCD)
6
Least common multiple (LCM)
36
The link may contain your inputs. Anyone receiving it can read them.
For 12 and 18, GCD = 6 and LCM = 36.
Recent on this calculator
Full historyStored strictly in this browser’s local storage. Clicking an entry reloads the parameters into the calculator URL; sharing the link exposes those inputs to the recipient.
No saved calculations yet. Use any calculator and your recent results will appear here.
Educational estimate only. Not medical, tax, legal or financial advice.