Question about mod function and congruences

  • Thread starter Thread starter John112
  • Start date Start date
  • Tags Tags
    Function
AI Thread Summary
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 mathematically as a ≡ b (mod m) leading to m | (a - b). The reasoning is that if a and b can be represented as a = mp + r and b = mq + r, where r is the common remainder, then subtracting these gives a - b = m(p - q), which is clearly divisible by m. Examples provided illustrate this concept effectively, confirming that the difference retains divisibility by m. Understanding this relationship is fundamental in modular arithmetic.
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:
Mathematics 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!
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top