Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Modular arithmetic

  1. Jul 13, 2014 #1
    Please see the attached,which was quoted from the following website:

    It said that the multiplicative property is only applicable if n is an integer.On the contrary,the addition property can be applied to all real numbers.
    I don't quite understand what this sentence means.Can anyone explain it to me?Any mathematical proof provided will be appreciated.

    Attached Files:

    • ???.png
      File size:
      11.3 KB
  2. jcsd
  3. Jul 13, 2014 #2
    Well suppose all [tex]a_1,a_2,b_1,b_2,n[/tex] are real numbers and that
    [tex]a_1=b_1 (mod n)[/tex]
    [tex]a_2=b_2 (mod n)[/tex]
    then by the definition of mod n equality we can conclude that there exist integers [tex]k_1,k_2[/tex] such that [tex]a_1-b_1=k_1n , a_2-b_2=k_2n[/tex]
    so by adding the last 2 equations we have [tex](a_1+a_2)-(b_1+b_2)=(k_1+k_2)n[/tex] therefore there exists the integer [tex]k_3=k_1+k_2[/tex] such that [tex](a_1+a_2)-(b_1+b_2)=(k_3)n[/tex] hence by definition of (mod n) equality this means that [tex](a_1+a_2)=(b_1+b_2) (mod n)[/tex]. As you see in the proof we dont need anything of the a's or b's or the n to be integer.

    However if we want to prove that [tex]a_1a_2=b_1b_2 (mod n) (1)[/tex] we gonna need a's and b's as well n to be integers because the proof goes like this:
    [tex]a_1a_2-a_1b_2-b_1a_2+b_1b_2=k_1k_2n^2[/tex] so n has to be integer in order for [tex](a_1a_2+b_1b_2)=(a_1b_2+b_1a_2) (mod n) (2)[/tex] . We will also need a's and b's to be integers in order to prove that [tex]a_1b_2=b_1b_2 (mod n) (3.1) b_1b_2=b_1a_2 (mod n) (3.2)[/tex] hold. From (2) and (3)s we can infer the (1).
    Last edited: Jul 13, 2014
  4. Jul 13, 2014 #3
    Why did a1a2−a1b2−b1a2+b1b2=k1k2n2?
  5. Jul 13, 2014 #4
    By multiplying [tex]a_1-b_1=k_1n , a_2-b_2=k_2n[/tex] together. I have omitted some steps cause it isnt allowed here to give too much help with homework.

    Eventually to prove why (1) doesnt hold if all a's and b's and n are real, you ll have to construct a counter example. I just pinpointed where the proof goes wrong if a's and b's and n arent all integers, but one could claim that there might be another proof specific made for when a's and b's and n are reals.
    Last edited: Jul 13, 2014
  6. Jul 14, 2014 #5
    Sorry,please see the attached,I came up with a contradiction while proving the above.If my proof is correct,then the multiplicative property can be applied to rational numbers,so there must be something wrong but I couldn't find it.Thx very much

    Attached Files:

  7. Jul 14, 2014 #6
    The final expression for a1a2-b1b2 should have k1 inside as well and not only k2. Anyway it seems for specific a's and b's that satisfy some extra equations, the multiplicative property could hold for those specific rationals , but you want to hold for every rational in order to be usefull.
  8. Jul 14, 2014 #7
    thx for your help
  9. Jul 14, 2014 #8
    You are welcome :)
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Similar Discussions: Modular arithmetic
  1. Help: modular arithmetic (Replies: 17)

  2. Modular arithmetic (Replies: 5)