|
SOLUTIONS
|
-
函数
- AlgebraicNumberNorm
- BellB
- CarmichaelLambda
- ChineseRemainder
- CoprimeQ
- DedekindEta
- DigitCount
- DirichletL
- Divisible
- Divisors
- DivisorSigma
- DivisorSum
- EllipticTheta
- EulerPhi
- ExtendedGCD
- FactorInteger
- FrobeniusNumber
- FromDigits
- GCD
- IntegerDigits
- IntegerExponent
- IntegerPartitions
- JacobiSymbol
- KroneckerSymbol
- LCM
- LerchPhi
- Log2
- LogIntegral
- MangoldtLambda
- Mod
- MoebiusMu
- MultiplicativeOrder
- NextPrime
- NumberFieldDiscriminant
- PartitionsP
- PartitionsQ
- PowerMod
- PowerModList
- PowersRepresentations
- Prime
- PrimeNu
- PrimeOmega
- PrimePi
- PrimePowerQ
- PrimeQ
- PrimitiveRoot
- RamanujanTau
- RiemannSiegelZ
- SquareFreeQ
- SquaresR
- StirlingS1
- StirlingS2
- Zeta
- ZetaZero
- 相关指南
- 教程
数论函数
Mathematica 包含了世界上最大的数论函数集合,许多基于专门开发的算法.
参考资料参考资料
素数和它的广义函数 »
Prime — 第 n
个素数
PrimeQ — 测试素数
NextPrime ▪ PrimePi ▪ PrimeOmega ▪ LogIntegral ▪ Zeta ▪ ZetaZero ▪ ...
整数因式分解 »
FactorInteger — 求出一个整数的因子
SquareFreeQ ▪ PrimePowerQ ▪ ...
整除
GCD ▪ LCM ▪ Divisible ▪ CoprimeQ ▪ ExtendedGCD
EulerPhi ▪ MoebiusMu ▪ JacobiSymbol ▪ KroneckerSymbol
同余
Mod ▪ PowerMod ▪ MultiplicativeOrder ▪ PrimitiveRoot ▪ ChineseRemainder ▪ PowerModList ▪ CarmichaelLambda
除数 »
Divisors ▪ DivisorSigma ▪ DivisorSum ▪ DedekindEta ▪ EllipticTheta ▪ ...
划分 »
IntegerPartitions ▪ PartitionsP ▪ StirlingS1 ▪ StirlingS2 ▪ FrobeniusNumber ▪ ![]()
表示幂的和
SquaresR ▪ PowersRepresentations ▪ EllipticTheta
数字表示 »
IntegerDigits ▪ FromDigits ▪ DigitCount ▪ IntegerExponent ▪ Log2 ▪ ...
乘法数论 »
MoebiusMu ▪ EulerPhi ▪ DivisorSigma ▪ MangoldtLambda ▪ PrimeNu ▪ ...
解析数论 »
Zeta ▪ ZetaZero ▪ RiemannSiegelZ ▪ LerchPhi ▪ DirichletL ▪ RamanujanTau ▪ ...
加法数论 »
PartitionsP ▪ PartitionsQ ▪ BellB ▪ SquaresR ▪ ...
