Question about mod function and congruences

  • Context: Undergrad 
  • Thread starter Thread starter John112
  • Start date Start date
  • Tags Tags
    Function
Click For Summary
SUMMARY

The discussion centers on the mathematical concept of congruences, specifically how two integers \(a\) and \(b\) having the same remainder when divided by a common divisor \(m\) implies that their difference \(a - b\) is also divisible by \(m\). This is expressed as \(a \equiv b \,(\text{mod } m) \Rightarrow m \mid (a - b)\). The examples provided, such as \(29 \equiv 15 \,(\text{mod } 7)\) and \(11 \equiv 4 \,(\text{mod } 7)\), illustrate this principle by showing that the differences \(29 - 15\) and \(11 - 4\) are indeed divisible by \(7\). The reasoning is confirmed by the presence of integers \(p\) and \(q\) that satisfy the equations \(a = 7p + r\) and \(b = 7q + r\) for the common remainder \(r\).

PREREQUISITES
  • Understanding of modular arithmetic
  • Familiarity with the concept of divisibility
  • Basic algebraic manipulation skills
  • Knowledge of integer properties
NEXT STEPS
  • Study the properties of modular arithmetic in detail
  • Learn about the Euclidean algorithm for finding greatest common divisors
  • Explore applications of congruences in number theory
  • Investigate the Chinese Remainder Theorem for solving systems of congruences
USEFUL FOR

Mathematicians, students studying number theory, educators teaching modular arithmetic, and anyone interested in understanding the properties of integers and their relationships through congruences.

John112
Messages
19
Reaction score
0
Im having a bit of hard time understanding how is that two intergers (a and b) divided by a common divisor (m) have the same remainder imply that the difference of (a and b) will aslo be divisible by m?

Essentially what I am asking is:

a \equiv b (mod m) \Rightarrow m|(a-b)

the "|" means divides just incase you aren't fimiliar with that symbol.

a \equiv b (mod m) says a/m and b/m will have the same remainder. Since, they have the same remainder (a - b) will also be be divisible by m.

example 1) 29 \equiv 15 (mod 7) \Rightarrow 7|(29 -15)

Why is the difference of 29 -15 also divisible by 7?

Is it because when since 29 and 15 have the same reminder means that we are simply taking out factors of 7 and the common reminder from the 29 and 15?

29 - 15
[7(4) + 1] - [ 7(2) + 1]

= 7(2) = 14 which is divisible by 7example 2) 11 \equiv 4 (mod 7) \Rightarrow 7|(11 - 4)
11 - 4
[7(1) + 4] - [7(0) + 4]

= 7 which is divisible by 7Even if my reasoning is correct, please try to explain in your own way. I can do it mathmetically but that problem I am having is understanding it.
 
Last edited:
Physics news on Phys.org
Hi John112! :smile:

Yes, your reasoning is correct.

If a and b are both = 4 (mod 7),

then there exist integers p and q such a = 7p + 4, b = 7q + 4,

so a - b = 7(p - q). :wink:
 
tiny-tim said:
Hi John112! :smile:

Yes, your reasoning is correct.

If a and b are both = 4 (mod 7),

then there exist integers p and q such a = 7p + 4, b = 7q + 4,

so a - b = 7(p - q). :wink:

Thanks for that clear explanation tiny-tim!
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
8
Views
7K
Replies
3
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 6 ·
Replies
6
Views
3K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K