设 a , b , c a,b,c a,b,c为任意整数， n n n为某正整数。为了在表示上更加简单，我们定义：
[ a ] = { x ∣ x ≡ a ( mod n ) } [a] = \{x|x \equiv a (\operatorname{mod} n)\} [a]={x∣x≡a(modn)}
则定义模 n n n加法如下：
[ a ] ⊕ [ b ] = [ a + b ] [a] \oplus [b] =[a+b] [a]⊕[b]=[a+b]
于是利用加法的结合律可得：
(
a
⊕
b
)
⊕
c
=
(
[
a
]
⊕
[
b
]
)
⊕
[
c
]
=
[
a
+
b
]
⊕
c
=
[
(
a
+
b
)
+
c
]
=
[
a
+
(
b
+
c
)
]
=
[
a
]
⊕
[
b
+
c
]
=
[
a
]
⊕
(
[
b
]
⊕
[
c
]
)
\begin{aligned} (a\oplus b) \oplus c &= ([a] \oplus [b]) \oplus [c] \\ &= [a+b] \oplus c \\ &= [(a+b)+c] \\ &= [a+(b+c)] \\ &= [a]\oplus[b+c]\\ &=[a]\oplus([b]\oplus[c]) \end{aligned}
(a⊕b)⊕c=([a]⊕[b])⊕[c]=[a+b]⊕c=[(a+b)+c]=[a+(b+c)]=[a]⊕[b+c]=[a]⊕([b]⊕[c])
从而证明了模
n
n
n加法的结合律.
Q.E.D
参考：https://faculty.atu.edu/mfinan/4033/absalg11.pdf
扫一扫
47
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
