Multiplying in Z/mZ: Solving m=3 & m=7 Questions

  • Context: MHB 
  • Thread starter Thread starter Fernando Revilla
  • Start date Start date
Click For Summary
SUMMARY

This discussion focuses on the properties of the ring Z/mZ, specifically for m=3 and m=7. It establishes that Z/mZ is a field if and only if m is a prime number. The proof demonstrates that for prime m, there are no divisors of zero, confirming that Z/mZ is a finite integral domain and thus a field. The inverses for elements in Z/7Z are explicitly provided, showcasing the structure of the field when m=7.

PREREQUISITES
  • Understanding of modular arithmetic
  • Knowledge of finite rings and fields
  • Familiarity with prime numbers and their properties
  • Basic algebraic structures, specifically integral domains
NEXT STEPS
  • Study the properties of finite fields, particularly Z/pZ for prime p
  • Explore the concept of multiplicative inverses in modular arithmetic
  • Learn about the structure of rings and fields in abstract algebra
  • Investigate the applications of finite fields in coding theory and cryptography
USEFUL FOR

Mathematics students, educators, and anyone interested in abstract algebra, particularly those studying modular arithmetic and field theory.

Fernando Revilla
Gold Member
MHB
Messages
631
Reaction score
0
I quote a question from Yahoo! Answers

Multiply in Z\mZ question: m= 3, 7 also which m is Z/mZ a field? m=7? m=3? show some steps.?
multiply in Z\mZ
question: m= 3, 7 also which m is Z/mZ a field?
m=7?
m=3?

I have given a link to the topic there so the OP can see my response.
 
Physics news on Phys.org
I suppose you want to prove that if $m$ prime, then $\mathbb{Z}/m\mathbb{Z}$ is a field. For all $m\geq 2$ integer, we know that $\mathbb{Z}/m\mathbb{Z}=\{\bar{0},\bar{1},\ldots,\overline{m-1}\}$ is a finite, conmutative and unitary ring. But we also know that a finite integral domain is a field, so we only need to prove that if $m$ prime, there are no divisors of zero.

Suppose $\bar{k}\bar{s}=\bar{0}$, then $ks$ is multiple of $m$ or equivalently $m|ks$. If $m$ prime, $m|k$ or $m|s$ which implies $\bar{k}=\bar{0}$ or $\bar{s}=\bar{0}$.

For example, in the particular case $m=7$ the inverses are
$$(\bar{1})^{-1}=\bar{1},\;(\bar{2})^{-1}=\bar{4},\;(\bar{3})^{-1}=\bar{5},\;(\bar{4})^{-1}=\bar{2},\;(\bar{5})^{-1}=\bar{3},\;(\bar{6})^{-1}=\bar{6}$$
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 17 ·
Replies
17
Views
7K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 21 ·
Replies
21
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K