Skip to content

Number Theory

15 built-in function(s) in this category.

  • ContinuedFraction — ContinuedFraction[x, n] (Stable)
  • EulerPhi — EulerPhi[n] gives the Euler totient function phi(n). (Stable)
  • ExtendedGCD — ExtendedGCD[n1, n2, ...] (Stable)
  • FactorInteger — FactorInteger[n] gives a list of the prime factors of the integer n, together with their exponents. (Stable)
  • FromContinuedFraction — FromContinuedFraction[{a1, a2, ..., an}] (Stable)
  • GCD — GCD[n1, n2, ...] (Stable)
  • LCM — LCM[n1, n2, ...] (Stable)
  • MultiplicativeOrder — MultiplicativeOrder[k, n] (Stable)
  • NextPrime — NextPrime[x] gives the next prime after x. (Stable)
  • PowerMod — PowerMod[a, b, m] gives a^b mod m. (Stable)
  • PrimePi — PrimePi[x] gives the number of primes less than or equal to x. (Stable)
  • PrimeQ — PrimeQ[n] (Stable)
  • PrimitiveRoot — PrimitiveRoot[n] (Stable)
  • PrimitiveRootList — PrimitiveRootList[n] (Stable)
  • SquareFreeQ — SquareFreeQ[expr] (Stable)