// 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.number-theory Calculator
Computes number-theoretic functions: totient (φ(n)), Möbius function (μ(n)), number of divisors (d(n)), and sum of divisors (σ(n)). Euler's totient function φ(n) counts integers coprime to n — it's the key to understanding RSA security.
Inputs
A
Reference formula or conversion factor shown for context.
B
Reference formula or conversion factor shown for context.
N
Reference formula or conversion factor shown for context.
P
Reference formula or conversion factor shown for context.
Results
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.
a mod n
Sample size or count used in the calculation.
gcd(a,n)=1 (coprime)?
GCD (greatest common divisor) -- the largest integer that divides both numbers with no remainder. Used in fraction simplification and modular arithmetic.
p is prime?
Reference formula or conversion factor shown for context.
a+b, a-b, a*b
Reference formula or conversion factor shown for context.