Convergent returns the nth convergence of whichever series you pass in a function for.

DigitsToInt converts a slice of digits to an int.

DigitSum returns the sum of the digits in the number.

Divisors returns a sorted list of all positive divisors of n.

E returns the nth number (1-based) in the convergent series of e.

EqualIntSlice returns true if the two slices have identical contents.

Factors returns a sorted list of the unique prime factors of n (excluding n).

FactorsCounted returns counts of how many times each factor divides into n.

GCD returns the greatest common divisor of a and b.

GCDBigInt returns the greatest common divisor of a and b.

Harshad returns true if n is divisible by the sum of its digits.

IntToDigits converts an int into a slice of its component digits.

IsCube returns true if n is a cube number.

IsInt returns true if n is an integer.

IsSquare returns true if n is a square number.

LCM returns the least common multiple of a and b.

LCMBigInt returns the least common multiple of a and b.

MaxBigInt returns the largest of a or b.

MinBigInt returns the smallest of a or b.

MulFraction returns the product of the two fractions, still in fraction form.

MulFractionBigInt returns the product of the two fractions, still in fraction form.

NextSquare returns the next highest square and its square root.

PascalTriangle returns a triangle of the max depth specified.

ReduceFraction returns the lowest that n and d reduce to.

ReduceFractionBigInt returns the lowest that n and d reduce to.

Reverse reverses the order of the elements in a slice.

Sqrt2 returns the nth number (1-based) in the convergent series of root 2.

SquareFree returns true if no square of a prime divides n.

SumFraction returns the sum of the two fractions, still in fraction form.

SumFractionBigInt returns the sum of the two fractions, still in fraction form.

Totient returns how many numbers k are relatively prime to n.