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クライアントから使う