I have difficulty understanding Modulo ? What is its meaning?

  • Thread starter Thread starter kntsy
  • Start date Start date
  • Tags Tags
    Difficulty
kntsy
Messages
80
Reaction score
0
I have difficulty understanding "Modulo"? What is its meaning?

a\equiv b\left(mod n\right)
means a is "congruent" to b "modulo" n
means a-b=knExcept accepting this is an equivalence relation, I feel very uncomfortable about "modulo" because of the lack of visual picture of this concept.
Everytime i have to move the "b" to the left side and see if "k" exists. This is very annoying and it totally shuts down my math intuition.
Why do mathematicians introduce this concept? Will it lead to any profound meaning/result? Also as "a" and "b" can be very far away, why use the word "congruent"?
 
Mathematics news on Phys.org


kntsy said:
a\equiv b\left(mod n\right)
means a is "congruent" to b "modulo" n
means a-b=kn


Except accepting this is an equivalence relation, I feel very uncomfortable about "modulo" because of the lack of visual picture of this concept.
Everytime i have to move the "b" to the left side and see if "k" exists. This is very annoying and it totally shuts down my math intuition.
Why do mathematicians introduce this concept? Will it lead to any profound meaning/result? Also as "a" and "b" can be very far away, why use the word "congruent"?
"congruent" has nothing to do with be close. "Congruent" means "the same in this particular way" where "this particular way" is defined for that particular use of "congruent".

In "modulo" arithmetic a\equiv b (mod n) if and only if dividing each by n gives the same remainder. 7\equive 19 (mod 4) because dividing 7 by 4 gives a quotient of 1 and a remainder of 3 while dividing 19 by 4 gives a quotient of 4 and a remainder of 3. We are ignoring the quotient and looking only at the remainder.
 
Last edited by a moderator:


HallsofIvy said:
"congruent" has nothing to do with be close. "Congruent" means "the same in this particular way" where "this particular way" is defined for that particular use of "congruent".

In "modulo" arithmetic a\equiv b (mod n)[/math] if and only if dividing each by n gives the same remainder. 7\equive 19 (mod 4)[/math] because dividng 7 by 4 gives a quotient of 1 and a remainder of 3 while dividing 19 by 4 gives a quotient of 4 and a remainder of 3. We are ignoring the quotient and looking only at the remainder.
<br /> <br /> thanks hallsofivy. excellent examples and explanations.
 
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...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top