本页翻译不是最新的。点击此处可查看最新英文版本。

数论

模算术运算和数列

您可以执行初等数论运算，求 LCM、GCD、模数、商和余数。您还可以求质数和特殊数列，例如调和数、伯努利数和欧拉数。

函数

全部展开

divisorsDivisors of integer or expression
factorIntegerPowerPerfect power factoring
gcdGreatest common divisor of symbolic numbers and polynomials
isPrimitiveRootDetermine which array elements are primitive roots
lcmLeast common multiple of symbolic numbers and polynomials
maxMaximum elements of symbolic input
minMinimum elements of symbolic input
modSymbolic modulus after division
powermodModular exponentiation
quoremQuotient and remainder
remRemainder after division
bernoulliBernoulli numbers and polynomials
eulerEuler numbers and polynomials
fibonacciFibonacci numbers
harmonicHarmonic function (harmonic number)
ratRational fraction approximation (continued fraction)
nextprimeNext prime number
nthprimenth prime number
prevprimePrevious prime number
eulerPhiEuler phi function
jacobiSymbolJacobi symbol