 |
SOLUTIONS
|
-
Functions
- BellB
- BernoulliB
- Binomial
- BitAnd
- BitLength
- BitOr
- BitSet
- BitShiftLeft
- BitXor
- CatalanNumber
- CoprimeQ
- DigitCount
- Divisible
- Divisors
- EulerE
- EvenQ
- Factorial
- FactorInteger
- Fibonacci
- FindSequenceFunction
- FrobeniusNumber
- FrobeniusSolve
- FromDigits
- GCD
- HarmonicNumber
- IntegerDigits
- IntegerExponent
- IntegerLength
- IntegerPartitions
- LCM
- LucasL
- MatrixExp
- Mod
- Multinomial
- OddQ
- PartitionsP
- PowerMod
- PrimeQ
- Quotient
- QuotientRemainder
- RSolve
- StirlingS1
- Sum
- Related Guides
- Tutorials
Integer Functions
Mathematica 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
Combinatorial Functions »
Factorial(!) ▪ Binomial ▪ Multinomial ▪ CatalanNumber ▪ StirlingS1 ▪ PartitionsP ▪ BellB ▪ FrobeniusNumber ▪ ...
Recurrence and Sum Functions »
Fibonacci ▪ LucasL ▪ HarmonicNumber ▪ BernoulliB ▪ EulerE ▪ MatrixExp ▪ ...
Integer Decompositions
FactorInteger ▪ Divisors ▪ IntegerPartitions ▪ IntegerDigits ▪ FrobeniusSolve
Digit-Related Functions »
IntegerDigits ▪ FromDigits ▪ IntegerLength ▪ DigitCount ▪ IntegerExponent ▪ ...
Bitwise Functions »
BitAnd ▪ BitOr ▪ BitXor ▪ BitLength ▪ BitShiftLeft ▪ BitSet ▪ ...
RSolve — solve integer recurrences
Sum — find sums of integer functions
FindSequenceFunction — find functional forms from sequences
