GCD and LCM
Find the greatest common divisor (GCD) and least common multiple (LCM) of two integers.
Open calculatorCombinatorics (n!, nPr, nCr)
nPr = n! / (n − r)! (order matters) and nCr = n! / [r! × (n − r)!] (order does not matter), for integers 0 ≤ r ≤ n ≤ 170.
Combinations (nCr)
120
Permutations (nPr)
720
Factorial (n!)
3,628,800
The link may contain your inputs. Anyone receiving it can read them.
“10 choose 3” (10C3) equals 120. Above 170! standard 64-bit floating-point numbers overflow.
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.