Proofing Modulus Operator Associativity

In summary, the conversation discusses an operator defined as a[·]b = (a·b) mod 6, and the question of whether it is associative. The attempt at a solution shows that it is indeed associative, using the fact that a·b (mod c) = a (mod c) · b (mod c). The conversation also mentions a proof for this identity, and the idea of using it to prove the associativity of the operator.
  • #1
Bohrok
867
0

Homework Statement



We have a problem that basically defines an operator [·] (it's a dot inside a box) as a[·]b = (a·b) mod 6 where a, b ε ℕ. Is this operator associative?

Homework Equations



a[·]b = (a·b) mod 6

I tried looking for any modulus identities online but didn't have any luck besides this one:
(a·b) mod c = [(a mod c) · (b mod c)] mod c

but I couldn't find a proof for it and I wasn't sure how I'd prove it either.
While doing my proof, I also found that (a mod b) mod b = a mod b seems to be true but I couldn't prove that either.

The Attempt at a Solution



Is (a[·]b)[·]c = a[·](b[·]c) true?


(a[·]b)[·]c

= {[(a·b) mod 6]·c} mod 6

= ({[(a·b) mod 6] mod 6}·(c mod 6)) mod 6 (here using (a·b) mod c = [(a mod c) · (b mod c)] mod c)

= {[(a·b) mod 6]·(c mod 6)} mod 6 (here using (a mod b) mod b = a mod b)

= [(a·b)·c] mod 6

= [a·(b·c)] mod 6

= {(a mod 6)·[(b·c) mod 6]} mod 6

= ((a mod 6)·{[(b·c) mod 6] mod 6} mod 6 (here using (a mod b) mod b = a mod b)

= {a·[(b·c) mod 6]} mod 6 (here using (a·b) mod c = [(a mod c) · (b mod c)] mod c)

= a[·](b[·]c)


If I could prove those two equations I used in the proof, would that be okay? Is there a better way of proving this?

Might be an error or two; I've got to go now.
 
Physics news on Phys.org
  • #2
It is not difficult to show that

[tex]a\cdot b( mod c)=a(mod c)\cdot b(mod c)[/tex]

Can you show this?

If yes, then the associativity of the operation [.] follows immediately.

That is:
[tex] a[\cdot](b[\cdot]c)=a[\cdot](bcmod6)=a(bcmod6)mod6=(amod6)(bcmod6)=(amod6)(bmod6)(cmod6)[/tex]

all you need to do now is use the fact that the last expression is associative and work your way back.
 

FAQ: Proofing Modulus Operator Associativity

What is the proofing modulus operator associativity?

The proofing modulus operator associativity is a mathematical concept that states that the order in which the modulus operator (%) is applied to a set of numbers does not affect the result.

Why is it important to prove modulus operator associativity?

Proving modulus operator associativity is important because it ensures that the result of applying the modulus operator to a set of numbers is consistent and does not depend on the order in which the operator is applied. This allows for accurate and reliable mathematical calculations.

How is modulus operator associativity proven?

To prove modulus operator associativity, we must show that for any three numbers a, b, and c, the following equation holds true: (a % b) % c = a % (b % c). This can be done using algebraic manipulation and the properties of the modulus operator.

Are there any exceptions to modulus operator associativity?

No, there are no exceptions to modulus operator associativity. This concept holds true for all real numbers and is a fundamental property of the modulus operator.

What are the practical applications of proving modulus operator associativity?

Proving modulus operator associativity has practical applications in various fields such as computer programming, cryptography, and engineering. It allows for efficient and accurate calculations involving remainders and can help in solving complex mathematical problems.

Similar threads

Back
Top