Mod

可用

Returns the remainder when dividing the first argument by the second.

形式

Mod[m, n]

Mod[m, n, d]

验证过的示例Mod[10, 3] → 1 Mod[7, 4] → 3 Mod[15, 5] → 0 Mod[8, 3] → 2 Mod[-1, 3] → 2 Mod[-5, 3] → 1 Mod[10, -3] → -2 Mod[7.5, 2] → 1.5 Mod[0, 5] → 0 Mod[7 + 3 I, 2] → -1 - I

在 Qurak 上运行搜索参考

用于

Efficiently specify large numbers of spheres - 1 步
Proportional derivative controller - 3 步
Sampling events - 3 步
Simulate a bouncing ball - 4 步
DC-to-DC buck converter - 5 步
Poincare sections - 5 步

主题

Additive Number Theory - Arithmetic Functions »
Conditionals - Mathematical Function Conditionals »
Cryptographic Number Theory - Key Generation
Differential Equations With Events - Events
Integer Functions - Division-Related Functions
Mathematical Functions - Integer Functions »

相关

PowerMod Quotient QuotientRemainder Divisible CoprimeQ ModularInverse FractionalPart PolynomialMod PolynomialRemainder PolynomialQuotientRemainder Xor Modulus

全部 6300 个函数 · 从 MCP 客户端使用