Find the greatest common factor (GCF/GCD) of number sets via Euclidean algorithm with steps. Reduce 48:180 to 4:15 correctly — free, local, no signup.
Find LCM of number sets for scheduling cycles and fraction denominators. Sync 4-day and 6-day rotas every 12 days — free, local, no signup.
Simplify any two-number ratio to lowest terms via GCD — paint mixes, screen sizes, shares. Reduce 150:225 to 2:3 in one pass — free, runs locally.
Compute nCr combinations and nPr permutations with factorial steps shown. Count 5-card poker hands (2,598,960) correctly — free, local, no signup.
Share secrets securely via self-decrypting note links — AES ciphertext in the URL fragment, key in the link query. Send passwords without trusting inboxes — local crypto-js AES, free, no signup.
Compute NPS from promoter/passive/detractor counts — loyalty in one number. Score above 50 for world-class loyalty — free, local, no signup.
12 — Euclidean remainders (180→48→36→12) find it without factoring both fully. The steps show each remainder.
Yes — GCF folds pairwise across sets. Three-number homework works the same way.
GCF divides both (for simplifying); LCM is a multiple of both (for combining). Product equals GCF×LCM — verify with it.
No — math runs locally in your browser. Numbers never leave your device.
Least Common Multiple Calculator
Find LCM of number sets for scheduling cycles and fraction denominators. Sync 4-day and 6-day rotas every 12 days — free, local, no signup.
Prime Factorization Calculator
Break any integer into prime factors with factor trees — 60 = 2²×3×5 shown stepwise. Ace number theory homework — free, local, no signup.
Last updated October 2026