Modulo (mathematics)

模运算起源于卡尔·弗里德里希·高斯的《算术研究》一书,用于描述两个数在除以某个数后余数相等的情况。随着时间的推移,模运算的概念在不同领域得到了广泛应用,包括计算机科学中的取模操作、结构理论和模除等。它表达了一种等价关系,即在特定条件下,两个对象可以视为相同。在计算中,模运算常用于处理整数或实数的余数问题。模运算也在抽象代数结构和编程中有着重要的角色。
摘要由CSDN通过智能技术生成

In mathematics, the term modulo (“with respect to a modulus of”, the Latin ablative of modulus which itself means “a small measure”) is often used to assert that two distinct mathematical objects can be regarded as equivalent–if their difference is accounted for by an additional factor. It was initially introduced into mathematics in the context of modular arithmetic by Carl Friedrich Gauss in 1801. Since then, the term has gained many meanings–some exact and some imprecise (such as equating “modulo” with “except for”). For the most part, the term often occurs in statements of the form :

A is the same as B modulo C

which means

A and B are the same–except for differences accounted for or explained by C

1 History


Modulo is a mathematical jargon that was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801. Given the integers a , b , n a, b, n a,b,n, the expression “ a ≡ b   ( m o d   n ) a ≡ b\ (mod\ n) ab (mod n)”, pronounced “ a a a is congruent to b b b modulo n n n”, means that a − b a - b ab is an integer multiple of n n n, or equivalently, a , b a, b a,b both share the same remainder when divided by n n n. it is the Latin ablative of modulus, which itself means “a small measure”.

The term has gained many meaning over the years–some exact and some imprecise. The most general precise definition is simply in terms of an equivalence relation R R R, where a a a is equivalent (or congruent) to b b b modulo R R R if a R b aRb aRb. More informally, the term is found in statements of the form:

A is the same as B modulo C

which means

A and B are the same–except for differences accounted for or explained by C.

2 Usage


2.1 Original use


Gauss originally intended to use “modulo” as follows: given the integers a , b , n a, b, n a,b,n, the expression a ≡ b   ( m o d   n ) a ≡ b\ (mod\ n) ab (mod n) (pronounced " a a a is congruent to b b b modulo n n n) means that a − b a - b ab is an integer multiple of n n n, or equivalently, a , b a, b a,b leave the same remainder when divided by n n n. For example:

13 is congruent to 63 modulo 10

means that

13 - 63 is a multiple of 10 (equiv., 13 and 63 differ by a multiple of 10).

2.2 Computing


In computing and computer science, the term can be used in several ways:

  • In computing, it is typically the modulo operation: given two numbers (either integer or real), a , n a, n a,n, a a a modulo n n n is the remainder of the numerical division of a a a by n n n, under certain constraints.
  • In category theory as applied to functional programming, “operating modulo” is special jargon which refers to mapping a functor to a category by highlighting or defining remainders.

2.3 Structures


2.4 Modding out


3 See also


4 References


5 External links

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值