Wolfram Language & System 10.4 (2016)|Legacy Documentation

This is documentation for an earlier version of the Wolfram Language.View current documentation (Version 11.2)

Integer Functions

The Wolfram Language contains hundreds of original algorithms for computing integer functions involving integers of any size.

ReferenceReference

Division-Related Functions

Mod  ▪  PowerMod  ▪  Quotient  ▪  QuotientRemainder  ▪  GCD  ▪  LCM  ▪  Divisible  ▪  CoprimeQ  ▪  EvenQ  ▪  OddQ  ▪  PrimeQ  ▪  CompositeQ

Combinatorial Functions »

Factorial (!)  ▪  Binomial  ▪  Multinomial  ▪  CatalanNumber  ▪  StirlingS1  ▪  PartitionsP  ▪  BellB  ▪  FrobeniusNumber  ▪  PolygonalNumber  ▪  ...

Recurrence and Sum Functions »

Fibonacci  ▪  LucasL  ▪  HarmonicNumber  ▪  BernoulliB  ▪  EulerE  ▪  MatrixExp  ▪  ...

Integer Decompositions

FactorInteger  ▪  Divisors  ▪  IntegerPartitions  ▪  IntegerDigits  ▪  FrobeniusSolve  ▪  NumberDecompose  ▪  FareySequence

Digit-Related Functions »

IntegerDigits  ▪  FromDigits  ▪  IntegerLength  ▪  DigitCount  ▪  IntegerExponent  ▪  IntegerReverse  ▪  ...

Bitwise Functions »

BitAnd  ▪  BitOr  ▪  BitXor  ▪  BitLength  ▪  BitShiftLeft  ▪  BitSet  ▪  ...

Digit-Based Substitution System Functions

ThueMorse  ▪  RudinShapiro

RSolve solve integer recurrences

Sum find sums of integer functions

FindSequenceFunction find functional forms from sequences